./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/systemc/kundu1.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 9a8b2e8d 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.3.100.v20150511-1540.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/systemc/kundu1.cil.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 296e273b1c19d017b7d3722a7c74d29ba546c812 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.25-9a8b2e8 [2020-10-20 01:49:11,404 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-20 01:49:11,406 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-20 01:49:11,429 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-20 01:49:11,429 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-20 01:49:11,430 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-20 01:49:11,432 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-20 01:49:11,434 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-20 01:49:11,442 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-20 01:49:11,443 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-20 01:49:11,444 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-20 01:49:11,445 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-20 01:49:11,445 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-20 01:49:11,446 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-20 01:49:11,447 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-20 01:49:11,449 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-20 01:49:11,449 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-20 01:49:11,450 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-20 01:49:11,452 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-20 01:49:11,454 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-20 01:49:11,455 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-20 01:49:11,456 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-20 01:49:11,457 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-20 01:49:11,458 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-20 01:49:11,461 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-20 01:49:11,461 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-20 01:49:11,461 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-20 01:49:11,462 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-20 01:49:11,462 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-20 01:49:11,463 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-20 01:49:11,464 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-20 01:49:11,464 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-20 01:49:11,465 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-20 01:49:11,466 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-20 01:49:11,467 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-20 01:49:11,467 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-20 01:49:11,468 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-20 01:49:11,468 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-20 01:49:11,468 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-20 01:49:11,469 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-20 01:49:11,470 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-20 01:49:11,471 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-10-20 01:49:11,492 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-20 01:49:11,492 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-20 01:49:11,494 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-20 01:49:11,494 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-20 01:49:11,494 INFO L138 SettingsManager]: * Use SBE=true [2020-10-20 01:49:11,494 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-20 01:49:11,495 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-20 01:49:11,495 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-20 01:49:11,495 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-20 01:49:11,495 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-20 01:49:11,496 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-20 01:49:11,496 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-20 01:49:11,496 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-20 01:49:11,496 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-20 01:49:11,497 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-20 01:49:11,497 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-20 01:49:11,497 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-20 01:49:11,497 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-20 01:49:11,498 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-20 01:49:11,498 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-20 01:49:11,498 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-20 01:49:11,498 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-20 01:49:11,499 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-20 01:49:11,499 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-20 01:49:11,499 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-20 01:49:11,499 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-20 01:49:11,500 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-20 01:49:11,500 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-20 01:49:11,500 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-20 01:49:11,500 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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 -> 296e273b1c19d017b7d3722a7c74d29ba546c812 [2020-10-20 01:49:11,700 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-20 01:49:11,714 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-20 01:49:11,718 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-20 01:49:11,722 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-20 01:49:11,722 INFO L275 PluginConnector]: CDTParser initialized [2020-10-20 01:49:11,723 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/systemc/kundu1.cil.c [2020-10-20 01:49:11,786 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/60850e40b/b9e3587ba19f4a038222f521e7cf7712/FLAGf7ee8d5d5 [2020-10-20 01:49:12,279 INFO L306 CDTParser]: Found 1 translation units. [2020-10-20 01:49:12,280 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/kundu1.cil.c [2020-10-20 01:49:12,290 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/60850e40b/b9e3587ba19f4a038222f521e7cf7712/FLAGf7ee8d5d5 [2020-10-20 01:49:12,633 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/60850e40b/b9e3587ba19f4a038222f521e7cf7712 [2020-10-20 01:49:12,638 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-20 01:49:12,644 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-20 01:49:12,645 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-20 01:49:12,645 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-20 01:49:12,649 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-20 01:49:12,650 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.10 01:49:12" (1/1) ... [2020-10-20 01:49:12,653 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@596ed263 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 01:49:12, skipping insertion in model container [2020-10-20 01:49:12,654 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.10 01:49:12" (1/1) ... [2020-10-20 01:49:12,662 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-20 01:49:12,719 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-20 01:49:13,025 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-20 01:49:13,036 INFO L203 MainTranslator]: Completed pre-run [2020-10-20 01:49:13,082 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-20 01:49:13,111 INFO L208 MainTranslator]: Completed translation [2020-10-20 01:49:13,111 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 01:49:13 WrapperNode [2020-10-20 01:49:13,112 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-20 01:49:13,112 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-20 01:49:13,112 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-20 01:49:13,113 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-20 01:49:13,120 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 01:49:13" (1/1) ... [2020-10-20 01:49:13,131 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 01:49:13" (1/1) ... [2020-10-20 01:49:13,166 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-20 01:49:13,166 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-20 01:49:13,166 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-20 01:49:13,166 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-20 01:49:13,177 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 01:49:13" (1/1) ... [2020-10-20 01:49:13,177 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 01:49:13" (1/1) ... [2020-10-20 01:49:13,181 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 01:49:13" (1/1) ... [2020-10-20 01:49:13,182 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 01:49:13" (1/1) ... [2020-10-20 01:49:13,189 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 01:49:13" (1/1) ... [2020-10-20 01:49:13,198 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 01:49:13" (1/1) ... [2020-10-20 01:49:13,201 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 01:49:13" (1/1) ... [2020-10-20 01:49:13,206 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-20 01:49:13,206 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-20 01:49:13,206 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-20 01:49:13,206 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-20 01:49:13,207 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 01:49:13" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-20 01:49:13,278 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-20 01:49:13,279 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-20 01:49:13,279 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-20 01:49:13,279 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-20 01:49:13,814 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-20 01:49:13,814 INFO L298 CfgBuilder]: Removed 78 assume(true) statements. [2020-10-20 01:49:13,817 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 01:49:13 BoogieIcfgContainer [2020-10-20 01:49:13,817 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-20 01:49:13,818 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-20 01:49:13,819 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-20 01:49:13,823 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-20 01:49:13,823 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.10 01:49:12" (1/3) ... [2020-10-20 01:49:13,824 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36c6e541 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.10 01:49:13, skipping insertion in model container [2020-10-20 01:49:13,824 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 01:49:13" (2/3) ... [2020-10-20 01:49:13,825 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36c6e541 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.10 01:49:13, skipping insertion in model container [2020-10-20 01:49:13,825 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 01:49:13" (3/3) ... [2020-10-20 01:49:13,828 INFO L111 eAbstractionObserver]: Analyzing ICFG kundu1.cil.c [2020-10-20 01:49:13,843 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-20 01:49:13,853 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2020-10-20 01:49:13,877 INFO L253 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2020-10-20 01:49:13,908 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-20 01:49:13,908 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-20 01:49:13,908 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-20 01:49:13,909 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-20 01:49:13,909 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-20 01:49:13,909 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-20 01:49:13,909 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-20 01:49:13,910 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-20 01:49:13,928 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states. [2020-10-20 01:49:13,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-10-20 01:49:13,936 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:49:13,937 INFO L422 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 01:49:13,937 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:49:13,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:49:13,943 INFO L82 PathProgramCache]: Analyzing trace with hash -1357048476, now seen corresponding path program 1 times [2020-10-20 01:49:13,954 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:49:13,954 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166278850] [2020-10-20 01:49:13,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:49:14,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:49:14,164 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:49:14,165 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166278850] [2020-10-20 01:49:14,166 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:49:14,166 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 01:49:14,167 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127686742] [2020-10-20 01:49:14,174 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-20 01:49:14,174 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:49:14,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 01:49:14,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 01:49:14,193 INFO L87 Difference]: Start difference. First operand 120 states. Second operand 3 states. [2020-10-20 01:49:14,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:49:14,298 INFO L93 Difference]: Finished difference Result 231 states and 349 transitions. [2020-10-20 01:49:14,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 01:49:14,301 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2020-10-20 01:49:14,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:49:14,337 INFO L225 Difference]: With dead ends: 231 [2020-10-20 01:49:14,338 INFO L226 Difference]: Without dead ends: 112 [2020-10-20 01:49:14,342 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 01:49:14,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2020-10-20 01:49:14,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2020-10-20 01:49:14,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2020-10-20 01:49:14,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 162 transitions. [2020-10-20 01:49:14,390 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 162 transitions. Word has length 33 [2020-10-20 01:49:14,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:49:14,391 INFO L481 AbstractCegarLoop]: Abstraction has 112 states and 162 transitions. [2020-10-20 01:49:14,391 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-20 01:49:14,391 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 162 transitions. [2020-10-20 01:49:14,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-10-20 01:49:14,393 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:49:14,393 INFO L422 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 01:49:14,394 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-20 01:49:14,394 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:49:14,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:49:14,395 INFO L82 PathProgramCache]: Analyzing trace with hash 1551715426, now seen corresponding path program 1 times [2020-10-20 01:49:14,395 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:49:14,395 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88239616] [2020-10-20 01:49:14,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:49:14,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:49:14,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:49:14,454 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88239616] [2020-10-20 01:49:14,454 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:49:14,454 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 01:49:14,454 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270231705] [2020-10-20 01:49:14,457 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-20 01:49:14,457 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:49:14,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 01:49:14,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 01:49:14,458 INFO L87 Difference]: Start difference. First operand 112 states and 162 transitions. Second operand 3 states. [2020-10-20 01:49:14,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:49:14,537 INFO L93 Difference]: Finished difference Result 304 states and 439 transitions. [2020-10-20 01:49:14,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 01:49:14,541 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2020-10-20 01:49:14,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:49:14,546 INFO L225 Difference]: With dead ends: 304 [2020-10-20 01:49:14,546 INFO L226 Difference]: Without dead ends: 199 [2020-10-20 01:49:14,548 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 01:49:14,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2020-10-20 01:49:14,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 189. [2020-10-20 01:49:14,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2020-10-20 01:49:14,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 273 transitions. [2020-10-20 01:49:14,603 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 273 transitions. Word has length 33 [2020-10-20 01:49:14,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:49:14,603 INFO L481 AbstractCegarLoop]: Abstraction has 189 states and 273 transitions. [2020-10-20 01:49:14,603 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-20 01:49:14,603 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 273 transitions. [2020-10-20 01:49:14,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-10-20 01:49:14,605 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:49:14,605 INFO L422 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 01:49:14,605 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-20 01:49:14,605 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:49:14,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:49:14,606 INFO L82 PathProgramCache]: Analyzing trace with hash -120802205, now seen corresponding path program 1 times [2020-10-20 01:49:14,606 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:49:14,606 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203618402] [2020-10-20 01:49:14,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:49:14,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:49:14,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:49:14,719 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203618402] [2020-10-20 01:49:14,719 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:49:14,719 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-20 01:49:14,719 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747398982] [2020-10-20 01:49:14,720 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-20 01:49:14,720 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:49:14,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-20 01:49:14,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-20 01:49:14,721 INFO L87 Difference]: Start difference. First operand 189 states and 273 transitions. Second operand 5 states. [2020-10-20 01:49:14,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:49:14,850 INFO L93 Difference]: Finished difference Result 591 states and 861 transitions. [2020-10-20 01:49:14,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-20 01:49:14,851 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2020-10-20 01:49:14,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:49:14,855 INFO L225 Difference]: With dead ends: 591 [2020-10-20 01:49:14,855 INFO L226 Difference]: Without dead ends: 413 [2020-10-20 01:49:14,857 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-10-20 01:49:14,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2020-10-20 01:49:14,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 195. [2020-10-20 01:49:14,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2020-10-20 01:49:14,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 276 transitions. [2020-10-20 01:49:14,914 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 276 transitions. Word has length 33 [2020-10-20 01:49:14,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:49:14,915 INFO L481 AbstractCegarLoop]: Abstraction has 195 states and 276 transitions. [2020-10-20 01:49:14,915 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-20 01:49:14,915 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 276 transitions. [2020-10-20 01:49:14,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-10-20 01:49:14,920 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:49:14,920 INFO L422 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 01:49:14,921 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-20 01:49:14,921 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:49:14,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:49:14,922 INFO L82 PathProgramCache]: Analyzing trace with hash -1926240539, now seen corresponding path program 1 times [2020-10-20 01:49:14,922 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:49:14,923 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151253708] [2020-10-20 01:49:14,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:49:14,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:49:15,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:49:15,038 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151253708] [2020-10-20 01:49:15,038 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:49:15,039 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-20 01:49:15,039 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918036186] [2020-10-20 01:49:15,039 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-20 01:49:15,040 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:49:15,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-20 01:49:15,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-20 01:49:15,040 INFO L87 Difference]: Start difference. First operand 195 states and 276 transitions. Second operand 4 states. [2020-10-20 01:49:15,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:49:15,206 INFO L93 Difference]: Finished difference Result 621 states and 872 transitions. [2020-10-20 01:49:15,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-20 01:49:15,207 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 33 [2020-10-20 01:49:15,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:49:15,210 INFO L225 Difference]: With dead ends: 621 [2020-10-20 01:49:15,210 INFO L226 Difference]: Without dead ends: 439 [2020-10-20 01:49:15,212 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-20 01:49:15,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2020-10-20 01:49:15,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 333. [2020-10-20 01:49:15,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 333 states. [2020-10-20 01:49:15,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 464 transitions. [2020-10-20 01:49:15,243 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 464 transitions. Word has length 33 [2020-10-20 01:49:15,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:49:15,243 INFO L481 AbstractCegarLoop]: Abstraction has 333 states and 464 transitions. [2020-10-20 01:49:15,243 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-20 01:49:15,243 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 464 transitions. [2020-10-20 01:49:15,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-10-20 01:49:15,244 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:49:15,245 INFO L422 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 01:49:15,245 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-20 01:49:15,245 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:49:15,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:49:15,246 INFO L82 PathProgramCache]: Analyzing trace with hash -1179728243, now seen corresponding path program 1 times [2020-10-20 01:49:15,246 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:49:15,246 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567564937] [2020-10-20 01:49:15,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:49:15,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:49:15,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:49:15,298 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567564937] [2020-10-20 01:49:15,298 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:49:15,298 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-20 01:49:15,298 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857371674] [2020-10-20 01:49:15,299 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-20 01:49:15,299 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:49:15,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-20 01:49:15,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-20 01:49:15,300 INFO L87 Difference]: Start difference. First operand 333 states and 464 transitions. Second operand 5 states. [2020-10-20 01:49:15,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:49:15,461 INFO L93 Difference]: Finished difference Result 1126 states and 1579 transitions. [2020-10-20 01:49:15,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-20 01:49:15,462 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2020-10-20 01:49:15,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:49:15,467 INFO L225 Difference]: With dead ends: 1126 [2020-10-20 01:49:15,467 INFO L226 Difference]: Without dead ends: 812 [2020-10-20 01:49:15,468 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-10-20 01:49:15,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 812 states. [2020-10-20 01:49:15,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 812 to 360. [2020-10-20 01:49:15,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 360 states. [2020-10-20 01:49:15,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 491 transitions. [2020-10-20 01:49:15,516 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 491 transitions. Word has length 34 [2020-10-20 01:49:15,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:49:15,517 INFO L481 AbstractCegarLoop]: Abstraction has 360 states and 491 transitions. [2020-10-20 01:49:15,517 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-20 01:49:15,517 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 491 transitions. [2020-10-20 01:49:15,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-10-20 01:49:15,518 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:49:15,519 INFO L422 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 01:49:15,519 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-20 01:49:15,519 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:49:15,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:49:15,519 INFO L82 PathProgramCache]: Analyzing trace with hash 1526891151, now seen corresponding path program 1 times [2020-10-20 01:49:15,520 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:49:15,520 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47527633] [2020-10-20 01:49:15,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:49:15,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:49:15,597 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:49:15,597 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47527633] [2020-10-20 01:49:15,598 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:49:15,598 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-20 01:49:15,598 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147189884] [2020-10-20 01:49:15,599 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-20 01:49:15,599 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:49:15,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-20 01:49:15,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-20 01:49:15,599 INFO L87 Difference]: Start difference. First operand 360 states and 491 transitions. Second operand 4 states. [2020-10-20 01:49:15,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:49:15,781 INFO L93 Difference]: Finished difference Result 1662 states and 2286 transitions. [2020-10-20 01:49:15,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-20 01:49:15,783 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2020-10-20 01:49:15,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:49:15,790 INFO L225 Difference]: With dead ends: 1662 [2020-10-20 01:49:15,791 INFO L226 Difference]: Without dead ends: 1324 [2020-10-20 01:49:15,793 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-20 01:49:15,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1324 states. [2020-10-20 01:49:15,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1324 to 674. [2020-10-20 01:49:15,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 674 states. [2020-10-20 01:49:15,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 674 states to 674 states and 923 transitions. [2020-10-20 01:49:15,876 INFO L78 Accepts]: Start accepts. Automaton has 674 states and 923 transitions. Word has length 34 [2020-10-20 01:49:15,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:49:15,881 INFO L481 AbstractCegarLoop]: Abstraction has 674 states and 923 transitions. [2020-10-20 01:49:15,882 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-20 01:49:15,882 INFO L276 IsEmpty]: Start isEmpty. Operand 674 states and 923 transitions. [2020-10-20 01:49:15,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-10-20 01:49:15,884 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:49:15,884 INFO L422 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 01:49:15,885 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-20 01:49:15,886 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:49:15,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:49:15,886 INFO L82 PathProgramCache]: Analyzing trace with hash 678817943, now seen corresponding path program 1 times [2020-10-20 01:49:15,887 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:49:15,887 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059187290] [2020-10-20 01:49:15,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:49:15,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:49:15,976 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:49:15,977 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059187290] [2020-10-20 01:49:15,978 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:49:15,978 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-20 01:49:15,978 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026288121] [2020-10-20 01:49:15,978 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-20 01:49:15,979 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:49:15,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-20 01:49:15,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-20 01:49:15,980 INFO L87 Difference]: Start difference. First operand 674 states and 923 transitions. Second operand 5 states. [2020-10-20 01:49:16,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:49:16,118 INFO L93 Difference]: Finished difference Result 1497 states and 2054 transitions. [2020-10-20 01:49:16,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-20 01:49:16,119 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2020-10-20 01:49:16,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:49:16,125 INFO L225 Difference]: With dead ends: 1497 [2020-10-20 01:49:16,125 INFO L226 Difference]: Without dead ends: 845 [2020-10-20 01:49:16,127 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-20 01:49:16,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 845 states. [2020-10-20 01:49:16,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 845 to 837. [2020-10-20 01:49:16,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 837 states. [2020-10-20 01:49:16,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 837 states to 837 states and 1144 transitions. [2020-10-20 01:49:16,210 INFO L78 Accepts]: Start accepts. Automaton has 837 states and 1144 transitions. Word has length 41 [2020-10-20 01:49:16,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:49:16,211 INFO L481 AbstractCegarLoop]: Abstraction has 837 states and 1144 transitions. [2020-10-20 01:49:16,211 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-20 01:49:16,211 INFO L276 IsEmpty]: Start isEmpty. Operand 837 states and 1144 transitions. [2020-10-20 01:49:16,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2020-10-20 01:49:16,215 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:49:16,216 INFO L422 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 01:49:16,216 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-20 01:49:16,216 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:49:16,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:49:16,217 INFO L82 PathProgramCache]: Analyzing trace with hash 1967171351, now seen corresponding path program 1 times [2020-10-20 01:49:16,217 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:49:16,217 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889543020] [2020-10-20 01:49:16,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:49:16,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:49:16,312 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:49:16,313 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889543020] [2020-10-20 01:49:16,313 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:49:16,313 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-20 01:49:16,313 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534154654] [2020-10-20 01:49:16,314 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-20 01:49:16,314 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:49:16,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-20 01:49:16,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-20 01:49:16,314 INFO L87 Difference]: Start difference. First operand 837 states and 1144 transitions. Second operand 6 states. [2020-10-20 01:49:16,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:49:16,656 INFO L93 Difference]: Finished difference Result 3287 states and 4502 transitions. [2020-10-20 01:49:16,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-20 01:49:16,657 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 44 [2020-10-20 01:49:16,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:49:16,674 INFO L225 Difference]: With dead ends: 3287 [2020-10-20 01:49:16,675 INFO L226 Difference]: Without dead ends: 2472 [2020-10-20 01:49:16,678 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-10-20 01:49:16,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2472 states. [2020-10-20 01:49:16,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2472 to 1321. [2020-10-20 01:49:16,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1321 states. [2020-10-20 01:49:16,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1321 states to 1321 states and 1806 transitions. [2020-10-20 01:49:16,869 INFO L78 Accepts]: Start accepts. Automaton has 1321 states and 1806 transitions. Word has length 44 [2020-10-20 01:49:16,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:49:16,870 INFO L481 AbstractCegarLoop]: Abstraction has 1321 states and 1806 transitions. [2020-10-20 01:49:16,870 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-20 01:49:16,871 INFO L276 IsEmpty]: Start isEmpty. Operand 1321 states and 1806 transitions. [2020-10-20 01:49:16,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2020-10-20 01:49:16,872 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:49:16,873 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-10-20 01:49:16,873 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-20 01:49:16,873 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:49:16,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:49:16,874 INFO L82 PathProgramCache]: Analyzing trace with hash -477389262, now seen corresponding path program 1 times [2020-10-20 01:49:16,875 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:49:16,875 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401640411] [2020-10-20 01:49:16,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:49:16,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:49:16,928 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-20 01:49:16,929 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401640411] [2020-10-20 01:49:16,929 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:49:16,929 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 01:49:16,931 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631618159] [2020-10-20 01:49:16,933 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-20 01:49:16,934 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:49:16,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 01:49:16,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 01:49:16,936 INFO L87 Difference]: Start difference. First operand 1321 states and 1806 transitions. Second operand 3 states. [2020-10-20 01:49:17,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:49:17,209 INFO L93 Difference]: Finished difference Result 3798 states and 5147 transitions. [2020-10-20 01:49:17,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 01:49:17,210 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2020-10-20 01:49:17,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:49:17,223 INFO L225 Difference]: With dead ends: 3798 [2020-10-20 01:49:17,223 INFO L226 Difference]: Without dead ends: 2499 [2020-10-20 01:49:17,226 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 01:49:17,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2499 states. [2020-10-20 01:49:17,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2499 to 2495. [2020-10-20 01:49:17,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2495 states. [2020-10-20 01:49:17,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2495 states to 2495 states and 3301 transitions. [2020-10-20 01:49:17,444 INFO L78 Accepts]: Start accepts. Automaton has 2495 states and 3301 transitions. Word has length 46 [2020-10-20 01:49:17,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:49:17,445 INFO L481 AbstractCegarLoop]: Abstraction has 2495 states and 3301 transitions. [2020-10-20 01:49:17,445 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-20 01:49:17,445 INFO L276 IsEmpty]: Start isEmpty. Operand 2495 states and 3301 transitions. [2020-10-20 01:49:17,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2020-10-20 01:49:17,446 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:49:17,446 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-10-20 01:49:17,447 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-20 01:49:17,447 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:49:17,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:49:17,447 INFO L82 PathProgramCache]: Analyzing trace with hash -162601451, now seen corresponding path program 1 times [2020-10-20 01:49:17,448 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:49:17,448 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558897763] [2020-10-20 01:49:17,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:49:17,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:49:17,497 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:49:17,497 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558897763] [2020-10-20 01:49:17,497 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:49:17,498 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 01:49:17,498 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332478243] [2020-10-20 01:49:17,498 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-20 01:49:17,498 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:49:17,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 01:49:17,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 01:49:17,499 INFO L87 Difference]: Start difference. First operand 2495 states and 3301 transitions. Second operand 3 states. [2020-10-20 01:49:17,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:49:17,879 INFO L93 Difference]: Finished difference Result 7169 states and 9443 transitions. [2020-10-20 01:49:17,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 01:49:17,880 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2020-10-20 01:49:17,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:49:17,903 INFO L225 Difference]: With dead ends: 7169 [2020-10-20 01:49:17,903 INFO L226 Difference]: Without dead ends: 4714 [2020-10-20 01:49:17,907 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 01:49:17,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4714 states. [2020-10-20 01:49:18,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4714 to 4712. [2020-10-20 01:49:18,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4712 states. [2020-10-20 01:49:18,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4712 states to 4712 states and 6108 transitions. [2020-10-20 01:49:18,560 INFO L78 Accepts]: Start accepts. Automaton has 4712 states and 6108 transitions. Word has length 48 [2020-10-20 01:49:18,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:49:18,561 INFO L481 AbstractCegarLoop]: Abstraction has 4712 states and 6108 transitions. [2020-10-20 01:49:18,561 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-20 01:49:18,561 INFO L276 IsEmpty]: Start isEmpty. Operand 4712 states and 6108 transitions. [2020-10-20 01:49:18,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2020-10-20 01:49:18,566 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:49:18,567 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-10-20 01:49:18,567 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-20 01:49:18,567 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:49:18,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:49:18,568 INFO L82 PathProgramCache]: Analyzing trace with hash 297274720, now seen corresponding path program 1 times [2020-10-20 01:49:18,568 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:49:18,568 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459802231] [2020-10-20 01:49:18,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:49:18,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:49:18,652 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:49:18,653 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459802231] [2020-10-20 01:49:18,654 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:49:18,654 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-20 01:49:18,655 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133932712] [2020-10-20 01:49:18,655 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-20 01:49:18,656 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:49:18,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-20 01:49:18,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-20 01:49:18,657 INFO L87 Difference]: Start difference. First operand 4712 states and 6108 transitions. Second operand 4 states. [2020-10-20 01:49:19,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:49:19,416 INFO L93 Difference]: Finished difference Result 11359 states and 14646 transitions. [2020-10-20 01:49:19,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-20 01:49:19,417 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 48 [2020-10-20 01:49:19,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:49:19,451 INFO L225 Difference]: With dead ends: 11359 [2020-10-20 01:49:19,452 INFO L226 Difference]: Without dead ends: 6671 [2020-10-20 01:49:19,460 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-20 01:49:19,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6671 states. [2020-10-20 01:49:20,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6671 to 5850. [2020-10-20 01:49:20,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5850 states. [2020-10-20 01:49:20,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5850 states to 5850 states and 7394 transitions. [2020-10-20 01:49:20,384 INFO L78 Accepts]: Start accepts. Automaton has 5850 states and 7394 transitions. Word has length 48 [2020-10-20 01:49:20,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:49:20,384 INFO L481 AbstractCegarLoop]: Abstraction has 5850 states and 7394 transitions. [2020-10-20 01:49:20,385 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-20 01:49:20,385 INFO L276 IsEmpty]: Start isEmpty. Operand 5850 states and 7394 transitions. [2020-10-20 01:49:20,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2020-10-20 01:49:20,386 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:49:20,386 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-10-20 01:49:20,386 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-20 01:49:20,387 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:49:20,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:49:20,387 INFO L82 PathProgramCache]: Analyzing trace with hash -2096931086, now seen corresponding path program 1 times [2020-10-20 01:49:20,387 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:49:20,388 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596111455] [2020-10-20 01:49:20,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:49:20,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:49:20,428 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:49:20,428 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596111455] [2020-10-20 01:49:20,428 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:49:20,429 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-20 01:49:20,429 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007918818] [2020-10-20 01:49:20,429 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-20 01:49:20,430 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:49:20,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-20 01:49:20,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-20 01:49:20,431 INFO L87 Difference]: Start difference. First operand 5850 states and 7394 transitions. Second operand 4 states. [2020-10-20 01:49:20,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:49:20,907 INFO L93 Difference]: Finished difference Result 10947 states and 13872 transitions. [2020-10-20 01:49:20,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-20 01:49:20,908 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 49 [2020-10-20 01:49:20,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:49:20,932 INFO L225 Difference]: With dead ends: 10947 [2020-10-20 01:49:20,932 INFO L226 Difference]: Without dead ends: 5013 [2020-10-20 01:49:20,942 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-20 01:49:20,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5013 states. [2020-10-20 01:49:21,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5013 to 4814. [2020-10-20 01:49:21,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4814 states. [2020-10-20 01:49:21,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4814 states to 4814 states and 5985 transitions. [2020-10-20 01:49:21,658 INFO L78 Accepts]: Start accepts. Automaton has 4814 states and 5985 transitions. Word has length 49 [2020-10-20 01:49:21,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:49:21,658 INFO L481 AbstractCegarLoop]: Abstraction has 4814 states and 5985 transitions. [2020-10-20 01:49:21,659 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-20 01:49:21,659 INFO L276 IsEmpty]: Start isEmpty. Operand 4814 states and 5985 transitions. [2020-10-20 01:49:21,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2020-10-20 01:49:21,664 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:49:21,665 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 01:49:21,665 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-20 01:49:21,665 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:49:21,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:49:21,666 INFO L82 PathProgramCache]: Analyzing trace with hash 358168785, now seen corresponding path program 1 times [2020-10-20 01:49:21,666 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:49:21,667 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806225898] [2020-10-20 01:49:21,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:49:21,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:49:21,721 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-20 01:49:21,721 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806225898] [2020-10-20 01:49:21,722 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:49:21,722 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-20 01:49:21,723 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49345826] [2020-10-20 01:49:21,723 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-20 01:49:21,724 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:49:21,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-20 01:49:21,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-20 01:49:21,725 INFO L87 Difference]: Start difference. First operand 4814 states and 5985 transitions. Second operand 5 states. [2020-10-20 01:49:22,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:49:22,144 INFO L93 Difference]: Finished difference Result 8526 states and 10629 transitions. [2020-10-20 01:49:22,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-20 01:49:22,145 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 83 [2020-10-20 01:49:22,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:49:22,163 INFO L225 Difference]: With dead ends: 8526 [2020-10-20 01:49:22,164 INFO L226 Difference]: Without dead ends: 3744 [2020-10-20 01:49:22,171 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-10-20 01:49:22,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3744 states. [2020-10-20 01:49:22,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3744 to 3233. [2020-10-20 01:49:22,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3233 states. [2020-10-20 01:49:22,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3233 states to 3233 states and 4035 transitions. [2020-10-20 01:49:22,415 INFO L78 Accepts]: Start accepts. Automaton has 3233 states and 4035 transitions. Word has length 83 [2020-10-20 01:49:22,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:49:22,416 INFO L481 AbstractCegarLoop]: Abstraction has 3233 states and 4035 transitions. [2020-10-20 01:49:22,416 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-20 01:49:22,416 INFO L276 IsEmpty]: Start isEmpty. Operand 3233 states and 4035 transitions. [2020-10-20 01:49:22,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2020-10-20 01:49:22,419 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:49:22,419 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 01:49:22,420 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-20 01:49:22,420 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:49:22,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:49:22,420 INFO L82 PathProgramCache]: Analyzing trace with hash -1417804680, now seen corresponding path program 1 times [2020-10-20 01:49:22,421 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:49:22,421 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291667989] [2020-10-20 01:49:22,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:49:22,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:49:22,443 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2020-10-20 01:49:22,443 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291667989] [2020-10-20 01:49:22,443 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:49:22,444 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 01:49:22,444 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400060140] [2020-10-20 01:49:22,444 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-20 01:49:22,445 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:49:22,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 01:49:22,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 01:49:22,445 INFO L87 Difference]: Start difference. First operand 3233 states and 4035 transitions. Second operand 3 states. [2020-10-20 01:49:22,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:49:22,646 INFO L93 Difference]: Finished difference Result 3481 states and 4330 transitions. [2020-10-20 01:49:22,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 01:49:22,647 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 86 [2020-10-20 01:49:22,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:49:22,655 INFO L225 Difference]: With dead ends: 3481 [2020-10-20 01:49:22,655 INFO L226 Difference]: Without dead ends: 3217 [2020-10-20 01:49:22,657 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 01:49:22,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3217 states. [2020-10-20 01:49:22,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3217 to 3217. [2020-10-20 01:49:22,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3217 states. [2020-10-20 01:49:22,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3217 states to 3217 states and 4018 transitions. [2020-10-20 01:49:22,916 INFO L78 Accepts]: Start accepts. Automaton has 3217 states and 4018 transitions. Word has length 86 [2020-10-20 01:49:22,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:49:22,917 INFO L481 AbstractCegarLoop]: Abstraction has 3217 states and 4018 transitions. [2020-10-20 01:49:22,917 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-20 01:49:22,917 INFO L276 IsEmpty]: Start isEmpty. Operand 3217 states and 4018 transitions. [2020-10-20 01:49:22,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2020-10-20 01:49:22,921 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:49:22,921 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2020-10-20 01:49:22,921 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-20 01:49:22,922 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:49:22,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:49:22,922 INFO L82 PathProgramCache]: Analyzing trace with hash -402537650, now seen corresponding path program 1 times [2020-10-20 01:49:22,923 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:49:22,923 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080334505] [2020-10-20 01:49:22,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:49:22,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:49:22,984 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-10-20 01:49:22,985 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080334505] [2020-10-20 01:49:22,985 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:49:22,985 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 01:49:22,986 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981616918] [2020-10-20 01:49:22,986 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-20 01:49:22,986 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:49:22,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 01:49:22,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 01:49:22,987 INFO L87 Difference]: Start difference. First operand 3217 states and 4018 transitions. Second operand 3 states. [2020-10-20 01:49:23,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:49:23,217 INFO L93 Difference]: Finished difference Result 3591 states and 4462 transitions. [2020-10-20 01:49:23,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 01:49:23,218 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 89 [2020-10-20 01:49:23,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:49:23,226 INFO L225 Difference]: With dead ends: 3591 [2020-10-20 01:49:23,226 INFO L226 Difference]: Without dead ends: 3202 [2020-10-20 01:49:23,228 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 01:49:23,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3202 states. [2020-10-20 01:49:23,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3202 to 3195. [2020-10-20 01:49:23,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3195 states. [2020-10-20 01:49:23,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3195 states to 3195 states and 3992 transitions. [2020-10-20 01:49:23,459 INFO L78 Accepts]: Start accepts. Automaton has 3195 states and 3992 transitions. Word has length 89 [2020-10-20 01:49:23,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:49:23,459 INFO L481 AbstractCegarLoop]: Abstraction has 3195 states and 3992 transitions. [2020-10-20 01:49:23,460 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-20 01:49:23,460 INFO L276 IsEmpty]: Start isEmpty. Operand 3195 states and 3992 transitions. [2020-10-20 01:49:23,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2020-10-20 01:49:23,462 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:49:23,463 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1] [2020-10-20 01:49:23,463 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-20 01:49:23,463 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:49:23,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:49:23,464 INFO L82 PathProgramCache]: Analyzing trace with hash 1336538508, now seen corresponding path program 1 times [2020-10-20 01:49:23,464 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:49:23,464 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768541874] [2020-10-20 01:49:23,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:49:23,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:49:23,522 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-10-20 01:49:23,523 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768541874] [2020-10-20 01:49:23,523 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:49:23,523 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-20 01:49:23,524 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132701683] [2020-10-20 01:49:23,524 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-20 01:49:23,525 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:49:23,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-20 01:49:23,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-20 01:49:23,525 INFO L87 Difference]: Start difference. First operand 3195 states and 3992 transitions. Second operand 5 states. [2020-10-20 01:49:23,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:49:23,806 INFO L93 Difference]: Finished difference Result 6859 states and 8520 transitions. [2020-10-20 01:49:23,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-20 01:49:23,807 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 95 [2020-10-20 01:49:23,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:49:23,814 INFO L225 Difference]: With dead ends: 6859 [2020-10-20 01:49:23,814 INFO L226 Difference]: Without dead ends: 3724 [2020-10-20 01:49:23,820 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-10-20 01:49:23,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3724 states. [2020-10-20 01:49:24,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3724 to 3073. [2020-10-20 01:49:24,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3073 states. [2020-10-20 01:49:24,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3073 states to 3073 states and 3805 transitions. [2020-10-20 01:49:24,045 INFO L78 Accepts]: Start accepts. Automaton has 3073 states and 3805 transitions. Word has length 95 [2020-10-20 01:49:24,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:49:24,045 INFO L481 AbstractCegarLoop]: Abstraction has 3073 states and 3805 transitions. [2020-10-20 01:49:24,045 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-20 01:49:24,046 INFO L276 IsEmpty]: Start isEmpty. Operand 3073 states and 3805 transitions. [2020-10-20 01:49:24,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2020-10-20 01:49:24,048 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:49:24,048 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 01:49:24,048 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-10-20 01:49:24,048 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:49:24,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:49:24,049 INFO L82 PathProgramCache]: Analyzing trace with hash 126172792, now seen corresponding path program 1 times [2020-10-20 01:49:24,049 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:49:24,049 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594323764] [2020-10-20 01:49:24,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:49:24,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:49:24,100 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-10-20 01:49:24,101 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594323764] [2020-10-20 01:49:24,101 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:49:24,101 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-20 01:49:24,101 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808477535] [2020-10-20 01:49:24,102 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-20 01:49:24,102 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:49:24,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-20 01:49:24,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-20 01:49:24,103 INFO L87 Difference]: Start difference. First operand 3073 states and 3805 transitions. Second operand 5 states. [2020-10-20 01:49:24,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:49:24,314 INFO L93 Difference]: Finished difference Result 5583 states and 6899 transitions. [2020-10-20 01:49:24,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-20 01:49:24,315 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 98 [2020-10-20 01:49:24,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:49:24,320 INFO L225 Difference]: With dead ends: 5583 [2020-10-20 01:49:24,320 INFO L226 Difference]: Without dead ends: 2208 [2020-10-20 01:49:24,325 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-10-20 01:49:24,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2208 states. [2020-10-20 01:49:24,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2208 to 2050. [2020-10-20 01:49:24,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2050 states. [2020-10-20 01:49:24,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2050 states to 2050 states and 2515 transitions. [2020-10-20 01:49:24,458 INFO L78 Accepts]: Start accepts. Automaton has 2050 states and 2515 transitions. Word has length 98 [2020-10-20 01:49:24,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:49:24,458 INFO L481 AbstractCegarLoop]: Abstraction has 2050 states and 2515 transitions. [2020-10-20 01:49:24,458 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-20 01:49:24,458 INFO L276 IsEmpty]: Start isEmpty. Operand 2050 states and 2515 transitions. [2020-10-20 01:49:24,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2020-10-20 01:49:24,460 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:49:24,461 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 01:49:24,461 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-10-20 01:49:24,461 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:49:24,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:49:24,461 INFO L82 PathProgramCache]: Analyzing trace with hash -1098481666, now seen corresponding path program 1 times [2020-10-20 01:49:24,461 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:49:24,462 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182734316] [2020-10-20 01:49:24,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:49:24,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:49:24,507 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:49:24,508 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182734316] [2020-10-20 01:49:24,508 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:49:24,508 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 01:49:24,509 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859081439] [2020-10-20 01:49:24,510 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-20 01:49:24,511 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:49:24,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 01:49:24,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 01:49:24,515 INFO L87 Difference]: Start difference. First operand 2050 states and 2515 transitions. Second operand 3 states. [2020-10-20 01:49:24,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:49:24,668 INFO L93 Difference]: Finished difference Result 3786 states and 4676 transitions. [2020-10-20 01:49:24,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 01:49:24,669 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 111 [2020-10-20 01:49:24,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:49:24,672 INFO L225 Difference]: With dead ends: 3786 [2020-10-20 01:49:24,673 INFO L226 Difference]: Without dead ends: 1796 [2020-10-20 01:49:24,676 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 01:49:24,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1796 states. [2020-10-20 01:49:24,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1796 to 1793. [2020-10-20 01:49:24,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1793 states. [2020-10-20 01:49:24,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1793 states to 1793 states and 2167 transitions. [2020-10-20 01:49:24,794 INFO L78 Accepts]: Start accepts. Automaton has 1793 states and 2167 transitions. Word has length 111 [2020-10-20 01:49:24,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:49:24,794 INFO L481 AbstractCegarLoop]: Abstraction has 1793 states and 2167 transitions. [2020-10-20 01:49:24,794 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-20 01:49:24,795 INFO L276 IsEmpty]: Start isEmpty. Operand 1793 states and 2167 transitions. [2020-10-20 01:49:24,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2020-10-20 01:49:24,798 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:49:24,799 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 01:49:24,799 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-10-20 01:49:24,799 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:49:24,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:49:24,800 INFO L82 PathProgramCache]: Analyzing trace with hash -1656411785, now seen corresponding path program 1 times [2020-10-20 01:49:24,801 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:49:24,802 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691787627] [2020-10-20 01:49:24,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:49:24,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:49:24,867 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-10-20 01:49:24,868 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691787627] [2020-10-20 01:49:24,868 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:49:24,868 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-20 01:49:24,869 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411307324] [2020-10-20 01:49:24,870 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-20 01:49:24,871 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:49:24,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-20 01:49:24,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-20 01:49:24,871 INFO L87 Difference]: Start difference. First operand 1793 states and 2167 transitions. Second operand 5 states. [2020-10-20 01:49:25,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:49:25,028 INFO L93 Difference]: Finished difference Result 3489 states and 4203 transitions. [2020-10-20 01:49:25,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-20 01:49:25,028 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 113 [2020-10-20 01:49:25,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:49:25,031 INFO L225 Difference]: With dead ends: 3489 [2020-10-20 01:49:25,031 INFO L226 Difference]: Without dead ends: 1757 [2020-10-20 01:49:25,034 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-10-20 01:49:25,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1757 states. [2020-10-20 01:49:25,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1757 to 1618. [2020-10-20 01:49:25,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1618 states. [2020-10-20 01:49:25,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1618 states to 1618 states and 1932 transitions. [2020-10-20 01:49:25,166 INFO L78 Accepts]: Start accepts. Automaton has 1618 states and 1932 transitions. Word has length 113 [2020-10-20 01:49:25,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:49:25,166 INFO L481 AbstractCegarLoop]: Abstraction has 1618 states and 1932 transitions. [2020-10-20 01:49:25,166 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-20 01:49:25,167 INFO L276 IsEmpty]: Start isEmpty. Operand 1618 states and 1932 transitions. [2020-10-20 01:49:25,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2020-10-20 01:49:25,168 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:49:25,169 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 01:49:25,169 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-10-20 01:49:25,169 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:49:25,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:49:25,169 INFO L82 PathProgramCache]: Analyzing trace with hash -1864761928, now seen corresponding path program 1 times [2020-10-20 01:49:25,169 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:49:25,170 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364344164] [2020-10-20 01:49:25,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:49:25,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:49:25,207 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:49:25,208 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364344164] [2020-10-20 01:49:25,208 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:49:25,208 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 01:49:25,208 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188152850] [2020-10-20 01:49:25,209 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-20 01:49:25,209 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:49:25,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 01:49:25,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 01:49:25,209 INFO L87 Difference]: Start difference. First operand 1618 states and 1932 transitions. Second operand 3 states. [2020-10-20 01:49:25,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:49:25,400 INFO L93 Difference]: Finished difference Result 3212 states and 3849 transitions. [2020-10-20 01:49:25,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 01:49:25,400 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 113 [2020-10-20 01:49:25,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:49:25,405 INFO L225 Difference]: With dead ends: 3212 [2020-10-20 01:49:25,405 INFO L226 Difference]: Without dead ends: 1655 [2020-10-20 01:49:25,408 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 01:49:25,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1655 states. [2020-10-20 01:49:25,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1655 to 1646. [2020-10-20 01:49:25,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1646 states. [2020-10-20 01:49:25,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1646 states to 1646 states and 1934 transitions. [2020-10-20 01:49:25,581 INFO L78 Accepts]: Start accepts. Automaton has 1646 states and 1934 transitions. Word has length 113 [2020-10-20 01:49:25,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:49:25,581 INFO L481 AbstractCegarLoop]: Abstraction has 1646 states and 1934 transitions. [2020-10-20 01:49:25,582 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-20 01:49:25,582 INFO L276 IsEmpty]: Start isEmpty. Operand 1646 states and 1934 transitions. [2020-10-20 01:49:25,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2020-10-20 01:49:25,585 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:49:25,585 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 01:49:25,585 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-10-20 01:49:25,585 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:49:25,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:49:25,586 INFO L82 PathProgramCache]: Analyzing trace with hash -1931636839, now seen corresponding path program 1 times [2020-10-20 01:49:25,586 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:49:25,587 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275712901] [2020-10-20 01:49:25,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:49:25,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:49:25,661 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-10-20 01:49:25,661 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275712901] [2020-10-20 01:49:25,661 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:49:25,662 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-20 01:49:25,662 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397296366] [2020-10-20 01:49:25,663 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-20 01:49:25,663 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:49:25,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-20 01:49:25,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-20 01:49:25,663 INFO L87 Difference]: Start difference. First operand 1646 states and 1934 transitions. Second operand 5 states. [2020-10-20 01:49:26,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:49:26,127 INFO L93 Difference]: Finished difference Result 4611 states and 5427 transitions. [2020-10-20 01:49:26,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-20 01:49:26,128 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 114 [2020-10-20 01:49:26,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:49:26,134 INFO L225 Difference]: With dead ends: 4611 [2020-10-20 01:49:26,135 INFO L226 Difference]: Without dead ends: 3026 [2020-10-20 01:49:26,139 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2020-10-20 01:49:26,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3026 states. [2020-10-20 01:49:26,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3026 to 1648. [2020-10-20 01:49:26,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1648 states. [2020-10-20 01:49:26,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1648 states to 1648 states and 1932 transitions. [2020-10-20 01:49:26,308 INFO L78 Accepts]: Start accepts. Automaton has 1648 states and 1932 transitions. Word has length 114 [2020-10-20 01:49:26,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:49:26,308 INFO L481 AbstractCegarLoop]: Abstraction has 1648 states and 1932 transitions. [2020-10-20 01:49:26,308 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-20 01:49:26,308 INFO L276 IsEmpty]: Start isEmpty. Operand 1648 states and 1932 transitions. [2020-10-20 01:49:26,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2020-10-20 01:49:26,311 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:49:26,311 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 01:49:26,311 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-10-20 01:49:26,311 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:49:26,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:49:26,312 INFO L82 PathProgramCache]: Analyzing trace with hash 163305011, now seen corresponding path program 1 times [2020-10-20 01:49:26,312 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:49:26,312 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511609958] [2020-10-20 01:49:26,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:49:26,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:49:26,356 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-10-20 01:49:26,357 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511609958] [2020-10-20 01:49:26,357 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:49:26,358 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 01:49:26,358 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366230323] [2020-10-20 01:49:26,359 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-20 01:49:26,359 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:49:26,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 01:49:26,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 01:49:26,360 INFO L87 Difference]: Start difference. First operand 1648 states and 1932 transitions. Second operand 3 states. [2020-10-20 01:49:26,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:49:26,490 INFO L93 Difference]: Finished difference Result 2927 states and 3440 transitions. [2020-10-20 01:49:26,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 01:49:26,491 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 116 [2020-10-20 01:49:26,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:49:26,494 INFO L225 Difference]: With dead ends: 2927 [2020-10-20 01:49:26,494 INFO L226 Difference]: Without dead ends: 1340 [2020-10-20 01:49:26,496 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 01:49:26,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1340 states. [2020-10-20 01:49:26,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1340 to 1232. [2020-10-20 01:49:26,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1232 states. [2020-10-20 01:49:26,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1232 states to 1232 states and 1430 transitions. [2020-10-20 01:49:26,592 INFO L78 Accepts]: Start accepts. Automaton has 1232 states and 1430 transitions. Word has length 116 [2020-10-20 01:49:26,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:49:26,592 INFO L481 AbstractCegarLoop]: Abstraction has 1232 states and 1430 transitions. [2020-10-20 01:49:26,592 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-20 01:49:26,593 INFO L276 IsEmpty]: Start isEmpty. Operand 1232 states and 1430 transitions. [2020-10-20 01:49:26,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2020-10-20 01:49:26,594 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:49:26,595 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 01:49:26,595 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-10-20 01:49:26,595 INFO L429 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:49:26,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:49:26,596 INFO L82 PathProgramCache]: Analyzing trace with hash -641278560, now seen corresponding path program 1 times [2020-10-20 01:49:26,596 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:49:26,596 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732044442] [2020-10-20 01:49:26,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:49:26,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:49:26,760 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2020-10-20 01:49:26,760 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732044442] [2020-10-20 01:49:26,761 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [339371065] [2020-10-20 01:49:26,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 01:49:26,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:49:26,945 INFO L263 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 9 conjunts are in the unsatisfiable core [2020-10-20 01:49:26,967 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 01:49:27,116 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2020-10-20 01:49:27,116 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 01:49:27,116 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2020-10-20 01:49:27,117 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000332808] [2020-10-20 01:49:27,117 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-20 01:49:27,117 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:49:27,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-20 01:49:27,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-20 01:49:27,118 INFO L87 Difference]: Start difference. First operand 1232 states and 1430 transitions. Second operand 5 states. [2020-10-20 01:49:27,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:49:27,558 INFO L93 Difference]: Finished difference Result 2927 states and 3398 transitions. [2020-10-20 01:49:27,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-20 01:49:27,559 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 118 [2020-10-20 01:49:27,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:49:27,565 INFO L225 Difference]: With dead ends: 2927 [2020-10-20 01:49:27,565 INFO L226 Difference]: Without dead ends: 2134 [2020-10-20 01:49:27,567 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 117 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-10-20 01:49:27,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2134 states. [2020-10-20 01:49:27,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2134 to 1347. [2020-10-20 01:49:27,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1347 states. [2020-10-20 01:49:27,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1347 states to 1347 states and 1557 transitions. [2020-10-20 01:49:27,768 INFO L78 Accepts]: Start accepts. Automaton has 1347 states and 1557 transitions. Word has length 118 [2020-10-20 01:49:27,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:49:27,768 INFO L481 AbstractCegarLoop]: Abstraction has 1347 states and 1557 transitions. [2020-10-20 01:49:27,768 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-20 01:49:27,768 INFO L276 IsEmpty]: Start isEmpty. Operand 1347 states and 1557 transitions. [2020-10-20 01:49:27,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2020-10-20 01:49:27,771 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:49:27,771 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 4, 4, 4, 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, 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] [2020-10-20 01:49:27,985 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2020-10-20 01:49:27,985 INFO L429 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:49:27,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:49:27,986 INFO L82 PathProgramCache]: Analyzing trace with hash -361097061, now seen corresponding path program 1 times [2020-10-20 01:49:27,986 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:49:27,986 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684059933] [2020-10-20 01:49:27,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:49:28,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 01:49:28,031 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 01:49:28,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 01:49:28,074 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 01:49:28,170 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 01:49:28,170 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-20 01:49:28,171 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2020-10-20 01:49:28,402 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.10 01:49:28 BoogieIcfgContainer [2020-10-20 01:49:28,403 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-20 01:49:28,403 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-10-20 01:49:28,403 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-10-20 01:49:28,403 INFO L275 PluginConnector]: Witness Printer initialized [2020-10-20 01:49:28,404 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 01:49:13" (3/4) ... [2020-10-20 01:49:28,406 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-10-20 01:49:28,634 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-10-20 01:49:28,634 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-10-20 01:49:28,637 INFO L168 Benchmark]: Toolchain (without parser) took 15997.16 ms. Allocated memory was 36.2 MB in the beginning and 289.4 MB in the end (delta: 253.2 MB). Free memory was 13.1 MB in the beginning and 86.8 MB in the end (delta: -73.7 MB). Peak memory consumption was 179.6 MB. Max. memory is 14.3 GB. [2020-10-20 01:49:28,638 INFO L168 Benchmark]: CDTParser took 0.73 ms. Allocated memory is still 34.1 MB. Free memory was 19.1 MB in the beginning and 19.0 MB in the end (delta: 41.5 kB). Peak memory consumption was 41.5 kB. Max. memory is 14.3 GB. [2020-10-20 01:49:28,638 INFO L168 Benchmark]: CACSL2BoogieTranslator took 466.81 ms. Allocated memory was 36.2 MB in the beginning and 44.6 MB in the end (delta: 8.4 MB). Free memory was 12.2 MB in the beginning and 24.8 MB in the end (delta: -12.6 MB). Peak memory consumption was 8.7 MB. Max. memory is 14.3 GB. [2020-10-20 01:49:28,639 INFO L168 Benchmark]: Boogie Procedure Inliner took 53.60 ms. Allocated memory is still 44.6 MB. Free memory was 24.8 MB in the beginning and 22.1 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 14.3 GB. [2020-10-20 01:49:28,639 INFO L168 Benchmark]: Boogie Preprocessor took 39.56 ms. Allocated memory is still 44.6 MB. Free memory was 22.1 MB in the beginning and 20.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 14.3 GB. [2020-10-20 01:49:28,640 INFO L168 Benchmark]: RCFGBuilder took 611.27 ms. Allocated memory was 44.6 MB in the beginning and 47.2 MB in the end (delta: 2.6 MB). Free memory was 19.9 MB in the beginning and 14.6 MB in the end (delta: 5.3 MB). Peak memory consumption was 8.4 MB. Max. memory is 14.3 GB. [2020-10-20 01:49:28,640 INFO L168 Benchmark]: TraceAbstraction took 14584.18 ms. Allocated memory was 47.2 MB in the beginning and 289.4 MB in the end (delta: 242.2 MB). Free memory was 14.0 MB in the beginning and 116.4 MB in the end (delta: -102.4 MB). Peak memory consumption was 139.9 MB. Max. memory is 14.3 GB. [2020-10-20 01:49:28,641 INFO L168 Benchmark]: Witness Printer took 231.25 ms. Allocated memory is still 289.4 MB. Free memory was 116.4 MB in the beginning and 86.8 MB in the end (delta: 29.6 MB). Peak memory consumption was 29.6 MB. Max. memory is 14.3 GB. [2020-10-20 01:49:28,644 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.73 ms. Allocated memory is still 34.1 MB. Free memory was 19.1 MB in the beginning and 19.0 MB in the end (delta: 41.5 kB). Peak memory consumption was 41.5 kB. Max. memory is 14.3 GB. * CACSL2BoogieTranslator took 466.81 ms. Allocated memory was 36.2 MB in the beginning and 44.6 MB in the end (delta: 8.4 MB). Free memory was 12.2 MB in the beginning and 24.8 MB in the end (delta: -12.6 MB). Peak memory consumption was 8.7 MB. Max. memory is 14.3 GB. * Boogie Procedure Inliner took 53.60 ms. Allocated memory is still 44.6 MB. Free memory was 24.8 MB in the beginning and 22.1 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 14.3 GB. * Boogie Preprocessor took 39.56 ms. Allocated memory is still 44.6 MB. Free memory was 22.1 MB in the beginning and 20.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 14.3 GB. * RCFGBuilder took 611.27 ms. Allocated memory was 44.6 MB in the beginning and 47.2 MB in the end (delta: 2.6 MB). Free memory was 19.9 MB in the beginning and 14.6 MB in the end (delta: 5.3 MB). Peak memory consumption was 8.4 MB. Max. memory is 14.3 GB. * TraceAbstraction took 14584.18 ms. Allocated memory was 47.2 MB in the beginning and 289.4 MB in the end (delta: 242.2 MB). Free memory was 14.0 MB in the beginning and 116.4 MB in the end (delta: -102.4 MB). Peak memory consumption was 139.9 MB. Max. memory is 14.3 GB. * Witness Printer took 231.25 ms. Allocated memory is still 289.4 MB. Free memory was 116.4 MB in the beginning and 86.8 MB in the end (delta: 29.6 MB). Peak memory consumption was 29.6 MB. Max. memory is 14.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 3]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L17] int max_loop ; [L18] int num ; [L19] int i ; [L20] int e ; [L21] int timer ; [L22] char data_0 ; [L23] char data_1 ; [L66] int P_1_pc; [L67] int P_1_st ; [L68] int P_1_i ; [L69] int P_1_ev ; [L124] int C_1_pc ; [L125] int C_1_st ; [L126] int C_1_i ; [L127] int C_1_ev ; [L128] int C_1_pr ; VAL [C_1_ev=0, C_1_i=0, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=0, num=0, P_1_ev=0, P_1_i=0, P_1_pc=0, P_1_st=0, timer=0] [L492] int count ; [L493] int __retres2 ; [L497] num = 0 [L498] i = 0 [L499] max_loop = 2 [L501] timer = 0 [L502] P_1_pc = 0 [L503] C_1_pc = 0 [L505] count = 0 [L485] P_1_i = 1 [L486] C_1_i = 1 VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L423] int kernel_st ; [L424] int tmp ; [L425] int tmp___0 ; [L429] kernel_st = 0 VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L228] COND TRUE (int )P_1_i == 1 [L229] P_1_st = 0 VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L233] COND TRUE (int )C_1_i == 1 [L234] C_1_st = 0 VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L367] int tmp ; [L368] int tmp___0 ; [L369] int tmp___1 ; [L106] int __retres1 ; VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L109] COND FALSE !((int )P_1_pc == 1) VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L119] __retres1 = 0 VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L121] return (__retres1); VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L373] tmp = is_P_1_triggered() [L375] COND FALSE !(\read(tmp)) VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L188] int __retres1 ; VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L191] COND FALSE !((int )C_1_pc == 1) VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L201] COND FALSE !((int )C_1_pc == 2) VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L211] __retres1 = 0 VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L213] return (__retres1); VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L381] tmp___1 = is_C_1_triggered() [L383] COND FALSE !(\read(tmp___1)) VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L437] COND TRUE 1 VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L440] kernel_st = 1 [L264] int tmp ; [L265] int tmp___0 ; [L266] int tmp___1 ; [L267] int tmp___2 ; VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L271] COND TRUE 1 VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L243] int __retres1 ; VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L246] COND TRUE (int )P_1_st == 0 [L247] __retres1 = 1 VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L260] return (__retres1); VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L274] tmp___2 = exists_runnable_thread() [L276] COND TRUE \read(tmp___2) VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L281] COND TRUE (int )P_1_st == 0 [L283] tmp = __VERIFIER_nondet_int() [L285] COND FALSE !(\read(tmp)) VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L296] COND TRUE (int )C_1_st == 0 [L298] tmp___1 = __VERIFIER_nondet_int() [L300] COND TRUE \read(tmp___1) [L302] C_1_st = 1 [L130] char c ; VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=1, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L133] COND TRUE (int )C_1_pc == 0 VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=1, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L148] COND TRUE i < max_loop VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=1, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L150] COND TRUE num == 0 [L151] timer = 1 [L152] i += 1 [L153] C_1_pc = 1 [L154] C_1_st = 2 VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=0, data_1=0, e=0, i=1, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=1] [L271] COND TRUE 1 VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=0, data_1=0, e=0, i=1, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=1] [L243] int __retres1 ; VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=0, data_1=0, e=0, i=1, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=1] [L246] COND TRUE (int )P_1_st == 0 [L247] __retres1 = 1 VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=0, data_1=0, e=0, i=1, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=1] [L260] return (__retres1); VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=0, data_1=0, e=0, i=1, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=1] [L274] tmp___2 = exists_runnable_thread() [L276] COND TRUE \read(tmp___2) VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=0, data_1=0, e=0, i=1, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=1] [L281] COND TRUE (int )P_1_st == 0 [L283] tmp = __VERIFIER_nondet_int() [L285] COND TRUE \read(tmp) [L287] P_1_st = 1 VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=0, data_1=0, e=0, i=1, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=1, timer=1] [L74] COND TRUE (int )P_1_pc == 0 VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=0, data_1=0, e=0, i=1, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=1, timer=1] [L85] COND TRUE i < max_loop VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=0, data_1=0, e=0, i=1, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=1, timer=1] [L51] COND TRUE i___0 == 0 [L52] data_0 = c VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=1, timer=1] [L89] num += 1 [L90] P_1_pc = 1 [L91] P_1_st = 2 VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L296] COND FALSE !((int )C_1_st == 0) VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L271] COND TRUE 1 VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L243] int __retres1 ; VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L246] COND FALSE !((int )P_1_st == 0) VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L250] COND FALSE !((int )C_1_st == 0) [L258] __retres1 = 0 VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L260] return (__retres1); VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L274] tmp___2 = exists_runnable_thread() [L276] COND FALSE !(\read(tmp___2)) VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L444] kernel_st = 2 VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L448] kernel_st = 3 VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L367] int tmp ; [L368] int tmp___0 ; [L369] int tmp___1 ; [L106] int __retres1 ; VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L109] COND TRUE (int )P_1_pc == 1 VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L110] COND FALSE !((int )P_1_ev == 1) VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L119] __retres1 = 0 VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L121] return (__retres1); VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L373] tmp = is_P_1_triggered() [L375] COND FALSE !(\read(tmp)) VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L188] int __retres1 ; VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L191] COND TRUE (int )C_1_pc == 1 VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L192] COND FALSE !((int )e == 1) VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L201] COND FALSE !((int )C_1_pc == 2) VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L211] __retres1 = 0 VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L213] return (__retres1); VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L381] tmp___1 = is_C_1_triggered() [L383] COND FALSE !(\read(tmp___1)) VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L243] int __retres1 ; VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L246] COND FALSE !((int )P_1_st == 0) VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L250] COND FALSE !((int )C_1_st == 0) [L258] __retres1 = 0 VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L260] return (__retres1); VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L454] tmp = exists_runnable_thread() [L456] COND TRUE tmp == 0 [L458] kernel_st = 4 [L338] C_1_ev = 1 [L340] P_1_ev = 1 VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L367] int tmp ; [L368] int tmp___0 ; [L369] int tmp___1 ; [L106] int __retres1 ; VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L109] COND TRUE (int )P_1_pc == 1 VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L110] COND TRUE (int )P_1_ev == 1 [L111] __retres1 = 1 VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L121] return (__retres1); VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L373] tmp = is_P_1_triggered() [L375] COND TRUE \read(tmp) [L376] P_1_st = 0 VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L188] int __retres1 ; VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L191] COND TRUE (int )C_1_pc == 1 VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L192] COND FALSE !((int )e == 1) VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L201] COND FALSE !((int )C_1_pc == 2) VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L211] __retres1 = 0 VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L213] return (__retres1); VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L381] tmp___1 = is_C_1_triggered() [L383] COND FALSE !(\read(tmp___1)) VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L352] COND TRUE (int )P_1_ev == 1 [L353] P_1_ev = 2 VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L357] COND TRUE (int )C_1_ev == 1 [L358] C_1_ev = 2 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L404] int tmp ; [L405] int __retres2 ; [L243] int __retres1 ; VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L246] COND TRUE (int )P_1_st == 0 [L247] __retres1 = 1 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L260] return (__retres1); VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L409] tmp = exists_runnable_thread() [L411] COND TRUE \read(tmp) [L412] __retres2 = 0 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L419] return (__retres2); VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L467] tmp___0 = stop_simulation() [L469] COND FALSE !(\read(tmp___0)) VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L437] COND TRUE 1 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L440] kernel_st = 1 [L264] int tmp ; [L265] int tmp___0 ; [L266] int tmp___1 ; [L267] int tmp___2 ; VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L271] COND TRUE 1 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L243] int __retres1 ; VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L246] COND TRUE (int )P_1_st == 0 [L247] __retres1 = 1 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L260] return (__retres1); VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L274] tmp___2 = exists_runnable_thread() [L276] COND TRUE \read(tmp___2) VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L281] COND TRUE (int )P_1_st == 0 [L283] tmp = __VERIFIER_nondet_int() [L285] COND TRUE \read(tmp) [L287] P_1_st = 1 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=1, timer=1] [L74] COND FALSE !((int )P_1_pc == 0) VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=1, timer=1] [L77] COND TRUE (int )P_1_pc == 1 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=1, timer=1] [L85] COND TRUE i < max_loop VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=1, timer=1] [L51] COND FALSE !(i___0 == 0) VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=1, timer=1] [L54] COND TRUE i___0 == 1 [L55] data_1 = c VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=1, timer=1] [L89] num += 1 [L90] P_1_pc = 1 [L91] P_1_st = 2 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L296] COND FALSE !((int )C_1_st == 0) VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L271] COND TRUE 1 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L243] int __retres1 ; VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L246] COND FALSE !((int )P_1_st == 0) VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L250] COND FALSE !((int )C_1_st == 0) [L258] __retres1 = 0 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L260] return (__retres1); VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L274] tmp___2 = exists_runnable_thread() [L276] COND FALSE !(\read(tmp___2)) VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L444] kernel_st = 2 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L448] kernel_st = 3 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L367] int tmp ; [L368] int tmp___0 ; [L369] int tmp___1 ; [L106] int __retres1 ; VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L109] COND TRUE (int )P_1_pc == 1 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L110] COND FALSE !((int )P_1_ev == 1) VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L119] __retres1 = 0 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L121] return (__retres1); VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L373] tmp = is_P_1_triggered() [L375] COND FALSE !(\read(tmp)) VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L188] int __retres1 ; VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L191] COND TRUE (int )C_1_pc == 1 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L192] COND FALSE !((int )e == 1) VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L201] COND FALSE !((int )C_1_pc == 2) VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L211] __retres1 = 0 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L213] return (__retres1); VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L381] tmp___1 = is_C_1_triggered() [L383] COND FALSE !(\read(tmp___1)) VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L243] int __retres1 ; VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L246] COND FALSE !((int )P_1_st == 0) VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L250] COND FALSE !((int )C_1_st == 0) [L258] __retres1 = 0 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L260] return (__retres1); VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L454] tmp = exists_runnable_thread() [L456] COND TRUE tmp == 0 [L458] kernel_st = 4 [L338] C_1_ev = 1 [L340] P_1_ev = 1 VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L367] int tmp ; [L368] int tmp___0 ; [L369] int tmp___1 ; [L106] int __retres1 ; VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L109] COND TRUE (int )P_1_pc == 1 VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L110] COND TRUE (int )P_1_ev == 1 [L111] __retres1 = 1 VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L121] return (__retres1); VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L373] tmp = is_P_1_triggered() [L375] COND TRUE \read(tmp) [L376] P_1_st = 0 VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L188] int __retres1 ; VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L191] COND TRUE (int )C_1_pc == 1 VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L192] COND FALSE !((int )e == 1) VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L201] COND FALSE !((int )C_1_pc == 2) VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L211] __retres1 = 0 VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L213] return (__retres1); VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L381] tmp___1 = is_C_1_triggered() [L383] COND FALSE !(\read(tmp___1)) VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L352] COND TRUE (int )P_1_ev == 1 [L353] P_1_ev = 2 VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L357] COND TRUE (int )C_1_ev == 1 [L358] C_1_ev = 2 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L404] int tmp ; [L405] int __retres2 ; [L243] int __retres1 ; VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L246] COND TRUE (int )P_1_st == 0 [L247] __retres1 = 1 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L260] return (__retres1); VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L409] tmp = exists_runnable_thread() [L411] COND TRUE \read(tmp) [L412] __retres2 = 0 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L419] return (__retres2); VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L467] tmp___0 = stop_simulation() [L469] COND FALSE !(\read(tmp___0)) VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L437] COND TRUE 1 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L440] kernel_st = 1 [L264] int tmp ; [L265] int tmp___0 ; [L266] int tmp___1 ; [L267] int tmp___2 ; VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L271] COND TRUE 1 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L243] int __retres1 ; VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L246] COND TRUE (int )P_1_st == 0 [L247] __retres1 = 1 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L260] return (__retres1); VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L274] tmp___2 = exists_runnable_thread() [L276] COND TRUE \read(tmp___2) VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L281] COND TRUE (int )P_1_st == 0 [L283] tmp = __VERIFIER_nondet_int() [L285] COND TRUE \read(tmp) [L287] P_1_st = 1 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=1, timer=1] [L74] COND FALSE !((int )P_1_pc == 0) VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=1, timer=1] [L77] COND TRUE (int )P_1_pc == 1 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=1, timer=1] [L85] COND TRUE i < max_loop VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=1, timer=1] [L51] COND FALSE !(i___0 == 0) VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=1, timer=1] [L54] COND FALSE !(i___0 == 1) VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=1, timer=1] [L3] __assert_fail("0", "kundu1.cil.c", 3, "reach_error") VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=1, timer=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 120 locations, 3 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 14.2s, OverallIterations: 24, TraceHistogramMax: 6, AutomataDifference: 6.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 4666 SDtfs, 6038 SDslu, 6497 SDs, 0 SdLazy, 689 SolverSat, 176 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 243 GetRequests, 170 SyntacticMatches, 2 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5850occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 5.0s AutomataMinimizationTime, 23 MinimizatonAttempts, 7372 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 1920 NumberOfCodeBlocks, 1920 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 1706 ConstructedInterpolants, 0 QuantifiedInterpolants, 393283 SizeOfPredicates, 3 NumberOfNonLiveVariables, 373 ConjunctsInSsa, 9 ConjunctsInUnsatCore, 24 InterpolantComputations, 22 PerfectInterpolantSequences, 378/448 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 RESULT: Ultimate proved your program to be incorrect! Received shutdown request...