./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/openssl-simplified/s3_clnt_3.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 20ed64ec Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/openssl-simplified/s3_clnt_3.cil-1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7e741634054dd50a048146b108e465f8b335e64a ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.1-dev-20ed64e [2021-08-25 20:12:21,510 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-25 20:12:21,513 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-25 20:12:21,559 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-25 20:12:21,560 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-25 20:12:21,563 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-25 20:12:21,565 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-25 20:12:21,571 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-25 20:12:21,573 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-25 20:12:21,577 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-25 20:12:21,578 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-25 20:12:21,579 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-25 20:12:21,579 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-25 20:12:21,580 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-25 20:12:21,581 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-25 20:12:21,582 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-25 20:12:21,582 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-25 20:12:21,583 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-25 20:12:21,584 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-25 20:12:21,586 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-25 20:12:21,587 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-25 20:12:21,588 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-25 20:12:21,589 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-25 20:12:21,590 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-25 20:12:21,592 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-25 20:12:21,592 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-25 20:12:21,592 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-25 20:12:21,593 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-25 20:12:21,593 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-25 20:12:21,594 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-25 20:12:21,594 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-25 20:12:21,595 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-25 20:12:21,595 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-25 20:12:21,596 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-25 20:12:21,597 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-25 20:12:21,597 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-25 20:12:21,598 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-25 20:12:21,598 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-25 20:12:21,598 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-25 20:12:21,599 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-25 20:12:21,599 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-25 20:12:21,600 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-08-25 20:12:21,622 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-25 20:12:21,622 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-25 20:12:21,623 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-25 20:12:21,623 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-25 20:12:21,624 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-25 20:12:21,624 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-25 20:12:21,624 INFO L138 SettingsManager]: * Use SBE=true [2021-08-25 20:12:21,624 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-25 20:12:21,625 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-25 20:12:21,625 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-25 20:12:21,625 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-25 20:12:21,625 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-25 20:12:21,625 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-08-25 20:12:21,625 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-08-25 20:12:21,625 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-08-25 20:12:21,625 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-25 20:12:21,626 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-25 20:12:21,626 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-25 20:12:21,626 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-08-25 20:12:21,626 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-25 20:12:21,626 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-25 20:12:21,626 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-08-25 20:12:21,626 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-25 20:12:21,627 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-25 20:12:21,627 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-08-25 20:12:21,627 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-08-25 20:12:21,627 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-25 20:12:21,627 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-08-25 20:12:21,627 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-08-25 20:12:21,627 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-25 20:12:21,628 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 7e741634054dd50a048146b108e465f8b335e64a [2021-08-25 20:12:21,920 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-25 20:12:21,946 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-25 20:12:21,948 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-25 20:12:21,949 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-25 20:12:21,950 INFO L275 PluginConnector]: CDTParser initialized [2021-08-25 20:12:21,951 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/openssl-simplified/s3_clnt_3.cil-1.c [2021-08-25 20:12:22,045 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/55585ea45/73dc8382b9374aee8f2036c0131ac22b/FLAG0083d81ac [2021-08-25 20:12:22,797 INFO L306 CDTParser]: Found 1 translation units. [2021-08-25 20:12:22,798 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/openssl-simplified/s3_clnt_3.cil-1.c [2021-08-25 20:12:22,810 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/55585ea45/73dc8382b9374aee8f2036c0131ac22b/FLAG0083d81ac [2021-08-25 20:12:23,036 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/55585ea45/73dc8382b9374aee8f2036c0131ac22b [2021-08-25 20:12:23,038 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-25 20:12:23,039 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-08-25 20:12:23,045 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-25 20:12:23,045 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-25 20:12:23,052 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-25 20:12:23,053 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.08 08:12:23" (1/1) ... [2021-08-25 20:12:23,062 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@664dd88b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:12:23, skipping insertion in model container [2021-08-25 20:12:23,062 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.08 08:12:23" (1/1) ... [2021-08-25 20:12:23,068 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-25 20:12:23,132 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-25 20:12:23,530 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/openssl-simplified/s3_clnt_3.cil-1.c[36410,36423] [2021-08-25 20:12:23,551 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-25 20:12:23,562 INFO L203 MainTranslator]: Completed pre-run [2021-08-25 20:12:23,618 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/openssl-simplified/s3_clnt_3.cil-1.c[36410,36423] [2021-08-25 20:12:23,623 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-25 20:12:23,635 INFO L208 MainTranslator]: Completed translation [2021-08-25 20:12:23,635 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:12:23 WrapperNode [2021-08-25 20:12:23,636 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-25 20:12:23,637 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-25 20:12:23,637 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-25 20:12:23,638 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-25 20:12:23,643 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:12:23" (1/1) ... [2021-08-25 20:12:23,661 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:12:23" (1/1) ... [2021-08-25 20:12:23,702 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-25 20:12:23,703 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-25 20:12:23,703 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-25 20:12:23,703 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-25 20:12:23,715 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:12:23" (1/1) ... [2021-08-25 20:12:23,715 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:12:23" (1/1) ... [2021-08-25 20:12:23,726 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:12:23" (1/1) ... [2021-08-25 20:12:23,726 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:12:23" (1/1) ... [2021-08-25 20:12:23,731 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:12:23" (1/1) ... [2021-08-25 20:12:23,740 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:12:23" (1/1) ... [2021-08-25 20:12:23,742 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:12:23" (1/1) ... [2021-08-25 20:12:23,744 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-25 20:12:23,745 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-25 20:12:23,746 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-25 20:12:23,746 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-25 20:12:23,746 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:12:23" (1/1) ... [2021-08-25 20:12:23,752 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-25 20:12:23,759 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-25 20:12:23,779 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-08-25 20:12:23,821 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-08-25 20:12:23,858 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-25 20:12:23,858 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-25 20:12:23,859 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-08-25 20:12:23,859 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-25 20:12:24,005 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-08-25 20:12:24,415 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2021-08-25 20:12:24,415 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2021-08-25 20:12:24,423 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-25 20:12:24,424 INFO L299 CfgBuilder]: Removed 7 assume(true) statements. [2021-08-25 20:12:24,426 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.08 08:12:24 BoogieIcfgContainer [2021-08-25 20:12:24,426 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-25 20:12:24,428 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-08-25 20:12:24,428 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-08-25 20:12:24,431 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-08-25 20:12:24,431 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.08 08:12:23" (1/3) ... [2021-08-25 20:12:24,432 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27c6d907 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.08 08:12:24, skipping insertion in model container [2021-08-25 20:12:24,432 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:12:23" (2/3) ... [2021-08-25 20:12:24,432 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27c6d907 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.08 08:12:24, skipping insertion in model container [2021-08-25 20:12:24,432 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.08 08:12:24" (3/3) ... [2021-08-25 20:12:24,434 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_clnt_3.cil-1.c [2021-08-25 20:12:24,444 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-08-25 20:12:24,444 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-08-25 20:12:24,493 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-08-25 20:12:24,501 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-08-25 20:12:24,501 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-08-25 20:12:24,519 INFO L276 IsEmpty]: Start isEmpty. Operand has 124 states, 122 states have (on average 1.7377049180327868) internal successors, (212), 123 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:12:24,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-08-25 20:12:24,526 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:12:24,526 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:12:24,527 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:12:24,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:12:24,532 INFO L82 PathProgramCache]: Analyzing trace with hash -1457697026, now seen corresponding path program 1 times [2021-08-25 20:12:24,541 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:12:24,541 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445798853] [2021-08-25 20:12:24,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:12:24,542 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:12:24,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:12:24,751 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:12:24,752 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:12:24,752 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445798853] [2021-08-25 20:12:24,752 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [445798853] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:12:24,753 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:12:24,753 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:12:24,762 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588753451] [2021-08-25 20:12:24,768 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:12:24,769 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:12:24,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:12:24,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:12:24,784 INFO L87 Difference]: Start difference. First operand has 124 states, 122 states have (on average 1.7377049180327868) internal successors, (212), 123 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:12:24,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:12:24,943 INFO L93 Difference]: Finished difference Result 244 states and 419 transitions. [2021-08-25 20:12:24,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:12:24,945 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2021-08-25 20:12:24,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:12:24,953 INFO L225 Difference]: With dead ends: 244 [2021-08-25 20:12:24,953 INFO L226 Difference]: Without dead ends: 112 [2021-08-25 20:12:24,956 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.8ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:12:24,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2021-08-25 20:12:24,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2021-08-25 20:12:24,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 111 states have (on average 1.5225225225225225) internal successors, (169), 111 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:12:24,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 169 transitions. [2021-08-25 20:12:24,991 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 169 transitions. Word has length 24 [2021-08-25 20:12:24,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:12:24,992 INFO L470 AbstractCegarLoop]: Abstraction has 112 states and 169 transitions. [2021-08-25 20:12:24,992 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:12:24,992 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 169 transitions. [2021-08-25 20:12:24,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-08-25 20:12:24,993 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:12:24,994 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:12:24,994 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-08-25 20:12:24,994 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:12:24,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:12:24,995 INFO L82 PathProgramCache]: Analyzing trace with hash -611475394, now seen corresponding path program 1 times [2021-08-25 20:12:24,995 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:12:24,996 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799360695] [2021-08-25 20:12:24,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:12:24,996 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:12:25,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:12:25,050 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:12:25,051 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:12:25,051 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799360695] [2021-08-25 20:12:25,051 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1799360695] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:12:25,051 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:12:25,052 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:12:25,052 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644959282] [2021-08-25 20:12:25,053 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:12:25,053 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:12:25,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:12:25,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:12:25,054 INFO L87 Difference]: Start difference. First operand 112 states and 169 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:12:25,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:12:25,158 INFO L93 Difference]: Finished difference Result 232 states and 354 transitions. [2021-08-25 20:12:25,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:12:25,159 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2021-08-25 20:12:25,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:12:25,161 INFO L225 Difference]: With dead ends: 232 [2021-08-25 20:12:25,161 INFO L226 Difference]: Without dead ends: 130 [2021-08-25 20:12:25,162 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:12:25,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2021-08-25 20:12:25,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 127. [2021-08-25 20:12:25,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 126 states have (on average 1.5) internal successors, (189), 126 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:12:25,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 189 transitions. [2021-08-25 20:12:25,180 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 189 transitions. Word has length 36 [2021-08-25 20:12:25,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:12:25,181 INFO L470 AbstractCegarLoop]: Abstraction has 127 states and 189 transitions. [2021-08-25 20:12:25,181 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:12:25,181 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 189 transitions. [2021-08-25 20:12:25,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2021-08-25 20:12:25,182 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:12:25,183 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:12:25,183 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-08-25 20:12:25,183 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:12:25,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:12:25,184 INFO L82 PathProgramCache]: Analyzing trace with hash -114868729, now seen corresponding path program 1 times [2021-08-25 20:12:25,184 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:12:25,184 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809156883] [2021-08-25 20:12:25,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:12:25,185 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:12:25,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:12:25,262 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-08-25 20:12:25,263 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:12:25,265 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809156883] [2021-08-25 20:12:25,266 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [809156883] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:12:25,266 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:12:25,267 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:12:25,267 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217064999] [2021-08-25 20:12:25,268 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:12:25,269 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:12:25,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:12:25,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:12:25,272 INFO L87 Difference]: Start difference. First operand 127 states and 189 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:12:25,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:12:25,405 INFO L93 Difference]: Finished difference Result 266 states and 402 transitions. [2021-08-25 20:12:25,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:12:25,406 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2021-08-25 20:12:25,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:12:25,407 INFO L225 Difference]: With dead ends: 266 [2021-08-25 20:12:25,407 INFO L226 Difference]: Without dead ends: 149 [2021-08-25 20:12:25,408 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:12:25,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2021-08-25 20:12:25,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 144. [2021-08-25 20:12:25,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 143 states have (on average 1.4755244755244756) internal successors, (211), 143 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:12:25,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 211 transitions. [2021-08-25 20:12:25,417 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 211 transitions. Word has length 50 [2021-08-25 20:12:25,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:12:25,418 INFO L470 AbstractCegarLoop]: Abstraction has 144 states and 211 transitions. [2021-08-25 20:12:25,418 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:12:25,418 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 211 transitions. [2021-08-25 20:12:25,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-08-25 20:12:25,421 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:12:25,421 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:12:25,422 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-08-25 20:12:25,422 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:12:25,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:12:25,423 INFO L82 PathProgramCache]: Analyzing trace with hash -682645784, now seen corresponding path program 1 times [2021-08-25 20:12:25,423 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:12:25,423 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228985655] [2021-08-25 20:12:25,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:12:25,424 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:12:25,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:12:25,694 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-08-25 20:12:25,694 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:12:25,694 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228985655] [2021-08-25 20:12:25,694 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [228985655] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:12:25,695 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:12:25,695 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:12:25,695 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906982571] [2021-08-25 20:12:25,695 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:12:25,695 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:12:25,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:12:25,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:12:25,696 INFO L87 Difference]: Start difference. First operand 144 states and 211 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:12:25,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:12:25,867 INFO L93 Difference]: Finished difference Result 328 states and 496 transitions. [2021-08-25 20:12:25,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:12:25,868 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2021-08-25 20:12:25,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:12:25,869 INFO L225 Difference]: With dead ends: 328 [2021-08-25 20:12:25,869 INFO L226 Difference]: Without dead ends: 193 [2021-08-25 20:12:25,870 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 63.9ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:12:25,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2021-08-25 20:12:25,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 185. [2021-08-25 20:12:25,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 184 states have (on average 1.4184782608695652) internal successors, (261), 184 states have internal predecessors, (261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:12:25,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 261 transitions. [2021-08-25 20:12:25,878 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 261 transitions. Word has length 67 [2021-08-25 20:12:25,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:12:25,878 INFO L470 AbstractCegarLoop]: Abstraction has 185 states and 261 transitions. [2021-08-25 20:12:25,878 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:12:25,878 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 261 transitions. [2021-08-25 20:12:25,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-08-25 20:12:25,879 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:12:25,880 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:12:25,880 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-08-25 20:12:25,880 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:12:25,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:12:25,881 INFO L82 PathProgramCache]: Analyzing trace with hash 1806883178, now seen corresponding path program 1 times [2021-08-25 20:12:25,881 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:12:25,881 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997436298] [2021-08-25 20:12:25,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:12:25,881 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:12:25,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:12:25,949 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-08-25 20:12:25,950 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:12:25,951 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997436298] [2021-08-25 20:12:25,951 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1997436298] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:12:25,951 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:12:25,951 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:12:25,951 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615849514] [2021-08-25 20:12:25,952 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:12:25,952 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:12:25,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:12:25,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:12:25,953 INFO L87 Difference]: Start difference. First operand 185 states and 261 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:12:26,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:12:26,077 INFO L93 Difference]: Finished difference Result 383 states and 548 transitions. [2021-08-25 20:12:26,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:12:26,078 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2021-08-25 20:12:26,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:12:26,079 INFO L225 Difference]: With dead ends: 383 [2021-08-25 20:12:26,079 INFO L226 Difference]: Without dead ends: 208 [2021-08-25 20:12:26,081 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:12:26,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2021-08-25 20:12:26,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 204. [2021-08-25 20:12:26,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 203 states have (on average 1.4039408866995073) internal successors, (285), 203 states have internal predecessors, (285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:12:26,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 285 transitions. [2021-08-25 20:12:26,108 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 285 transitions. Word has length 67 [2021-08-25 20:12:26,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:12:26,108 INFO L470 AbstractCegarLoop]: Abstraction has 204 states and 285 transitions. [2021-08-25 20:12:26,108 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:12:26,109 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 285 transitions. [2021-08-25 20:12:26,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2021-08-25 20:12:26,113 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:12:26,113 INFO L512 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:12:26,113 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-08-25 20:12:26,114 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:12:26,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:12:26,114 INFO L82 PathProgramCache]: Analyzing trace with hash 170492736, now seen corresponding path program 1 times [2021-08-25 20:12:26,114 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:12:26,114 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872018676] [2021-08-25 20:12:26,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:12:26,115 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:12:26,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:12:26,205 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2021-08-25 20:12:26,206 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:12:26,206 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872018676] [2021-08-25 20:12:26,206 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1872018676] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:12:26,206 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:12:26,206 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:12:26,207 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442987273] [2021-08-25 20:12:26,207 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:12:26,207 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:12:26,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:12:26,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:12:26,208 INFO L87 Difference]: Start difference. First operand 204 states and 285 transitions. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:12:26,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:12:26,396 INFO L93 Difference]: Finished difference Result 422 states and 598 transitions. [2021-08-25 20:12:26,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:12:26,397 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 83 [2021-08-25 20:12:26,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:12:26,399 INFO L225 Difference]: With dead ends: 422 [2021-08-25 20:12:26,399 INFO L226 Difference]: Without dead ends: 228 [2021-08-25 20:12:26,399 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:12:26,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2021-08-25 20:12:26,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 225. [2021-08-25 20:12:26,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 224 states have (on average 1.3883928571428572) internal successors, (311), 224 states have internal predecessors, (311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:12:26,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 311 transitions. [2021-08-25 20:12:26,405 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 311 transitions. Word has length 83 [2021-08-25 20:12:26,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:12:26,406 INFO L470 AbstractCegarLoop]: Abstraction has 225 states and 311 transitions. [2021-08-25 20:12:26,406 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:12:26,406 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 311 transitions. [2021-08-25 20:12:26,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2021-08-25 20:12:26,407 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:12:26,407 INFO L512 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:12:26,407 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-08-25 20:12:26,407 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:12:26,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:12:26,408 INFO L82 PathProgramCache]: Analyzing trace with hash -1976749000, now seen corresponding path program 1 times [2021-08-25 20:12:26,408 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:12:26,408 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980978879] [2021-08-25 20:12:26,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:12:26,409 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:12:26,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:12:26,451 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2021-08-25 20:12:26,452 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:12:26,452 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980978879] [2021-08-25 20:12:26,452 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1980978879] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:12:26,452 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:12:26,453 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:12:26,453 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147312532] [2021-08-25 20:12:26,453 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:12:26,454 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:12:26,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:12:26,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:12:26,455 INFO L87 Difference]: Start difference. First operand 225 states and 311 transitions. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:12:26,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:12:26,486 INFO L93 Difference]: Finished difference Result 652 states and 903 transitions. [2021-08-25 20:12:26,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:12:26,487 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 103 [2021-08-25 20:12:26,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:12:26,489 INFO L225 Difference]: With dead ends: 652 [2021-08-25 20:12:26,490 INFO L226 Difference]: Without dead ends: 437 [2021-08-25 20:12:26,490 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:12:26,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2021-08-25 20:12:26,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 437. [2021-08-25 20:12:26,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 437 states, 436 states have (on average 1.3761467889908257) internal successors, (600), 436 states have internal predecessors, (600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:12:26,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 437 states and 600 transitions. [2021-08-25 20:12:26,502 INFO L78 Accepts]: Start accepts. Automaton has 437 states and 600 transitions. Word has length 103 [2021-08-25 20:12:26,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:12:26,502 INFO L470 AbstractCegarLoop]: Abstraction has 437 states and 600 transitions. [2021-08-25 20:12:26,503 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:12:26,503 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 600 transitions. [2021-08-25 20:12:26,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2021-08-25 20:12:26,504 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:12:26,504 INFO L512 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:12:26,504 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-08-25 20:12:26,504 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:12:26,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:12:26,505 INFO L82 PathProgramCache]: Analyzing trace with hash -102965200, now seen corresponding path program 1 times [2021-08-25 20:12:26,505 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:12:26,505 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680439978] [2021-08-25 20:12:26,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:12:26,506 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:12:26,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:12:26,534 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2021-08-25 20:12:26,534 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:12:26,535 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680439978] [2021-08-25 20:12:26,535 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1680439978] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:12:26,535 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:12:26,535 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:12:26,535 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773932791] [2021-08-25 20:12:26,536 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:12:26,536 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:12:26,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:12:26,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:12:26,537 INFO L87 Difference]: Start difference. First operand 437 states and 600 transitions. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:12:26,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:12:26,556 INFO L93 Difference]: Finished difference Result 885 states and 1214 transitions. [2021-08-25 20:12:26,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:12:26,557 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 104 [2021-08-25 20:12:26,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:12:26,559 INFO L225 Difference]: With dead ends: 885 [2021-08-25 20:12:26,559 INFO L226 Difference]: Without dead ends: 458 [2021-08-25 20:12:26,560 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:12:26,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2021-08-25 20:12:26,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 458. [2021-08-25 20:12:26,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 458 states, 457 states have (on average 1.3719912472647702) internal successors, (627), 457 states have internal predecessors, (627), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:12:26,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 627 transitions. [2021-08-25 20:12:26,570 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 627 transitions. Word has length 104 [2021-08-25 20:12:26,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:12:26,570 INFO L470 AbstractCegarLoop]: Abstraction has 458 states and 627 transitions. [2021-08-25 20:12:26,570 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:12:26,571 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 627 transitions. [2021-08-25 20:12:26,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2021-08-25 20:12:26,572 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:12:26,572 INFO L512 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:12:26,572 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-08-25 20:12:26,572 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:12:26,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:12:26,573 INFO L82 PathProgramCache]: Analyzing trace with hash 736068462, now seen corresponding path program 1 times [2021-08-25 20:12:26,573 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:12:26,573 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020937183] [2021-08-25 20:12:26,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:12:26,573 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:12:26,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:12:26,610 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2021-08-25 20:12:26,610 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:12:26,610 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020937183] [2021-08-25 20:12:26,610 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1020937183] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:12:26,611 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:12:26,611 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:12:26,611 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180635549] [2021-08-25 20:12:26,611 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:12:26,612 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:12:26,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:12:26,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:12:26,612 INFO L87 Difference]: Start difference. First operand 458 states and 627 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:12:26,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:12:26,636 INFO L93 Difference]: Finished difference Result 932 states and 1274 transitions. [2021-08-25 20:12:26,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:12:26,636 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 104 [2021-08-25 20:12:26,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:12:26,638 INFO L225 Difference]: With dead ends: 932 [2021-08-25 20:12:26,638 INFO L226 Difference]: Without dead ends: 484 [2021-08-25 20:12:26,639 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:12:26,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 484 states. [2021-08-25 20:12:26,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 484 to 484. [2021-08-25 20:12:26,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 484 states, 483 states have (on average 1.3664596273291925) internal successors, (660), 483 states have internal predecessors, (660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:12:26,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 660 transitions. [2021-08-25 20:12:26,649 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 660 transitions. Word has length 104 [2021-08-25 20:12:26,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:12:26,650 INFO L470 AbstractCegarLoop]: Abstraction has 484 states and 660 transitions. [2021-08-25 20:12:26,650 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:12:26,650 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 660 transitions. [2021-08-25 20:12:26,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-08-25 20:12:26,651 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:12:26,651 INFO L512 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:12:26,652 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-08-25 20:12:26,652 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:12:26,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:12:26,652 INFO L82 PathProgramCache]: Analyzing trace with hash 1108389378, now seen corresponding path program 1 times [2021-08-25 20:12:26,653 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:12:26,653 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186519883] [2021-08-25 20:12:26,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:12:26,653 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:12:26,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:12:26,685 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2021-08-25 20:12:26,686 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:12:26,686 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186519883] [2021-08-25 20:12:26,686 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1186519883] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:12:26,686 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:12:26,686 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:12:26,687 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160327689] [2021-08-25 20:12:26,687 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:12:26,687 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:12:26,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:12:26,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:12:26,688 INFO L87 Difference]: Start difference. First operand 484 states and 660 transitions. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:12:26,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:12:26,722 INFO L93 Difference]: Finished difference Result 699 states and 957 transitions. [2021-08-25 20:12:26,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:12:26,723 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2021-08-25 20:12:26,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:12:26,726 INFO L225 Difference]: With dead ends: 699 [2021-08-25 20:12:26,726 INFO L226 Difference]: Without dead ends: 697 [2021-08-25 20:12:26,726 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:12:26,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 697 states. [2021-08-25 20:12:26,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 697 to 697. [2021-08-25 20:12:26,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 697 states, 696 states have (on average 1.3721264367816093) internal successors, (955), 696 states have internal predecessors, (955), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:12:26,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 697 states to 697 states and 955 transitions. [2021-08-25 20:12:26,738 INFO L78 Accepts]: Start accepts. Automaton has 697 states and 955 transitions. Word has length 105 [2021-08-25 20:12:26,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:12:26,739 INFO L470 AbstractCegarLoop]: Abstraction has 697 states and 955 transitions. [2021-08-25 20:12:26,739 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:12:26,739 INFO L276 IsEmpty]: Start isEmpty. Operand 697 states and 955 transitions. [2021-08-25 20:12:26,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2021-08-25 20:12:26,740 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:12:26,745 INFO L512 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:12:26,745 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-08-25 20:12:26,745 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:12:26,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:12:26,746 INFO L82 PathProgramCache]: Analyzing trace with hash -391134295, now seen corresponding path program 1 times [2021-08-25 20:12:26,746 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:12:26,748 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220711204] [2021-08-25 20:12:26,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:12:26,748 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:12:26,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:12:26,811 INFO L134 CoverageAnalysis]: Checked inductivity of 383 backedges. 259 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2021-08-25 20:12:26,812 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:12:26,812 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220711204] [2021-08-25 20:12:26,812 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1220711204] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:12:26,812 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:12:26,812 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:12:26,812 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940345614] [2021-08-25 20:12:26,813 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:12:26,813 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:12:26,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:12:26,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:12:26,815 INFO L87 Difference]: Start difference. First operand 697 states and 955 transitions. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:12:26,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:12:26,969 INFO L93 Difference]: Finished difference Result 1508 states and 2127 transitions. [2021-08-25 20:12:26,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:12:26,969 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 159 [2021-08-25 20:12:26,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:12:26,973 INFO L225 Difference]: With dead ends: 1508 [2021-08-25 20:12:26,973 INFO L226 Difference]: Without dead ends: 844 [2021-08-25 20:12:26,974 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:12:26,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 844 states. [2021-08-25 20:12:26,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 844 to 814. [2021-08-25 20:12:26,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 814 states, 813 states have (on average 1.4071340713407134) internal successors, (1144), 813 states have internal predecessors, (1144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:12:26,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 814 states to 814 states and 1144 transitions. [2021-08-25 20:12:26,992 INFO L78 Accepts]: Start accepts. Automaton has 814 states and 1144 transitions. Word has length 159 [2021-08-25 20:12:26,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:12:26,992 INFO L470 AbstractCegarLoop]: Abstraction has 814 states and 1144 transitions. [2021-08-25 20:12:26,993 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:12:26,993 INFO L276 IsEmpty]: Start isEmpty. Operand 814 states and 1144 transitions. [2021-08-25 20:12:26,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2021-08-25 20:12:26,995 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:12:26,995 INFO L512 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 9, 9, 9, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:12:26,996 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-08-25 20:12:26,996 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:12:26,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:12:26,996 INFO L82 PathProgramCache]: Analyzing trace with hash -408594384, now seen corresponding path program 1 times [2021-08-25 20:12:26,997 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:12:26,997 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476171092] [2021-08-25 20:12:26,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:12:26,997 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:12:27,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:12:27,041 INFO L134 CoverageAnalysis]: Checked inductivity of 525 backedges. 325 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2021-08-25 20:12:27,042 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:12:27,042 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476171092] [2021-08-25 20:12:27,042 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [476171092] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:12:27,042 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:12:27,042 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:12:27,043 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152796732] [2021-08-25 20:12:27,043 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:12:27,043 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:12:27,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:12:27,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:12:27,044 INFO L87 Difference]: Start difference. First operand 814 states and 1144 transitions. Second operand has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:12:27,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:12:27,205 INFO L93 Difference]: Finished difference Result 1870 states and 2708 transitions. [2021-08-25 20:12:27,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:12:27,206 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 185 [2021-08-25 20:12:27,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:12:27,210 INFO L225 Difference]: With dead ends: 1870 [2021-08-25 20:12:27,210 INFO L226 Difference]: Without dead ends: 1041 [2021-08-25 20:12:27,212 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:12:27,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1041 states. [2021-08-25 20:12:27,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1041 to 1003. [2021-08-25 20:12:27,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1003 states, 1002 states have (on average 1.3932135728542914) internal successors, (1396), 1002 states have internal predecessors, (1396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:12:27,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1003 states to 1003 states and 1396 transitions. [2021-08-25 20:12:27,233 INFO L78 Accepts]: Start accepts. Automaton has 1003 states and 1396 transitions. Word has length 185 [2021-08-25 20:12:27,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:12:27,233 INFO L470 AbstractCegarLoop]: Abstraction has 1003 states and 1396 transitions. [2021-08-25 20:12:27,234 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:12:27,234 INFO L276 IsEmpty]: Start isEmpty. Operand 1003 states and 1396 transitions. [2021-08-25 20:12:27,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2021-08-25 20:12:27,237 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:12:27,237 INFO L512 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 10, 10, 10, 10, 10, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:12:27,237 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-08-25 20:12:27,238 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:12:27,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:12:27,238 INFO L82 PathProgramCache]: Analyzing trace with hash -585141096, now seen corresponding path program 1 times [2021-08-25 20:12:27,238 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:12:27,238 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795450355] [2021-08-25 20:12:27,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:12:27,239 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:12:27,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:12:27,284 INFO L134 CoverageAnalysis]: Checked inductivity of 657 backedges. 402 proven. 0 refuted. 0 times theorem prover too weak. 255 trivial. 0 not checked. [2021-08-25 20:12:27,285 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:12:27,285 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795450355] [2021-08-25 20:12:27,285 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [795450355] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:12:27,285 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:12:27,285 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:12:27,285 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55096245] [2021-08-25 20:12:27,286 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:12:27,286 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:12:27,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:12:27,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:12:27,287 INFO L87 Difference]: Start difference. First operand 1003 states and 1396 transitions. Second operand has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:12:27,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:12:27,451 INFO L93 Difference]: Finished difference Result 2126 states and 2985 transitions. [2021-08-25 20:12:27,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:12:27,452 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 206 [2021-08-25 20:12:27,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:12:27,456 INFO L225 Difference]: With dead ends: 2126 [2021-08-25 20:12:27,456 INFO L226 Difference]: Without dead ends: 1114 [2021-08-25 20:12:27,457 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:12:27,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1114 states. [2021-08-25 20:12:27,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1114 to 1078. [2021-08-25 20:12:27,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1078 states, 1077 states have (on average 1.3853296193129063) internal successors, (1492), 1077 states have internal predecessors, (1492), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:12:27,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1078 states to 1078 states and 1492 transitions. [2021-08-25 20:12:27,494 INFO L78 Accepts]: Start accepts. Automaton has 1078 states and 1492 transitions. Word has length 206 [2021-08-25 20:12:27,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:12:27,495 INFO L470 AbstractCegarLoop]: Abstraction has 1078 states and 1492 transitions. [2021-08-25 20:12:27,495 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:12:27,495 INFO L276 IsEmpty]: Start isEmpty. Operand 1078 states and 1492 transitions. [2021-08-25 20:12:27,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2021-08-25 20:12:27,498 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:12:27,499 INFO L512 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 11, 11, 11, 11, 11, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:12:27,499 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-08-25 20:12:27,499 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:12:27,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:12:27,500 INFO L82 PathProgramCache]: Analyzing trace with hash 2110600453, now seen corresponding path program 1 times [2021-08-25 20:12:27,500 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:12:27,500 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320610544] [2021-08-25 20:12:27,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:12:27,501 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:12:27,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:12:27,561 INFO L134 CoverageAnalysis]: Checked inductivity of 805 backedges. 477 proven. 0 refuted. 0 times theorem prover too weak. 328 trivial. 0 not checked. [2021-08-25 20:12:27,562 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:12:27,562 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320610544] [2021-08-25 20:12:27,562 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1320610544] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:12:27,562 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:12:27,562 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:12:27,563 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565476482] [2021-08-25 20:12:27,564 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:12:27,564 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:12:27,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:12:27,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:12:27,565 INFO L87 Difference]: Start difference. First operand 1078 states and 1492 transitions. Second operand has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:12:27,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:12:27,721 INFO L93 Difference]: Finished difference Result 2276 states and 3174 transitions. [2021-08-25 20:12:27,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:12:27,721 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 230 [2021-08-25 20:12:27,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:12:27,725 INFO L225 Difference]: With dead ends: 2276 [2021-08-25 20:12:27,725 INFO L226 Difference]: Without dead ends: 1195 [2021-08-25 20:12:27,729 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:12:27,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1195 states. [2021-08-25 20:12:27,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1195 to 1162. [2021-08-25 20:12:27,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1162 states, 1161 states have (on average 1.3807062876830318) internal successors, (1603), 1161 states have internal predecessors, (1603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:12:27,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1162 states to 1162 states and 1603 transitions. [2021-08-25 20:12:27,751 INFO L78 Accepts]: Start accepts. Automaton has 1162 states and 1603 transitions. Word has length 230 [2021-08-25 20:12:27,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:12:27,751 INFO L470 AbstractCegarLoop]: Abstraction has 1162 states and 1603 transitions. [2021-08-25 20:12:27,751 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:12:27,751 INFO L276 IsEmpty]: Start isEmpty. Operand 1162 states and 1603 transitions. [2021-08-25 20:12:27,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2021-08-25 20:12:27,760 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:12:27,760 INFO L512 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 11, 11, 11, 11, 11, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:12:27,760 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-08-25 20:12:27,760 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:12:27,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:12:27,761 INFO L82 PathProgramCache]: Analyzing trace with hash 77206407, now seen corresponding path program 1 times [2021-08-25 20:12:27,761 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:12:27,761 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585175572] [2021-08-25 20:12:27,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:12:27,761 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:12:27,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:12:27,808 INFO L134 CoverageAnalysis]: Checked inductivity of 805 backedges. 477 proven. 0 refuted. 0 times theorem prover too weak. 328 trivial. 0 not checked. [2021-08-25 20:12:27,808 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:12:27,809 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585175572] [2021-08-25 20:12:27,809 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [585175572] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:12:27,809 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:12:27,809 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:12:27,809 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446317508] [2021-08-25 20:12:27,810 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:12:27,810 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:12:27,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:12:27,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:12:27,810 INFO L87 Difference]: Start difference. First operand 1162 states and 1603 transitions. Second operand has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:12:27,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:12:27,960 INFO L93 Difference]: Finished difference Result 2444 states and 3399 transitions. [2021-08-25 20:12:27,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:12:27,961 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 230 [2021-08-25 20:12:27,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:12:27,966 INFO L225 Difference]: With dead ends: 2444 [2021-08-25 20:12:27,966 INFO L226 Difference]: Without dead ends: 1291 [2021-08-25 20:12:27,967 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:12:27,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1291 states. [2021-08-25 20:12:27,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1291 to 1255. [2021-08-25 20:12:27,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1255 states, 1254 states have (on average 1.3835725677830941) internal successors, (1735), 1254 states have internal predecessors, (1735), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:12:27,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1255 states to 1255 states and 1735 transitions. [2021-08-25 20:12:27,991 INFO L78 Accepts]: Start accepts. Automaton has 1255 states and 1735 transitions. Word has length 230 [2021-08-25 20:12:27,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:12:27,991 INFO L470 AbstractCegarLoop]: Abstraction has 1255 states and 1735 transitions. [2021-08-25 20:12:27,991 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:12:27,991 INFO L276 IsEmpty]: Start isEmpty. Operand 1255 states and 1735 transitions. [2021-08-25 20:12:27,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2021-08-25 20:12:27,994 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:12:27,995 INFO L512 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 12, 12, 12, 12, 12, 10, 10, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:12:27,995 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-08-25 20:12:27,995 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:12:27,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:12:27,996 INFO L82 PathProgramCache]: Analyzing trace with hash -1837554521, now seen corresponding path program 1 times [2021-08-25 20:12:27,996 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:12:27,996 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594905746] [2021-08-25 20:12:27,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:12:27,996 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:12:28,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:12:28,049 INFO L134 CoverageAnalysis]: Checked inductivity of 973 backedges. 552 proven. 0 refuted. 0 times theorem prover too weak. 421 trivial. 0 not checked. [2021-08-25 20:12:28,049 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:12:28,049 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594905746] [2021-08-25 20:12:28,050 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594905746] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:12:28,050 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:12:28,050 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:12:28,050 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420263614] [2021-08-25 20:12:28,050 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:12:28,051 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:12:28,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:12:28,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:12:28,051 INFO L87 Difference]: Start difference. First operand 1255 states and 1735 transitions. Second operand has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:12:28,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:12:28,203 INFO L93 Difference]: Finished difference Result 2627 states and 3657 transitions. [2021-08-25 20:12:28,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:12:28,203 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 260 [2021-08-25 20:12:28,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:12:28,208 INFO L225 Difference]: With dead ends: 2627 [2021-08-25 20:12:28,208 INFO L226 Difference]: Without dead ends: 1393 [2021-08-25 20:12:28,210 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:12:28,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1393 states. [2021-08-25 20:12:28,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1393 to 1360. [2021-08-25 20:12:28,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1360 states, 1359 states have (on average 1.3914643119941132) internal successors, (1891), 1359 states have internal predecessors, (1891), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:12:28,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1360 states to 1360 states and 1891 transitions. [2021-08-25 20:12:28,237 INFO L78 Accepts]: Start accepts. Automaton has 1360 states and 1891 transitions. Word has length 260 [2021-08-25 20:12:28,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:12:28,238 INFO L470 AbstractCegarLoop]: Abstraction has 1360 states and 1891 transitions. [2021-08-25 20:12:28,238 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:12:28,238 INFO L276 IsEmpty]: Start isEmpty. Operand 1360 states and 1891 transitions. [2021-08-25 20:12:28,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2021-08-25 20:12:28,242 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:12:28,242 INFO L512 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 13, 13, 13, 13, 13, 11, 11, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:12:28,242 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-08-25 20:12:28,243 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:12:28,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:12:28,243 INFO L82 PathProgramCache]: Analyzing trace with hash -1040904442, now seen corresponding path program 1 times [2021-08-25 20:12:28,243 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:12:28,243 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526256649] [2021-08-25 20:12:28,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:12:28,244 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:12:28,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:12:28,309 INFO L134 CoverageAnalysis]: Checked inductivity of 1167 backedges. 627 proven. 0 refuted. 0 times theorem prover too weak. 540 trivial. 0 not checked. [2021-08-25 20:12:28,309 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:12:28,310 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526256649] [2021-08-25 20:12:28,310 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1526256649] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:12:28,310 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:12:28,310 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:12:28,310 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984827173] [2021-08-25 20:12:28,311 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:12:28,311 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:12:28,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:12:28,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:12:28,312 INFO L87 Difference]: Start difference. First operand 1360 states and 1891 transitions. Second operand has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:12:28,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:12:28,469 INFO L93 Difference]: Finished difference Result 2723 states and 3783 transitions. [2021-08-25 20:12:28,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:12:28,470 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 295 [2021-08-25 20:12:28,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:12:28,475 INFO L225 Difference]: With dead ends: 2723 [2021-08-25 20:12:28,475 INFO L226 Difference]: Without dead ends: 1390 [2021-08-25 20:12:28,477 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:12:28,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1390 states. [2021-08-25 20:12:28,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1390 to 1357. [2021-08-25 20:12:28,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1357 states, 1356 states have (on average 1.381268436578171) internal successors, (1873), 1356 states have internal predecessors, (1873), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:12:28,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1357 states to 1357 states and 1873 transitions. [2021-08-25 20:12:28,504 INFO L78 Accepts]: Start accepts. Automaton has 1357 states and 1873 transitions. Word has length 295 [2021-08-25 20:12:28,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:12:28,504 INFO L470 AbstractCegarLoop]: Abstraction has 1357 states and 1873 transitions. [2021-08-25 20:12:28,504 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:12:28,505 INFO L276 IsEmpty]: Start isEmpty. Operand 1357 states and 1873 transitions. [2021-08-25 20:12:28,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2021-08-25 20:12:28,509 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:12:28,509 INFO L512 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 13, 13, 13, 13, 13, 12, 12, 10, 10, 8, 8, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:12:28,509 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-08-25 20:12:28,509 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:12:28,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:12:28,510 INFO L82 PathProgramCache]: Analyzing trace with hash 1037565840, now seen corresponding path program 1 times [2021-08-25 20:12:28,510 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:12:28,510 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437667063] [2021-08-25 20:12:28,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:12:28,511 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:12:28,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:12:28,584 INFO L134 CoverageAnalysis]: Checked inductivity of 1174 backedges. 561 proven. 0 refuted. 0 times theorem prover too weak. 613 trivial. 0 not checked. [2021-08-25 20:12:28,584 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:12:28,584 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437667063] [2021-08-25 20:12:28,584 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1437667063] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:12:28,585 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:12:28,585 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:12:28,585 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970034145] [2021-08-25 20:12:28,585 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:12:28,586 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:12:28,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:12:28,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:12:28,586 INFO L87 Difference]: Start difference. First operand 1357 states and 1873 transitions. Second operand has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:12:28,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:12:28,735 INFO L93 Difference]: Finished difference Result 2705 states and 3732 transitions. [2021-08-25 20:12:28,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:12:28,736 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 305 [2021-08-25 20:12:28,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:12:28,741 INFO L225 Difference]: With dead ends: 2705 [2021-08-25 20:12:28,741 INFO L226 Difference]: Without dead ends: 1384 [2021-08-25 20:12:28,743 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:12:28,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1384 states. [2021-08-25 20:12:28,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1384 to 1357. [2021-08-25 20:12:28,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1357 states, 1356 states have (on average 1.3613569321533923) internal successors, (1846), 1356 states have internal predecessors, (1846), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:12:28,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1357 states to 1357 states and 1846 transitions. [2021-08-25 20:12:28,771 INFO L78 Accepts]: Start accepts. Automaton has 1357 states and 1846 transitions. Word has length 305 [2021-08-25 20:12:28,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:12:28,771 INFO L470 AbstractCegarLoop]: Abstraction has 1357 states and 1846 transitions. [2021-08-25 20:12:28,771 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:12:28,772 INFO L276 IsEmpty]: Start isEmpty. Operand 1357 states and 1846 transitions. [2021-08-25 20:12:28,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2021-08-25 20:12:28,776 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:12:28,776 INFO L512 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 15, 15, 14, 14, 14, 12, 12, 10, 10, 8, 8, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:12:28,777 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-08-25 20:12:28,777 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:12:28,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:12:28,777 INFO L82 PathProgramCache]: Analyzing trace with hash 1729384344, now seen corresponding path program 1 times [2021-08-25 20:12:28,778 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:12:28,778 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294304773] [2021-08-25 20:12:28,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:12:28,778 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:12:28,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:12:28,829 INFO L134 CoverageAnalysis]: Checked inductivity of 1418 backedges. 729 proven. 0 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2021-08-25 20:12:28,829 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:12:28,830 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294304773] [2021-08-25 20:12:28,830 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1294304773] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:12:28,830 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:12:28,830 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:12:28,830 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086793855] [2021-08-25 20:12:28,831 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:12:28,831 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:12:28,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:12:28,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:12:28,832 INFO L87 Difference]: Start difference. First operand 1357 states and 1846 transitions. Second operand has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:12:28,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:12:28,996 INFO L93 Difference]: Finished difference Result 2828 states and 3822 transitions. [2021-08-25 20:12:28,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:12:28,997 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 332 [2021-08-25 20:12:28,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:12:29,002 INFO L225 Difference]: With dead ends: 2828 [2021-08-25 20:12:29,002 INFO L226 Difference]: Without dead ends: 1507 [2021-08-25 20:12:29,004 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:12:29,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1507 states. [2021-08-25 20:12:29,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1507 to 1402. [2021-08-25 20:12:29,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1402 states, 1401 states have (on average 1.3604568165596003) internal successors, (1906), 1401 states have internal predecessors, (1906), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:12:29,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1402 states to 1402 states and 1906 transitions. [2021-08-25 20:12:29,033 INFO L78 Accepts]: Start accepts. Automaton has 1402 states and 1906 transitions. Word has length 332 [2021-08-25 20:12:29,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:12:29,033 INFO L470 AbstractCegarLoop]: Abstraction has 1402 states and 1906 transitions. [2021-08-25 20:12:29,034 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:12:29,034 INFO L276 IsEmpty]: Start isEmpty. Operand 1402 states and 1906 transitions. [2021-08-25 20:12:29,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 334 [2021-08-25 20:12:29,038 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:12:29,039 INFO L512 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 15, 15, 14, 14, 14, 12, 12, 10, 10, 8, 8, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:12:29,039 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-08-25 20:12:29,039 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:12:29,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:12:29,040 INFO L82 PathProgramCache]: Analyzing trace with hash 1837144220, now seen corresponding path program 1 times [2021-08-25 20:12:29,040 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:12:29,040 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057436170] [2021-08-25 20:12:29,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:12:29,040 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:12:29,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:12:29,093 INFO L134 CoverageAnalysis]: Checked inductivity of 1418 backedges. 869 proven. 0 refuted. 0 times theorem prover too weak. 549 trivial. 0 not checked. [2021-08-25 20:12:29,094 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:12:29,094 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057436170] [2021-08-25 20:12:29,094 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1057436170] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:12:29,094 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:12:29,094 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:12:29,094 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675886426] [2021-08-25 20:12:29,095 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:12:29,095 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:12:29,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:12:29,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:12:29,096 INFO L87 Difference]: Start difference. First operand 1402 states and 1906 transitions. Second operand has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:12:29,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:12:29,133 INFO L93 Difference]: Finished difference Result 3939 states and 5384 transitions. [2021-08-25 20:12:29,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:12:29,135 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 333 [2021-08-25 20:12:29,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:12:29,164 INFO L225 Difference]: With dead ends: 3939 [2021-08-25 20:12:29,164 INFO L226 Difference]: Without dead ends: 2573 [2021-08-25 20:12:29,166 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:12:29,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2573 states. [2021-08-25 20:12:29,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2573 to 2571. [2021-08-25 20:12:29,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2571 states, 2570 states have (on average 1.367704280155642) internal successors, (3515), 2570 states have internal predecessors, (3515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:12:29,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2571 states to 2571 states and 3515 transitions. [2021-08-25 20:12:29,228 INFO L78 Accepts]: Start accepts. Automaton has 2571 states and 3515 transitions. Word has length 333 [2021-08-25 20:12:29,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:12:29,229 INFO L470 AbstractCegarLoop]: Abstraction has 2571 states and 3515 transitions. [2021-08-25 20:12:29,229 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:12:29,229 INFO L276 IsEmpty]: Start isEmpty. Operand 2571 states and 3515 transitions. [2021-08-25 20:12:29,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 344 [2021-08-25 20:12:29,237 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:12:29,237 INFO L512 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 14, 14, 14, 14, 14, 13, 13, 11, 11, 9, 9, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:12:29,237 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-08-25 20:12:29,238 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:12:29,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:12:29,238 INFO L82 PathProgramCache]: Analyzing trace with hash 1564055932, now seen corresponding path program 1 times [2021-08-25 20:12:29,238 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:12:29,238 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864419183] [2021-08-25 20:12:29,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:12:29,239 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:12:29,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:12:29,309 INFO L134 CoverageAnalysis]: Checked inductivity of 1415 backedges. 790 proven. 12 refuted. 0 times theorem prover too weak. 613 trivial. 0 not checked. [2021-08-25 20:12:29,309 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:12:29,309 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864419183] [2021-08-25 20:12:29,309 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1864419183] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-25 20:12:29,309 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1318900539] [2021-08-25 20:12:29,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:12:29,310 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-25 20:12:29,310 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-25 20:12:29,313 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-25 20:12:29,354 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-08-25 20:12:29,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:12:29,477 INFO L263 TraceCheckSpWp]: Trace formula consists of 586 conjuncts, 3 conjunts are in the unsatisfiable core [2021-08-25 20:12:29,495 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 20:12:30,616 INFO L134 CoverageAnalysis]: Checked inductivity of 1415 backedges. 790 proven. 12 refuted. 0 times theorem prover too weak. 613 trivial. 0 not checked. [2021-08-25 20:12:30,617 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1318900539] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-25 20:12:30,617 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-25 20:12:30,617 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2021-08-25 20:12:30,618 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472695687] [2021-08-25 20:12:30,618 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:12:30,619 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:12:30,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:12:30,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:12:30,619 INFO L87 Difference]: Start difference. First operand 2571 states and 3515 transitions. Second operand has 4 states, 4 states have (on average 43.75) internal successors, (175), 4 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:12:30,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:12:30,938 INFO L93 Difference]: Finished difference Result 5069 states and 6924 transitions. [2021-08-25 20:12:30,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-25 20:12:30,938 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 43.75) internal successors, (175), 4 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 343 [2021-08-25 20:12:30,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:12:30,951 INFO L225 Difference]: With dead ends: 5069 [2021-08-25 20:12:30,951 INFO L226 Difference]: Without dead ends: 3832 [2021-08-25 20:12:30,954 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 348 GetRequests, 345 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.2ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:12:30,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3832 states. [2021-08-25 20:12:31,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3832 to 2835. [2021-08-25 20:12:31,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2835 states, 2834 states have (on average 1.3514467184191954) internal successors, (3830), 2834 states have internal predecessors, (3830), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:12:31,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2835 states to 2835 states and 3830 transitions. [2021-08-25 20:12:31,025 INFO L78 Accepts]: Start accepts. Automaton has 2835 states and 3830 transitions. Word has length 343 [2021-08-25 20:12:31,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:12:31,026 INFO L470 AbstractCegarLoop]: Abstraction has 2835 states and 3830 transitions. [2021-08-25 20:12:31,026 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 43.75) internal successors, (175), 4 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:12:31,026 INFO L276 IsEmpty]: Start isEmpty. Operand 2835 states and 3830 transitions. [2021-08-25 20:12:31,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 370 [2021-08-25 20:12:31,032 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:12:31,033 INFO L512 BasicCegarLoop]: trace histogram [17, 17, 16, 16, 15, 15, 15, 15, 15, 13, 13, 11, 11, 9, 9, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:12:31,062 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-08-25 20:12:31,261 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2021-08-25 20:12:31,262 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:12:31,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:12:31,262 INFO L82 PathProgramCache]: Analyzing trace with hash 61848643, now seen corresponding path program 1 times [2021-08-25 20:12:31,263 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:12:31,263 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254988369] [2021-08-25 20:12:31,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:12:31,263 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:12:31,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:12:31,324 INFO L134 CoverageAnalysis]: Checked inductivity of 1647 backedges. 953 proven. 5 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2021-08-25 20:12:31,324 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:12:31,324 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254988369] [2021-08-25 20:12:31,325 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1254988369] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-25 20:12:31,325 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1519494991] [2021-08-25 20:12:31,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:12:31,325 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-25 20:12:31,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-25 20:12:31,326 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-25 20:12:31,356 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-08-25 20:12:31,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:12:31,656 INFO L263 TraceCheckSpWp]: Trace formula consists of 642 conjuncts, 3 conjunts are in the unsatisfiable core [2021-08-25 20:12:31,671 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 20:12:32,709 INFO L134 CoverageAnalysis]: Checked inductivity of 1647 backedges. 953 proven. 5 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2021-08-25 20:12:32,709 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1519494991] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-25 20:12:32,709 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-25 20:12:32,709 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2021-08-25 20:12:32,710 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82110611] [2021-08-25 20:12:32,710 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:12:32,710 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:12:32,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:12:32,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:12:32,711 INFO L87 Difference]: Start difference. First operand 2835 states and 3830 transitions. Second operand has 4 states, 4 states have (on average 45.25) internal successors, (181), 4 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:12:33,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:12:33,028 INFO L93 Difference]: Finished difference Result 6504 states and 8791 transitions. [2021-08-25 20:12:33,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:12:33,028 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 45.25) internal successors, (181), 4 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 369 [2021-08-25 20:12:33,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:12:33,041 INFO L225 Difference]: With dead ends: 6504 [2021-08-25 20:12:33,041 INFO L226 Difference]: Without dead ends: 3698 [2021-08-25 20:12:33,045 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 374 GetRequests, 371 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.0ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:12:33,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3698 states. [2021-08-25 20:12:33,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3698 to 2972. [2021-08-25 20:12:33,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2972 states, 2971 states have (on average 1.3382699427802087) internal successors, (3976), 2971 states have internal predecessors, (3976), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:12:33,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2972 states to 2972 states and 3976 transitions. [2021-08-25 20:12:33,118 INFO L78 Accepts]: Start accepts. Automaton has 2972 states and 3976 transitions. Word has length 369 [2021-08-25 20:12:33,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:12:33,119 INFO L470 AbstractCegarLoop]: Abstraction has 2972 states and 3976 transitions. [2021-08-25 20:12:33,119 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 45.25) internal successors, (181), 4 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:12:33,119 INFO L276 IsEmpty]: Start isEmpty. Operand 2972 states and 3976 transitions. [2021-08-25 20:12:33,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 409 [2021-08-25 20:12:33,127 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:12:33,128 INFO L512 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 17, 17, 16, 16, 16, 14, 14, 12, 12, 10, 10, 8, 8, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:12:33,157 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-08-25 20:12:33,341 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2021-08-25 20:12:33,341 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:12:33,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:12:33,341 INFO L82 PathProgramCache]: Analyzing trace with hash -1613450848, now seen corresponding path program 1 times [2021-08-25 20:12:33,342 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:12:33,342 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924074976] [2021-08-25 20:12:33,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:12:33,342 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:12:33,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:12:33,586 INFO L134 CoverageAnalysis]: Checked inductivity of 1968 backedges. 883 proven. 0 refuted. 0 times theorem prover too weak. 1085 trivial. 0 not checked. [2021-08-25 20:12:33,586 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:12:33,586 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924074976] [2021-08-25 20:12:33,587 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [924074976] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:12:33,587 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:12:33,587 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:12:33,587 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803366131] [2021-08-25 20:12:33,587 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:12:33,587 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:12:33,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:12:33,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:12:33,588 INFO L87 Difference]: Start difference. First operand 2972 states and 3976 transitions. Second operand has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:12:33,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:12:33,746 INFO L93 Difference]: Finished difference Result 5654 states and 7451 transitions. [2021-08-25 20:12:33,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:12:33,747 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 408 [2021-08-25 20:12:33,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:12:33,763 INFO L225 Difference]: With dead ends: 5654 [2021-08-25 20:12:33,768 INFO L226 Difference]: Without dead ends: 1598 [2021-08-25 20:12:33,802 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 23.7ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:12:33,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1598 states. [2021-08-25 20:12:33,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1598 to 1532. [2021-08-25 20:12:33,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1532 states, 1531 states have (on average 1.3383409536250817) internal successors, (2049), 1531 states have internal predecessors, (2049), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:12:33,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1532 states to 1532 states and 2049 transitions. [2021-08-25 20:12:33,843 INFO L78 Accepts]: Start accepts. Automaton has 1532 states and 2049 transitions. Word has length 408 [2021-08-25 20:12:33,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:12:33,844 INFO L470 AbstractCegarLoop]: Abstraction has 1532 states and 2049 transitions. [2021-08-25 20:12:33,845 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:12:33,845 INFO L276 IsEmpty]: Start isEmpty. Operand 1532 states and 2049 transitions. [2021-08-25 20:12:33,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 493 [2021-08-25 20:12:33,848 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:12:33,849 INFO L512 BasicCegarLoop]: trace histogram [19, 19, 18, 18, 18, 18, 18, 18, 18, 17, 17, 15, 15, 13, 13, 11, 11, 9, 9, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:12:33,849 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-08-25 20:12:33,849 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:12:33,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:12:33,849 INFO L82 PathProgramCache]: Analyzing trace with hash 1952423320, now seen corresponding path program 1 times [2021-08-25 20:12:33,850 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:12:33,850 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771710807] [2021-08-25 20:12:33,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:12:33,850 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:12:33,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:12:33,919 INFO L134 CoverageAnalysis]: Checked inductivity of 2709 backedges. 1570 proven. 14 refuted. 0 times theorem prover too weak. 1125 trivial. 0 not checked. [2021-08-25 20:12:33,920 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:12:33,920 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771710807] [2021-08-25 20:12:33,920 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1771710807] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-25 20:12:33,920 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1783165383] [2021-08-25 20:12:33,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:12:33,921 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-25 20:12:33,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-25 20:12:33,922 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-25 20:12:33,924 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-08-25 20:12:34,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:12:34,369 INFO L263 TraceCheckSpWp]: Trace formula consists of 776 conjuncts, 3 conjunts are in the unsatisfiable core [2021-08-25 20:12:34,374 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 20:12:35,997 INFO L134 CoverageAnalysis]: Checked inductivity of 2709 backedges. 1570 proven. 14 refuted. 0 times theorem prover too weak. 1125 trivial. 0 not checked. [2021-08-25 20:12:35,998 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1783165383] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-25 20:12:35,998 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-25 20:12:35,999 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2021-08-25 20:12:35,999 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405397066] [2021-08-25 20:12:35,999 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:12:36,000 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:12:36,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:12:36,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:12:36,001 INFO L87 Difference]: Start difference. First operand 1532 states and 2049 transitions. Second operand has 4 states, 4 states have (on average 52.75) internal successors, (211), 4 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:12:36,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:12:36,183 INFO L93 Difference]: Finished difference Result 1865 states and 2499 transitions. [2021-08-25 20:12:36,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:12:36,184 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 52.75) internal successors, (211), 4 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 492 [2021-08-25 20:12:36,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:12:36,185 INFO L225 Difference]: With dead ends: 1865 [2021-08-25 20:12:36,185 INFO L226 Difference]: Without dead ends: 0 [2021-08-25 20:12:36,189 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 497 GetRequests, 494 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.6ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:12:36,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-08-25 20:12:36,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-08-25 20:12:36,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:12:36,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-08-25 20:12:36,189 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 492 [2021-08-25 20:12:36,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:12:36,190 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-08-25 20:12:36,190 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 52.75) internal successors, (211), 4 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:12:36,190 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-08-25 20:12:36,190 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-08-25 20:12:36,193 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-08-25 20:12:36,234 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-08-25 20:12:36,408 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-25 20:12:36,411 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-08-25 20:12:36,416 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:12:36,418 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:12:36,418 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:12:36,452 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:12:36,465 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:12:36,693 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:12:36,713 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:12:36,724 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:12:36,729 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:12:36,732 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:12:36,733 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:12:36,738 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:12:36,741 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:12:36,742 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:12:36,742 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:12:36,751 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:12:36,761 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:12:36,762 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:12:36,764 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:12:36,764 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:12:36,776 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:12:36,783 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:12:37,730 INFO L853 garLoopResultBuilder]: At program point L531(lines 96 597) the Hoare annotation is: (let ((.cse0 (= 4400 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse4 (<= 4352 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse5 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4352)) (.cse3 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4)) (.cse12 (<= ULTIMATE.start_ssl3_connect_~s__state~0 3)) (.cse7 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4560)) (.cse8 (<= 4560 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse9 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse1 (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse2 (= ULTIMATE.start_ssl3_connect_~s__hit~0 0)) (.cse6 (= ULTIMATE.start_ssl3_connect_~blastFlag~0 2)) (.cse10 (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse11 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4528))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse6 (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 3)) (and (= ULTIMATE.start_ssl3_connect_~s__state~0 4384) (= ULTIMATE.start_ssl3_connect_~blastFlag~0 1)) (and .cse7 .cse8 .cse6) (and (= ULTIMATE.start_ssl3_connect_~blastFlag~0 0) (= ULTIMATE.start_ssl3_connect_~s__state~0 4368)) (and .cse0 .cse6 .cse2) (and .cse4 .cse5 .cse9 .cse1 .cse2) (and .cse10 .cse2 .cse3 .cse11) (and .cse6 .cse2 .cse12) (and (= ULTIMATE.start_ssl3_connect_~s__state~0 4416) .cse2 .cse3) (and .cse1 .cse12) (and .cse7 .cse8 .cse9 .cse1 .cse2) (and .cse6 .cse10 .cse11))) [2021-08-25 20:12:37,730 INFO L857 garLoopResultBuilder]: For program point L168(lines 168 543) no Hoare annotation was computed. [2021-08-25 20:12:37,730 INFO L857 garLoopResultBuilder]: For program point L135(lines 135 554) no Hoare annotation was computed. [2021-08-25 20:12:37,730 INFO L857 garLoopResultBuilder]: For program point L102(lines 102 565) no Hoare annotation was computed. [2021-08-25 20:12:37,730 INFO L860 garLoopResultBuilder]: At program point L598(lines 95 599) the Hoare annotation is: true [2021-08-25 20:12:37,731 INFO L853 garLoopResultBuilder]: At program point L136(lines 132 555) the Hoare annotation is: (and (<= 4352 ULTIMATE.start_ssl3_connect_~s__state~0) (<= ULTIMATE.start_ssl3_connect_~s__state~0 4432) (= ULTIMATE.start_ssl3_connect_~s__hit~0 0) (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4)) [2021-08-25 20:12:37,731 INFO L857 garLoopResultBuilder]: For program point L368(lines 368 372) no Hoare annotation was computed. [2021-08-25 20:12:37,731 INFO L857 garLoopResultBuilder]: For program point L368-2(lines 368 372) no Hoare annotation was computed. [2021-08-25 20:12:37,731 INFO L857 garLoopResultBuilder]: For program point L567(lines 567 595) no Hoare annotation was computed. [2021-08-25 20:12:37,732 INFO L857 garLoopResultBuilder]: For program point L171(lines 171 542) no Hoare annotation was computed. [2021-08-25 20:12:37,732 INFO L857 garLoopResultBuilder]: For program point L138(lines 138 553) no Hoare annotation was computed. [2021-08-25 20:12:37,732 INFO L857 garLoopResultBuilder]: For program point L105(lines 105 564) no Hoare annotation was computed. [2021-08-25 20:12:37,732 INFO L857 garLoopResultBuilder]: For program point L568(lines 568 592) no Hoare annotation was computed. [2021-08-25 20:12:37,732 INFO L857 garLoopResultBuilder]: For program point L502-1(lines 200 530) no Hoare annotation was computed. [2021-08-25 20:12:37,732 INFO L857 garLoopResultBuilder]: For program point L337(lines 337 342) no Hoare annotation was computed. [2021-08-25 20:12:37,732 INFO L857 garLoopResultBuilder]: For program point L304-1(lines 304 318) no Hoare annotation was computed. [2021-08-25 20:12:37,733 INFO L853 garLoopResultBuilder]: At program point L205(lines 102 565) the Hoare annotation is: (and (= ULTIMATE.start_ssl3_connect_~blastFlag~0 0) (<= ULTIMATE.start_ssl3_connect_~s__state~0 4352)) [2021-08-25 20:12:37,733 INFO L853 garLoopResultBuilder]: At program point L172(lines 168 543) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4512)) (.cse1 (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~0))) (or (and .cse0 .cse1 (= ULTIMATE.start_ssl3_connect_~s__hit~0 0) (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4)) (and (= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) .cse0 .cse1))) [2021-08-25 20:12:37,733 INFO L857 garLoopResultBuilder]: For program point L602(lines 602 606) no Hoare annotation was computed. [2021-08-25 20:12:37,733 INFO L857 garLoopResultBuilder]: For program point L569(lines 569 578) no Hoare annotation was computed. [2021-08-25 20:12:37,735 INFO L857 garLoopResultBuilder]: For program point L602-2(lines 602 606) no Hoare annotation was computed. [2021-08-25 20:12:37,735 INFO L857 garLoopResultBuilder]: For program point L569-2(lines 568 590) no Hoare annotation was computed. [2021-08-25 20:12:37,736 INFO L857 garLoopResultBuilder]: For program point L272(lines 272 276) no Hoare annotation was computed. [2021-08-25 20:12:37,737 INFO L857 garLoopResultBuilder]: For program point L174(lines 174 541) no Hoare annotation was computed. [2021-08-25 20:12:37,737 INFO L857 garLoopResultBuilder]: For program point L141(lines 141 552) no Hoare annotation was computed. [2021-08-25 20:12:37,737 INFO L857 garLoopResultBuilder]: For program point L108(lines 108 563) no Hoare annotation was computed. [2021-08-25 20:12:37,737 INFO L857 garLoopResultBuilder]: For program point L571(lines 571 575) no Hoare annotation was computed. [2021-08-25 20:12:37,737 INFO L857 garLoopResultBuilder]: For program point L439(lines 439 444) no Hoare annotation was computed. [2021-08-25 20:12:37,737 INFO L853 garLoopResultBuilder]: At program point L142(lines 138 553) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4448)) (.cse1 (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~0))) (or (and .cse0 .cse1 (= ULTIMATE.start_ssl3_connect_~s__hit~0 0) (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4)) (and (= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) .cse0 .cse1))) [2021-08-25 20:12:37,738 INFO L857 garLoopResultBuilder]: For program point L76(lines 76 84) no Hoare annotation was computed. [2021-08-25 20:12:37,738 INFO L857 garLoopResultBuilder]: For program point L473(lines 473 477) no Hoare annotation was computed. [2021-08-25 20:12:37,738 INFO L857 garLoopResultBuilder]: For program point L308(lines 308 312) no Hoare annotation was computed. [2021-08-25 20:12:37,738 INFO L857 garLoopResultBuilder]: For program point L308-2(lines 306 318) no Hoare annotation was computed. [2021-08-25 20:12:37,738 INFO L857 garLoopResultBuilder]: For program point L507-1(lines 507 511) no Hoare annotation was computed. [2021-08-25 20:12:37,738 INFO L857 garLoopResultBuilder]: For program point L408(lines 408 412) no Hoare annotation was computed. [2021-08-25 20:12:37,739 INFO L857 garLoopResultBuilder]: For program point L210(lines 210 214) no Hoare annotation was computed. [2021-08-25 20:12:37,739 INFO L857 garLoopResultBuilder]: For program point L177(lines 177 540) no Hoare annotation was computed. [2021-08-25 20:12:37,740 INFO L857 garLoopResultBuilder]: For program point L144(lines 144 551) no Hoare annotation was computed. [2021-08-25 20:12:37,740 INFO L857 garLoopResultBuilder]: For program point L210-2(lines 200 530) no Hoare annotation was computed. [2021-08-25 20:12:37,740 INFO L857 garLoopResultBuilder]: For program point L111(lines 111 562) no Hoare annotation was computed. [2021-08-25 20:12:37,740 INFO L853 garLoopResultBuilder]: At program point L178(lines 174 541) the Hoare annotation is: (let ((.cse0 (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse1 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4528))) (or (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__hit~0 0) (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) .cse1) (and (= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) .cse0 .cse1))) [2021-08-25 20:12:37,740 INFO L857 garLoopResultBuilder]: For program point L79(lines 79 83) no Hoare annotation was computed. [2021-08-25 20:12:37,740 INFO L857 garLoopResultBuilder]: For program point L79-2(lines 76 84) no Hoare annotation was computed. [2021-08-25 20:12:37,740 INFO L860 garLoopResultBuilder]: At program point L609(lines 9 611) the Hoare annotation is: true [2021-08-25 20:12:37,741 INFO L857 garLoopResultBuilder]: For program point L246(lines 246 251) no Hoare annotation was computed. [2021-08-25 20:12:37,741 INFO L857 garLoopResultBuilder]: For program point L180(lines 180 539) no Hoare annotation was computed. [2021-08-25 20:12:37,741 INFO L857 garLoopResultBuilder]: For program point L147(lines 147 550) no Hoare annotation was computed. [2021-08-25 20:12:37,741 INFO L857 garLoopResultBuilder]: For program point L114(lines 114 561) no Hoare annotation was computed. [2021-08-25 20:12:37,741 INFO L857 garLoopResultBuilder]: For program point L478(lines 478 482) no Hoare annotation was computed. [2021-08-25 20:12:37,741 INFO L857 garLoopResultBuilder]: For program point L478-2(lines 478 482) no Hoare annotation was computed. [2021-08-25 20:12:37,742 INFO L853 garLoopResultBuilder]: At program point L148(lines 144 551) the Hoare annotation is: (let ((.cse0 (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse1 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4464))) (or (and (= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) .cse0 .cse1) (and .cse0 .cse1 (= ULTIMATE.start_ssl3_connect_~s__hit~0 0) (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4)))) [2021-08-25 20:12:37,742 INFO L857 garLoopResultBuilder]: For program point L380(lines 380 384) no Hoare annotation was computed. [2021-08-25 20:12:37,742 INFO L857 garLoopResultBuilder]: For program point L347(lines 347 351) no Hoare annotation was computed. [2021-08-25 20:12:37,742 INFO L857 garLoopResultBuilder]: For program point L281(lines 281 289) no Hoare annotation was computed. [2021-08-25 20:12:37,743 INFO L853 garLoopResultBuilder]: At program point L348(lines 62 610) the Hoare annotation is: false [2021-08-25 20:12:37,743 INFO L857 garLoopResultBuilder]: For program point L183(lines 183 538) no Hoare annotation was computed. [2021-08-25 20:12:37,749 INFO L857 garLoopResultBuilder]: For program point L150(lines 150 549) no Hoare annotation was computed. [2021-08-25 20:12:37,749 INFO L857 garLoopResultBuilder]: For program point L117(lines 117 560) no Hoare annotation was computed. [2021-08-25 20:12:37,749 INFO L857 garLoopResultBuilder]: For program point L580(lines 580 586) no Hoare annotation was computed. [2021-08-25 20:12:37,750 INFO L857 garLoopResultBuilder]: For program point L514(lines 514 518) no Hoare annotation was computed. [2021-08-25 20:12:37,750 INFO L857 garLoopResultBuilder]: For program point L514-2(lines 514 518) no Hoare annotation was computed. [2021-08-25 20:12:37,750 INFO L853 garLoopResultBuilder]: At program point L184(lines 180 539) the Hoare annotation is: (let ((.cse2 (= ULTIMATE.start_ssl3_connect_~s__hit~0 0)) (.cse0 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4560)) (.cse1 (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~0))) (or (and .cse0 .cse1 (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse2) (and .cse0 .cse1 .cse2 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4)) (and .cse0 (= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) .cse1))) [2021-08-25 20:12:37,750 INFO L853 garLoopResultBuilder]: At program point L118(lines 114 561) the Hoare annotation is: (and (<= 4352 ULTIMATE.start_ssl3_connect_~s__state~0) (= ULTIMATE.start_ssl3_connect_~blastFlag~0 0) (<= ULTIMATE.start_ssl3_connect_~s__state~0 4432)) [2021-08-25 20:12:37,750 INFO L857 garLoopResultBuilder]: For program point L449(lines 449 453) no Hoare annotation was computed. [2021-08-25 20:12:37,750 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-08-25 20:12:37,750 INFO L857 garLoopResultBuilder]: For program point L284(lines 284 288) no Hoare annotation was computed. [2021-08-25 20:12:37,751 INFO L857 garLoopResultBuilder]: For program point L284-2(lines 200 530) no Hoare annotation was computed. [2021-08-25 20:12:37,751 INFO L857 garLoopResultBuilder]: For program point L86(lines 86 94) no Hoare annotation was computed. [2021-08-25 20:12:37,751 INFO L857 garLoopResultBuilder]: For program point L186(lines 186 537) no Hoare annotation was computed. [2021-08-25 20:12:37,751 INFO L857 garLoopResultBuilder]: For program point L153(lines 153 548) no Hoare annotation was computed. [2021-08-25 20:12:37,751 INFO L857 garLoopResultBuilder]: For program point L120(lines 120 559) no Hoare annotation was computed. [2021-08-25 20:12:37,751 INFO L857 garLoopResultBuilder]: For program point L87(lines 87 91) no Hoare annotation was computed. [2021-08-25 20:12:37,751 INFO L857 garLoopResultBuilder]: For program point L352(lines 352 356) no Hoare annotation was computed. [2021-08-25 20:12:37,752 INFO L857 garLoopResultBuilder]: For program point L486-1(lines 486 498) no Hoare annotation was computed. [2021-08-25 20:12:37,752 INFO L857 garLoopResultBuilder]: For program point L420(lines 420 424) no Hoare annotation was computed. [2021-08-25 20:12:37,752 INFO L857 garLoopResultBuilder]: For program point L222(lines 222 239) no Hoare annotation was computed. [2021-08-25 20:12:37,753 INFO L857 garLoopResultBuilder]: For program point L189(lines 189 536) no Hoare annotation was computed. [2021-08-25 20:12:37,753 INFO L857 garLoopResultBuilder]: For program point L156(lines 156 547) no Hoare annotation was computed. [2021-08-25 20:12:37,753 INFO L857 garLoopResultBuilder]: For program point L222-2(lines 200 530) no Hoare annotation was computed. [2021-08-25 20:12:37,753 INFO L857 garLoopResultBuilder]: For program point L123(lines 123 558) no Hoare annotation was computed. [2021-08-25 20:12:37,754 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-08-25 20:12:37,755 INFO L853 garLoopResultBuilder]: At program point L190(lines 186 537) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4560)) (.cse1 (<= 4560 ULTIMATE.start_ssl3_connect_~s__state~0))) (or (and .cse0 .cse1 (= ULTIMATE.start_ssl3_connect_~blastFlag~0 2)) (and .cse0 .cse1 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0) (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 4560) (= ULTIMATE.start_ssl3_connect_~s__hit~0 0)))) [2021-08-25 20:12:37,755 INFO L853 garLoopResultBuilder]: At program point L124(lines 120 559) the Hoare annotation is: (and (<= 4352 ULTIMATE.start_ssl3_connect_~s__state~0) (= ULTIMATE.start_ssl3_connect_~blastFlag~0 1) (<= ULTIMATE.start_ssl3_connect_~s__state~0 4432)) [2021-08-25 20:12:37,755 INFO L860 garLoopResultBuilder]: At program point L620(lines 612 622) the Hoare annotation is: true [2021-08-25 20:12:37,755 INFO L857 garLoopResultBuilder]: For program point L521(lines 521 525) no Hoare annotation was computed. [2021-08-25 20:12:37,755 INFO L857 garLoopResultBuilder]: For program point L224(lines 224 229) no Hoare annotation was computed. [2021-08-25 20:12:37,755 INFO L857 garLoopResultBuilder]: For program point L489(lines 489 494) no Hoare annotation was computed. [2021-08-25 20:12:37,755 INFO L857 garLoopResultBuilder]: For program point L456(lines 456 467) no Hoare annotation was computed. [2021-08-25 20:12:37,755 INFO L857 garLoopResultBuilder]: For program point L456-1(lines 456 467) no Hoare annotation was computed. [2021-08-25 20:12:37,756 INFO L857 garLoopResultBuilder]: For program point L192(lines 192 535) no Hoare annotation was computed. [2021-08-25 20:12:37,756 INFO L857 garLoopResultBuilder]: For program point L159(lines 159 546) no Hoare annotation was computed. [2021-08-25 20:12:37,756 INFO L857 garLoopResultBuilder]: For program point L126(lines 126 557) no Hoare annotation was computed. [2021-08-25 20:12:37,756 INFO L857 garLoopResultBuilder]: For program point L391(lines 391 395) no Hoare annotation was computed. [2021-08-25 20:12:37,756 INFO L857 garLoopResultBuilder]: For program point L325(lines 325 329) no Hoare annotation was computed. [2021-08-25 20:12:37,773 INFO L857 garLoopResultBuilder]: For program point L325-2(lines 200 530) no Hoare annotation was computed. [2021-08-25 20:12:37,774 INFO L853 garLoopResultBuilder]: At program point L193(lines 192 535) the Hoare annotation is: (let ((.cse0 (<= 4352 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse1 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4352))) (or (and .cse0 .cse1 (= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 3)) (and .cse0 .cse1 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0) (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 4560) (= ULTIMATE.start_ssl3_connect_~s__hit~0 0)))) [2021-08-25 20:12:37,774 INFO L853 garLoopResultBuilder]: At program point L160(lines 150 549) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4480)) (.cse1 (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~0))) (or (and .cse0 (= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) .cse1) (and .cse0 .cse1 (= ULTIMATE.start_ssl3_connect_~s__hit~0 0) (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4)))) [2021-08-25 20:12:37,774 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-08-25 20:12:37,774 INFO L857 garLoopResultBuilder]: For program point L458(lines 458 464) no Hoare annotation was computed. [2021-08-25 20:12:37,774 INFO L857 garLoopResultBuilder]: For program point L260(lines 260 264) no Hoare annotation was computed. [2021-08-25 20:12:37,774 INFO L857 garLoopResultBuilder]: For program point L260-2(lines 200 530) no Hoare annotation was computed. [2021-08-25 20:12:37,774 INFO L857 garLoopResultBuilder]: For program point L195(lines 195 534) no Hoare annotation was computed. [2021-08-25 20:12:37,774 INFO L857 garLoopResultBuilder]: For program point L162(lines 162 545) no Hoare annotation was computed. [2021-08-25 20:12:37,774 INFO L857 garLoopResultBuilder]: For program point L129(lines 129 556) no Hoare annotation was computed. [2021-08-25 20:12:37,775 INFO L857 garLoopResultBuilder]: For program point L96-1(lines 62 610) no Hoare annotation was computed. [2021-08-25 20:12:37,775 INFO L857 garLoopResultBuilder]: For program point L295(lines 295 299) no Hoare annotation was computed. [2021-08-25 20:12:37,775 INFO L857 garLoopResultBuilder]: For program point L295-2(lines 295 299) no Hoare annotation was computed. [2021-08-25 20:12:37,775 INFO L860 garLoopResultBuilder]: At program point L196(lines 195 534) the Hoare annotation is: true [2021-08-25 20:12:37,775 INFO L853 garLoopResultBuilder]: At program point L130(lines 126 557) the Hoare annotation is: (let ((.cse0 (<= 4352 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse1 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4432)) (.cse2 (= ULTIMATE.start_ssl3_connect_~s__hit~0 0))) (or (and .cse0 .cse1 (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse2 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4)) (and .cse0 (= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) .cse1 .cse2))) [2021-08-25 20:12:37,775 INFO L857 garLoopResultBuilder]: For program point L97(line 97) no Hoare annotation was computed. [2021-08-25 20:12:37,775 INFO L857 garLoopResultBuilder]: For program point L428(lines 428 432) no Hoare annotation was computed. [2021-08-25 20:12:37,775 INFO L857 garLoopResultBuilder]: For program point L428-2(lines 200 530) no Hoare annotation was computed. [2021-08-25 20:12:37,776 INFO L857 garLoopResultBuilder]: For program point L230(lines 230 235) no Hoare annotation was computed. [2021-08-25 20:12:37,776 INFO L857 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-08-25 20:12:37,776 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 608) no Hoare annotation was computed. [2021-08-25 20:12:37,776 INFO L857 garLoopResultBuilder]: For program point L363(lines 363 367) no Hoare annotation was computed. [2021-08-25 20:12:37,776 INFO L857 garLoopResultBuilder]: For program point L165(lines 165 544) no Hoare annotation was computed. [2021-08-25 20:12:37,776 INFO L857 garLoopResultBuilder]: For program point L132(lines 132 555) no Hoare annotation was computed. [2021-08-25 20:12:37,776 INFO L857 garLoopResultBuilder]: For program point L99(lines 99 566) no Hoare annotation was computed. [2021-08-25 20:12:37,776 INFO L857 garLoopResultBuilder]: For program point L397(lines 397 402) no Hoare annotation was computed. [2021-08-25 20:12:37,777 INFO L857 garLoopResultBuilder]: For program point L397-2(lines 397 402) no Hoare annotation was computed. [2021-08-25 20:12:37,777 INFO L860 garLoopResultBuilder]: At program point L199(lines 198 533) the Hoare annotation is: true [2021-08-25 20:12:37,777 INFO L853 garLoopResultBuilder]: At program point L166(lines 162 545) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4512)) (.cse1 (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~0))) (or (and .cse0 .cse1 (= ULTIMATE.start_ssl3_connect_~s__hit~0 0) (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4)) (and (= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) .cse0 .cse1))) [2021-08-25 20:12:37,777 INFO L853 garLoopResultBuilder]: At program point L100(lines 99 566) the Hoare annotation is: (and (= ULTIMATE.start_ssl3_connect_~blastFlag~0 0) (= 12292 ULTIMATE.start_ssl3_connect_~s__state~0)) [2021-08-25 20:12:37,780 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-08-25 20:12:37,796 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.08 08:12:37 BoogieIcfgContainer [2021-08-25 20:12:37,796 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-08-25 20:12:37,797 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-08-25 20:12:37,797 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-08-25 20:12:37,797 INFO L275 PluginConnector]: Witness Printer initialized [2021-08-25 20:12:37,797 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.08 08:12:24" (3/4) ... [2021-08-25 20:12:37,800 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-08-25 20:12:37,811 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2021-08-25 20:12:37,812 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2021-08-25 20:12:37,812 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-08-25 20:12:37,813 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-08-25 20:12:37,880 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-08-25 20:12:37,881 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-08-25 20:12:37,882 INFO L168 Benchmark]: Toolchain (without parser) took 14842.00 ms. Allocated memory was 56.6 MB in the beginning and 373.3 MB in the end (delta: 316.7 MB). Free memory was 35.1 MB in the beginning and 318.3 MB in the end (delta: -283.2 MB). Peak memory consumption was 32.5 MB. Max. memory is 16.1 GB. [2021-08-25 20:12:37,883 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 56.6 MB. Free memory was 39.0 MB in the beginning and 38.9 MB in the end (delta: 73.7 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-25 20:12:37,885 INFO L168 Benchmark]: CACSL2BoogieTranslator took 591.60 ms. Allocated memory is still 56.6 MB. Free memory was 34.8 MB in the beginning and 36.3 MB in the end (delta: -1.5 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. [2021-08-25 20:12:37,885 INFO L168 Benchmark]: Boogie Procedure Inliner took 64.92 ms. Allocated memory is still 56.6 MB. Free memory was 36.1 MB in the beginning and 33.7 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-08-25 20:12:37,888 INFO L168 Benchmark]: Boogie Preprocessor took 42.13 ms. Allocated memory is still 56.6 MB. Free memory was 33.7 MB in the beginning and 31.8 MB in the end (delta: 1.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-08-25 20:12:37,889 INFO L168 Benchmark]: RCFGBuilder took 680.50 ms. Allocated memory was 56.6 MB in the beginning and 69.2 MB in the end (delta: 12.6 MB). Free memory was 31.8 MB in the beginning and 33.4 MB in the end (delta: -1.5 MB). Peak memory consumption was 17.6 MB. Max. memory is 16.1 GB. [2021-08-25 20:12:37,889 INFO L168 Benchmark]: TraceAbstraction took 13368.65 ms. Allocated memory was 69.2 MB in the beginning and 373.3 MB in the end (delta: 304.1 MB). Free memory was 32.7 MB in the beginning and 327.7 MB in the end (delta: -295.0 MB). Peak memory consumption was 216.1 MB. Max. memory is 16.1 GB. [2021-08-25 20:12:37,889 INFO L168 Benchmark]: Witness Printer took 83.82 ms. Allocated memory is still 373.3 MB. Free memory was 326.7 MB in the beginning and 318.3 MB in the end (delta: 8.4 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2021-08-25 20:12:37,891 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 56.6 MB. Free memory was 39.0 MB in the beginning and 38.9 MB in the end (delta: 73.7 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 591.60 ms. Allocated memory is still 56.6 MB. Free memory was 34.8 MB in the beginning and 36.3 MB in the end (delta: -1.5 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 64.92 ms. Allocated memory is still 56.6 MB. Free memory was 36.1 MB in the beginning and 33.7 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 42.13 ms. Allocated memory is still 56.6 MB. Free memory was 33.7 MB in the beginning and 31.8 MB in the end (delta: 1.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 680.50 ms. Allocated memory was 56.6 MB in the beginning and 69.2 MB in the end (delta: 12.6 MB). Free memory was 31.8 MB in the beginning and 33.4 MB in the end (delta: -1.5 MB). Peak memory consumption was 17.6 MB. Max. memory is 16.1 GB. * TraceAbstraction took 13368.65 ms. Allocated memory was 69.2 MB in the beginning and 373.3 MB in the end (delta: 304.1 MB). Free memory was 32.7 MB in the beginning and 327.7 MB in the end (delta: -295.0 MB). Peak memory consumption was 216.1 MB. Max. memory is 16.1 GB. * Witness Printer took 83.82 ms. Allocated memory is still 373.3 MB. Free memory was 326.7 MB in the beginning and 318.3 MB in the end (delta: 8.4 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 608]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 124 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 13289.0ms, OverallIterations: 24, TraceHistogramMax: 19, EmptinessCheckTime: 88.9ms, AutomataDifference: 3678.2ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 1320.1ms, InitialAbstractionConstructionTime: 13.6ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 4180 SDtfs, 1856 SDslu, 2340 SDs, 0 SdLazy, 2387 SolverSat, 589 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2112.9ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1282 GetRequests, 1252 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 167.9ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=2972occurred in iteration=22, InterpolantAutomatonStates: 76, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 611.0ms AutomataMinimizationTime, 24 MinimizatonAttempts, 2185 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: 0.0ms HoareAnnotationTime, 22 LocationsWithAnnotation, 22 PreInvPairs, 107 NumberOfFragments, 464 HoareAnnotationTreeSize, 22 FomulaSimplifications, 4825 FormulaSimplificationTreeSizeReduction, 378.0ms HoareSimplificationTime, 22 FomulaSimplificationsInter, 1315 FormulaSimplificationTreeSizeReductionInter, 930.3ms HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 164.5ms SsaConstructionTime, 639.9ms SatisfiabilityAnalysisTime, 5132.0ms InterpolantComputationTime, 6094 NumberOfCodeBlocks, 6094 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 6067 ConstructedInterpolants, 0 QuantifiedInterpolants, 7551 SizeOfPredicates, 3 NumberOfNonLiveVariables, 2004 ConjunctsInSsa, 9 ConjunctsInUnsatCore, 27 InterpolantComputations, 21 PerfectInterpolantSequences, 23494/23556 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 198]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 612]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 150]: Loop Invariant Derived loop invariant: ((s__state <= 4480 && blastFlag == 2) && 4432 <= s__state) || (((s__state <= 4480 && 4432 <= s__state) && s__hit == 0) && blastFlag <= 4) - InvariantResult [Line: 99]: Loop Invariant Derived loop invariant: blastFlag == 0 && 12292 == s__state - InvariantResult [Line: 96]: Loop Invariant Derived loop invariant: ((((((((((((((4400 == s__state && s__s3__tmp__next_state___0 <= 4560) && s__hit == 0) && blastFlag <= 4) || (((4352 <= s__state && s__state <= 4352) && blastFlag == 2) && s__s3__tmp__next_state___0 <= 3)) || (s__state == 4384 && blastFlag == 1)) || ((s__state <= 4560 && 4560 <= s__state) && blastFlag == 2)) || (blastFlag == 0 && s__state == 4368)) || ((4400 == s__state && blastFlag == 2) && s__hit == 0)) || ((((4352 <= s__state && s__state <= 4352) && 4560 <= s__s3__tmp__next_state___0) && s__s3__tmp__next_state___0 <= 4560) && s__hit == 0)) || (((4432 <= s__state && s__hit == 0) && blastFlag <= 4) && s__state <= 4528)) || ((blastFlag == 2 && s__hit == 0) && s__state <= 3)) || ((s__state == 4416 && s__hit == 0) && blastFlag <= 4)) || (s__s3__tmp__next_state___0 <= 4560 && s__state <= 3)) || ((((s__state <= 4560 && 4560 <= s__state) && 4560 <= s__s3__tmp__next_state___0) && s__s3__tmp__next_state___0 <= 4560) && s__hit == 0)) || ((blastFlag == 2 && 4432 <= s__state) && s__state <= 4528) - InvariantResult [Line: 192]: Loop Invariant Derived loop invariant: (((4352 <= s__state && s__state <= 4352) && blastFlag == 2) && s__s3__tmp__next_state___0 <= 3) || ((((4352 <= s__state && s__state <= 4352) && 4560 <= s__s3__tmp__next_state___0) && s__s3__tmp__next_state___0 <= 4560) && s__hit == 0) - InvariantResult [Line: 162]: Loop Invariant Derived loop invariant: (((s__state <= 4512 && 4432 <= s__state) && s__hit == 0) && blastFlag <= 4) || ((blastFlag == 2 && s__state <= 4512) && 4432 <= s__state) - InvariantResult [Line: 168]: Loop Invariant Derived loop invariant: (((s__state <= 4512 && 4432 <= s__state) && s__hit == 0) && blastFlag <= 4) || ((blastFlag == 2 && s__state <= 4512) && 4432 <= s__state) - InvariantResult [Line: 102]: Loop Invariant Derived loop invariant: blastFlag == 0 && s__state <= 4352 - InvariantResult [Line: 114]: Loop Invariant Derived loop invariant: (4352 <= s__state && blastFlag == 0) && s__state <= 4432 - InvariantResult [Line: 126]: Loop Invariant Derived loop invariant: ((((4352 <= s__state && s__state <= 4432) && s__s3__tmp__next_state___0 <= 4560) && s__hit == 0) && blastFlag <= 4) || (((4352 <= s__state && blastFlag == 2) && s__state <= 4432) && s__hit == 0) - InvariantResult [Line: 62]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 186]: Loop Invariant Derived loop invariant: ((s__state <= 4560 && 4560 <= s__state) && blastFlag == 2) || ((((s__state <= 4560 && 4560 <= s__state) && 4560 <= s__s3__tmp__next_state___0) && s__s3__tmp__next_state___0 <= 4560) && s__hit == 0) - InvariantResult [Line: 9]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 174]: Loop Invariant Derived loop invariant: (((4432 <= s__state && s__hit == 0) && blastFlag <= 4) && s__state <= 4528) || ((blastFlag == 2 && 4432 <= s__state) && s__state <= 4528) - InvariantResult [Line: 144]: Loop Invariant Derived loop invariant: ((blastFlag == 2 && 4432 <= s__state) && s__state <= 4464) || (((4432 <= s__state && s__state <= 4464) && s__hit == 0) && blastFlag <= 4) - InvariantResult [Line: 95]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 120]: Loop Invariant Derived loop invariant: (4352 <= s__state && blastFlag == 1) && s__state <= 4432 - InvariantResult [Line: 195]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 132]: Loop Invariant Derived loop invariant: ((4352 <= s__state && s__state <= 4432) && s__hit == 0) && blastFlag <= 4 - InvariantResult [Line: 138]: Loop Invariant Derived loop invariant: (((s__state <= 4448 && 4432 <= s__state) && s__hit == 0) && blastFlag <= 4) || ((blastFlag == 2 && s__state <= 4448) && 4432 <= s__state) - InvariantResult [Line: 180]: Loop Invariant Derived loop invariant: ((((s__state <= 4560 && 4432 <= s__state) && s__s3__tmp__next_state___0 <= 4560) && s__hit == 0) || (((s__state <= 4560 && 4432 <= s__state) && s__hit == 0) && blastFlag <= 4)) || ((s__state <= 4560 && blastFlag == 2) && 4432 <= s__state) RESULT: Ultimate proved your program to be correct! [2021-08-25 20:12:37,955 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...