./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/systemc/token_ring.02.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -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/token_ring.02.cil-2.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(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 216b1eba72c80bc0eec8bb9ab0298bf8baf472d8 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-f470102 [2019-11-28 17:31:28,283 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 17:31:28,285 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 17:31:28,298 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 17:31:28,299 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 17:31:28,300 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 17:31:28,302 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 17:31:28,304 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 17:31:28,306 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 17:31:28,308 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 17:31:28,309 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 17:31:28,310 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 17:31:28,311 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 17:31:28,312 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 17:31:28,313 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 17:31:28,314 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 17:31:28,315 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 17:31:28,317 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 17:31:28,319 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 17:31:28,321 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 17:31:28,323 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 17:31:28,325 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 17:31:28,326 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 17:31:28,327 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 17:31:28,330 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 17:31:28,331 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 17:31:28,331 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 17:31:28,332 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 17:31:28,333 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 17:31:28,334 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 17:31:28,334 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 17:31:28,335 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 17:31:28,336 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 17:31:28,337 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 17:31:28,339 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 17:31:28,339 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 17:31:28,340 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 17:31:28,340 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 17:31:28,340 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 17:31:28,341 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 17:31:28,342 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 17:31:28,343 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-28 17:31:28,359 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 17:31:28,359 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 17:31:28,361 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 17:31:28,361 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 17:31:28,361 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 17:31:28,362 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 17:31:28,362 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 17:31:28,362 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 17:31:28,362 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 17:31:28,363 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 17:31:28,363 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 17:31:28,363 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 17:31:28,364 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 17:31:28,364 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 17:31:28,364 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 17:31:28,364 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 17:31:28,365 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 17:31:28,365 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 17:31:28,365 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 17:31:28,366 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 17:31:28,366 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 17:31:28,366 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 17:31:28,367 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 17:31:28,367 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 17:31:28,367 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 17:31:28,367 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 17:31:28,368 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 17:31:28,368 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 17:31:28,368 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 17:31:28,369 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(__VERIFIER_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 -> 216b1eba72c80bc0eec8bb9ab0298bf8baf472d8 [2019-11-28 17:31:28,729 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 17:31:28,743 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 17:31:28,746 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 17:31:28,748 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 17:31:28,749 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 17:31:28,750 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/systemc/token_ring.02.cil-2.c [2019-11-28 17:31:28,812 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2169c36f8/81f961d2a51d48e38c2add3b30cc5a59/FLAG673477a8c [2019-11-28 17:31:29,270 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 17:31:29,274 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/token_ring.02.cil-2.c [2019-11-28 17:31:29,291 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2169c36f8/81f961d2a51d48e38c2add3b30cc5a59/FLAG673477a8c [2019-11-28 17:31:29,652 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2169c36f8/81f961d2a51d48e38c2add3b30cc5a59 [2019-11-28 17:31:29,655 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 17:31:29,656 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 17:31:29,657 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 17:31:29,658 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 17:31:29,661 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 17:31:29,663 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 05:31:29" (1/1) ... [2019-11-28 17:31:29,667 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@600cef8d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:31:29, skipping insertion in model container [2019-11-28 17:31:29,667 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 05:31:29" (1/1) ... [2019-11-28 17:31:29,678 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 17:31:29,738 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 17:31:30,070 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 17:31:30,076 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 17:31:30,175 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 17:31:30,209 INFO L208 MainTranslator]: Completed translation [2019-11-28 17:31:30,209 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:31:30 WrapperNode [2019-11-28 17:31:30,209 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 17:31:30,210 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 17:31:30,210 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 17:31:30,211 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 17:31:30,221 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:31:30" (1/1) ... [2019-11-28 17:31:30,231 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:31:30" (1/1) ... [2019-11-28 17:31:30,281 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 17:31:30,282 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 17:31:30,282 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 17:31:30,282 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 17:31:30,294 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:31:30" (1/1) ... [2019-11-28 17:31:30,294 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:31:30" (1/1) ... [2019-11-28 17:31:30,298 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:31:30" (1/1) ... [2019-11-28 17:31:30,299 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:31:30" (1/1) ... [2019-11-28 17:31:30,309 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:31:30" (1/1) ... [2019-11-28 17:31:30,322 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:31:30" (1/1) ... [2019-11-28 17:31:30,326 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:31:30" (1/1) ... [2019-11-28 17:31:30,338 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 17:31:30,340 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 17:31:30,341 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 17:31:30,341 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 17:31:30,345 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:31:30" (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 [2019-11-28 17:31:30,416 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 17:31:30,416 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 17:31:31,405 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 17:31:31,407 INFO L287 CfgBuilder]: Removed 105 assume(true) statements. [2019-11-28 17:31:31,408 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 05:31:31 BoogieIcfgContainer [2019-11-28 17:31:31,409 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 17:31:31,410 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 17:31:31,410 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 17:31:31,415 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 17:31:31,417 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 05:31:29" (1/3) ... [2019-11-28 17:31:31,418 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3411f9f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 05:31:31, skipping insertion in model container [2019-11-28 17:31:31,419 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:31:30" (2/3) ... [2019-11-28 17:31:31,419 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3411f9f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 05:31:31, skipping insertion in model container [2019-11-28 17:31:31,419 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 05:31:31" (3/3) ... [2019-11-28 17:31:31,421 INFO L109 eAbstractionObserver]: Analyzing ICFG token_ring.02.cil-2.c [2019-11-28 17:31:31,433 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 17:31:31,441 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-11-28 17:31:31,461 INFO L249 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2019-11-28 17:31:31,495 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 17:31:31,495 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 17:31:31,495 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 17:31:31,495 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 17:31:31,496 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 17:31:31,496 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 17:31:31,496 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 17:31:31,496 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 17:31:31,527 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states. [2019-11-28 17:31:31,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-28 17:31:31,542 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:31:31,543 INFO L410 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, 1, 1, 1, 1, 1, 1] [2019-11-28 17:31:31,544 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:31:31,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:31:31,552 INFO L82 PathProgramCache]: Analyzing trace with hash 603110903, now seen corresponding path program 1 times [2019-11-28 17:31:31,562 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:31:31,563 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434285956] [2019-11-28 17:31:31,563 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:31:31,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:31:31,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 17:31:31,743 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434285956] [2019-11-28 17:31:31,744 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:31:31,744 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 17:31:31,747 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139931107] [2019-11-28 17:31:31,753 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 17:31:31,753 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:31:31,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 17:31:31,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 17:31:31,772 INFO L87 Difference]: Start difference. First operand 225 states. Second operand 3 states. [2019-11-28 17:31:31,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:31:31,853 INFO L93 Difference]: Finished difference Result 445 states and 697 transitions. [2019-11-28 17:31:31,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 17:31:31,856 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2019-11-28 17:31:31,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:31:31,882 INFO L225 Difference]: With dead ends: 445 [2019-11-28 17:31:31,883 INFO L226 Difference]: Without dead ends: 221 [2019-11-28 17:31:31,892 INFO L630 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 [2019-11-28 17:31:31,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2019-11-28 17:31:31,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 221. [2019-11-28 17:31:31,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2019-11-28 17:31:32,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 335 transitions. [2019-11-28 17:31:32,010 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 335 transitions. Word has length 50 [2019-11-28 17:31:32,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:31:32,015 INFO L462 AbstractCegarLoop]: Abstraction has 221 states and 335 transitions. [2019-11-28 17:31:32,016 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 17:31:32,016 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 335 transitions. [2019-11-28 17:31:32,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-28 17:31:32,020 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:31:32,021 INFO L410 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, 1, 1, 1, 1, 1, 1] [2019-11-28 17:31:32,022 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:31:32,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:31:32,023 INFO L82 PathProgramCache]: Analyzing trace with hash -1325161799, now seen corresponding path program 1 times [2019-11-28 17:31:32,023 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:31:32,024 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318177542] [2019-11-28 17:31:32,024 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:31:32,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:31:32,084 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 17:31:32,084 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318177542] [2019-11-28 17:31:32,084 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:31:32,085 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 17:31:32,085 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260066412] [2019-11-28 17:31:32,089 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 17:31:32,089 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:31:32,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 17:31:32,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 17:31:32,094 INFO L87 Difference]: Start difference. First operand 221 states and 335 transitions. Second operand 3 states. [2019-11-28 17:31:32,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:31:32,169 INFO L93 Difference]: Finished difference Result 595 states and 901 transitions. [2019-11-28 17:31:32,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 17:31:32,170 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2019-11-28 17:31:32,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:31:32,174 INFO L225 Difference]: With dead ends: 595 [2019-11-28 17:31:32,174 INFO L226 Difference]: Without dead ends: 381 [2019-11-28 17:31:32,177 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 17:31:32,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2019-11-28 17:31:32,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 377. [2019-11-28 17:31:32,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2019-11-28 17:31:32,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 570 transitions. [2019-11-28 17:31:32,212 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 570 transitions. Word has length 50 [2019-11-28 17:31:32,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:31:32,213 INFO L462 AbstractCegarLoop]: Abstraction has 377 states and 570 transitions. [2019-11-28 17:31:32,213 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 17:31:32,213 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 570 transitions. [2019-11-28 17:31:32,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-28 17:31:32,215 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:31:32,215 INFO L410 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, 1, 1, 1, 1, 1, 1] [2019-11-28 17:31:32,215 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:31:32,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:31:32,216 INFO L82 PathProgramCache]: Analyzing trace with hash 102769205, now seen corresponding path program 1 times [2019-11-28 17:31:32,216 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:31:32,217 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098345926] [2019-11-28 17:31:32,217 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:31:32,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:31:32,278 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 17:31:32,279 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098345926] [2019-11-28 17:31:32,279 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:31:32,279 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 17:31:32,279 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226791548] [2019-11-28 17:31:32,280 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 17:31:32,280 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:31:32,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 17:31:32,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 17:31:32,281 INFO L87 Difference]: Start difference. First operand 377 states and 570 transitions. Second operand 3 states. [2019-11-28 17:31:32,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:31:32,326 INFO L93 Difference]: Finished difference Result 746 states and 1129 transitions. [2019-11-28 17:31:32,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 17:31:32,327 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2019-11-28 17:31:32,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:31:32,330 INFO L225 Difference]: With dead ends: 746 [2019-11-28 17:31:32,330 INFO L226 Difference]: Without dead ends: 377 [2019-11-28 17:31:32,333 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 17:31:32,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2019-11-28 17:31:32,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 377. [2019-11-28 17:31:32,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2019-11-28 17:31:32,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 562 transitions. [2019-11-28 17:31:32,360 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 562 transitions. Word has length 50 [2019-11-28 17:31:32,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:31:32,360 INFO L462 AbstractCegarLoop]: Abstraction has 377 states and 562 transitions. [2019-11-28 17:31:32,360 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 17:31:32,361 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 562 transitions. [2019-11-28 17:31:32,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-28 17:31:32,362 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:31:32,363 INFO L410 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, 1, 1, 1, 1, 1, 1] [2019-11-28 17:31:32,363 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:31:32,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:31:32,363 INFO L82 PathProgramCache]: Analyzing trace with hash 1811399481, now seen corresponding path program 1 times [2019-11-28 17:31:32,364 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:31:32,364 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991949545] [2019-11-28 17:31:32,364 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:31:32,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:31:32,425 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 17:31:32,426 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991949545] [2019-11-28 17:31:32,426 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:31:32,426 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 17:31:32,427 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096177481] [2019-11-28 17:31:32,427 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 17:31:32,427 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:31:32,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 17:31:32,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 17:31:32,429 INFO L87 Difference]: Start difference. First operand 377 states and 562 transitions. Second operand 3 states. [2019-11-28 17:31:32,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:31:32,468 INFO L93 Difference]: Finished difference Result 745 states and 1112 transitions. [2019-11-28 17:31:32,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 17:31:32,469 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2019-11-28 17:31:32,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:31:32,472 INFO L225 Difference]: With dead ends: 745 [2019-11-28 17:31:32,472 INFO L226 Difference]: Without dead ends: 377 [2019-11-28 17:31:32,474 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 17:31:32,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2019-11-28 17:31:32,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 377. [2019-11-28 17:31:32,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2019-11-28 17:31:32,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 554 transitions. [2019-11-28 17:31:32,504 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 554 transitions. Word has length 50 [2019-11-28 17:31:32,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:31:32,504 INFO L462 AbstractCegarLoop]: Abstraction has 377 states and 554 transitions. [2019-11-28 17:31:32,504 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 17:31:32,505 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 554 transitions. [2019-11-28 17:31:32,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-28 17:31:32,513 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:31:32,513 INFO L410 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, 1, 1, 1, 1, 1, 1] [2019-11-28 17:31:32,514 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:31:32,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:31:32,514 INFO L82 PathProgramCache]: Analyzing trace with hash 65401269, now seen corresponding path program 1 times [2019-11-28 17:31:32,514 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:31:32,514 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973984899] [2019-11-28 17:31:32,515 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:31:32,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:31:32,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 17:31:32,587 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973984899] [2019-11-28 17:31:32,588 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:31:32,588 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 17:31:32,589 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405563005] [2019-11-28 17:31:32,589 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 17:31:32,589 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:31:32,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 17:31:32,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 17:31:32,590 INFO L87 Difference]: Start difference. First operand 377 states and 554 transitions. Second operand 3 states. [2019-11-28 17:31:32,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:31:32,663 INFO L93 Difference]: Finished difference Result 744 states and 1095 transitions. [2019-11-28 17:31:32,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 17:31:32,664 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2019-11-28 17:31:32,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:31:32,666 INFO L225 Difference]: With dead ends: 744 [2019-11-28 17:31:32,667 INFO L226 Difference]: Without dead ends: 377 [2019-11-28 17:31:32,668 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 17:31:32,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2019-11-28 17:31:32,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 377. [2019-11-28 17:31:32,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2019-11-28 17:31:32,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 538 transitions. [2019-11-28 17:31:32,690 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 538 transitions. Word has length 50 [2019-11-28 17:31:32,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:31:32,690 INFO L462 AbstractCegarLoop]: Abstraction has 377 states and 538 transitions. [2019-11-28 17:31:32,690 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 17:31:32,690 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 538 transitions. [2019-11-28 17:31:32,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-28 17:31:32,691 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:31:32,692 INFO L410 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, 1, 1, 1, 1, 1, 1] [2019-11-28 17:31:32,692 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:31:32,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:31:32,692 INFO L82 PathProgramCache]: Analyzing trace with hash 25960058, now seen corresponding path program 1 times [2019-11-28 17:31:32,693 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:31:32,693 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717747393] [2019-11-28 17:31:32,693 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:31:32,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:31:32,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 17:31:32,734 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717747393] [2019-11-28 17:31:32,734 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:31:32,734 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 17:31:32,736 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788760553] [2019-11-28 17:31:32,736 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 17:31:32,736 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:31:32,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 17:31:32,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 17:31:32,737 INFO L87 Difference]: Start difference. First operand 377 states and 538 transitions. Second operand 3 states. [2019-11-28 17:31:32,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:31:32,805 INFO L93 Difference]: Finished difference Result 743 states and 1062 transitions. [2019-11-28 17:31:32,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 17:31:32,806 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2019-11-28 17:31:32,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:31:32,809 INFO L225 Difference]: With dead ends: 743 [2019-11-28 17:31:32,810 INFO L226 Difference]: Without dead ends: 377 [2019-11-28 17:31:32,812 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 17:31:32,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2019-11-28 17:31:32,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 377. [2019-11-28 17:31:32,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2019-11-28 17:31:32,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 522 transitions. [2019-11-28 17:31:32,836 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 522 transitions. Word has length 50 [2019-11-28 17:31:32,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:31:32,838 INFO L462 AbstractCegarLoop]: Abstraction has 377 states and 522 transitions. [2019-11-28 17:31:32,838 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 17:31:32,839 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 522 transitions. [2019-11-28 17:31:32,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-28 17:31:32,840 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:31:32,840 INFO L410 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, 1, 1, 1, 1, 1, 1] [2019-11-28 17:31:32,841 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:31:32,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:31:32,841 INFO L82 PathProgramCache]: Analyzing trace with hash 1177649081, now seen corresponding path program 1 times [2019-11-28 17:31:32,841 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:31:32,842 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478132042] [2019-11-28 17:31:32,842 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:31:32,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:31:32,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 17:31:32,895 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478132042] [2019-11-28 17:31:32,895 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:31:32,895 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 17:31:32,896 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048560073] [2019-11-28 17:31:32,897 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 17:31:32,904 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:31:32,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 17:31:32,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 17:31:32,906 INFO L87 Difference]: Start difference. First operand 377 states and 522 transitions. Second operand 3 states. [2019-11-28 17:31:32,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:31:32,971 INFO L93 Difference]: Finished difference Result 742 states and 1029 transitions. [2019-11-28 17:31:32,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 17:31:32,973 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2019-11-28 17:31:32,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:31:32,975 INFO L225 Difference]: With dead ends: 742 [2019-11-28 17:31:32,976 INFO L226 Difference]: Without dead ends: 377 [2019-11-28 17:31:32,977 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 17:31:32,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2019-11-28 17:31:32,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 377. [2019-11-28 17:31:32,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2019-11-28 17:31:33,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 506 transitions. [2019-11-28 17:31:33,001 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 506 transitions. Word has length 50 [2019-11-28 17:31:33,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:31:33,002 INFO L462 AbstractCegarLoop]: Abstraction has 377 states and 506 transitions. [2019-11-28 17:31:33,002 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 17:31:33,002 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 506 transitions. [2019-11-28 17:31:33,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-28 17:31:33,004 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:31:33,004 INFO L410 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, 1, 1, 1, 1, 1, 1] [2019-11-28 17:31:33,005 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:31:33,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:31:33,005 INFO L82 PathProgramCache]: Analyzing trace with hash -1947581763, now seen corresponding path program 1 times [2019-11-28 17:31:33,006 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:31:33,007 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159674785] [2019-11-28 17:31:33,007 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:31:33,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:31:33,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 17:31:33,112 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159674785] [2019-11-28 17:31:33,114 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:31:33,114 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 17:31:33,114 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91838213] [2019-11-28 17:31:33,115 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 17:31:33,115 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:31:33,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 17:31:33,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 17:31:33,116 INFO L87 Difference]: Start difference. First operand 377 states and 506 transitions. Second operand 3 states. [2019-11-28 17:31:33,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:31:33,197 INFO L93 Difference]: Finished difference Result 1050 states and 1412 transitions. [2019-11-28 17:31:33,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 17:31:33,198 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2019-11-28 17:31:33,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:31:33,202 INFO L225 Difference]: With dead ends: 1050 [2019-11-28 17:31:33,202 INFO L226 Difference]: Without dead ends: 687 [2019-11-28 17:31:33,203 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 17:31:33,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 687 states. [2019-11-28 17:31:33,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 687 to 649. [2019-11-28 17:31:33,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 649 states. [2019-11-28 17:31:33,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 649 states to 649 states and 861 transitions. [2019-11-28 17:31:33,238 INFO L78 Accepts]: Start accepts. Automaton has 649 states and 861 transitions. Word has length 50 [2019-11-28 17:31:33,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:31:33,239 INFO L462 AbstractCegarLoop]: Abstraction has 649 states and 861 transitions. [2019-11-28 17:31:33,239 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 17:31:33,239 INFO L276 IsEmpty]: Start isEmpty. Operand 649 states and 861 transitions. [2019-11-28 17:31:33,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-11-28 17:31:33,240 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:31:33,241 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-28 17:31:33,241 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:31:33,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:31:33,241 INFO L82 PathProgramCache]: Analyzing trace with hash 647371149, now seen corresponding path program 1 times [2019-11-28 17:31:33,242 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:31:33,242 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636556642] [2019-11-28 17:31:33,242 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:31:33,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:31:33,318 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 17:31:33,319 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636556642] [2019-11-28 17:31:33,319 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:31:33,320 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 17:31:33,324 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809314781] [2019-11-28 17:31:33,325 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 17:31:33,326 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:31:33,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 17:31:33,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 17:31:33,328 INFO L87 Difference]: Start difference. First operand 649 states and 861 transitions. Second operand 5 states. [2019-11-28 17:31:33,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:31:33,506 INFO L93 Difference]: Finished difference Result 1534 states and 2059 transitions. [2019-11-28 17:31:33,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 17:31:33,507 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 81 [2019-11-28 17:31:33,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:31:33,513 INFO L225 Difference]: With dead ends: 1534 [2019-11-28 17:31:33,514 INFO L226 Difference]: Without dead ends: 903 [2019-11-28 17:31:33,516 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-28 17:31:33,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 903 states. [2019-11-28 17:31:33,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 903 to 655. [2019-11-28 17:31:33,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 655 states. [2019-11-28 17:31:33,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 852 transitions. [2019-11-28 17:31:33,597 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 852 transitions. Word has length 81 [2019-11-28 17:31:33,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:31:33,598 INFO L462 AbstractCegarLoop]: Abstraction has 655 states and 852 transitions. [2019-11-28 17:31:33,598 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 17:31:33,598 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 852 transitions. [2019-11-28 17:31:33,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-11-28 17:31:33,600 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:31:33,600 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-28 17:31:33,600 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:31:33,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:31:33,601 INFO L82 PathProgramCache]: Analyzing trace with hash 83505161, now seen corresponding path program 1 times [2019-11-28 17:31:33,601 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:31:33,602 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896879819] [2019-11-28 17:31:33,602 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:31:33,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:31:33,662 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 17:31:33,663 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896879819] [2019-11-28 17:31:33,663 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:31:33,663 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 17:31:33,663 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962629766] [2019-11-28 17:31:33,664 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 17:31:33,664 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:31:33,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 17:31:33,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 17:31:33,665 INFO L87 Difference]: Start difference. First operand 655 states and 852 transitions. Second operand 5 states. [2019-11-28 17:31:33,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:31:33,840 INFO L93 Difference]: Finished difference Result 1575 states and 2073 transitions. [2019-11-28 17:31:33,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 17:31:33,841 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 81 [2019-11-28 17:31:33,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:31:33,847 INFO L225 Difference]: With dead ends: 1575 [2019-11-28 17:31:33,848 INFO L226 Difference]: Without dead ends: 945 [2019-11-28 17:31:33,850 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-28 17:31:33,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 945 states. [2019-11-28 17:31:33,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 945 to 661. [2019-11-28 17:31:33,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 661 states. [2019-11-28 17:31:33,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 661 states to 661 states and 843 transitions. [2019-11-28 17:31:33,898 INFO L78 Accepts]: Start accepts. Automaton has 661 states and 843 transitions. Word has length 81 [2019-11-28 17:31:33,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:31:33,900 INFO L462 AbstractCegarLoop]: Abstraction has 661 states and 843 transitions. [2019-11-28 17:31:33,900 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 17:31:33,900 INFO L276 IsEmpty]: Start isEmpty. Operand 661 states and 843 transitions. [2019-11-28 17:31:33,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-11-28 17:31:33,902 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:31:33,902 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-28 17:31:33,902 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:31:33,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:31:33,903 INFO L82 PathProgramCache]: Analyzing trace with hash 736088965, now seen corresponding path program 1 times [2019-11-28 17:31:33,903 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:31:33,903 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839569788] [2019-11-28 17:31:33,903 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:31:33,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:31:33,970 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 17:31:33,970 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839569788] [2019-11-28 17:31:33,971 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:31:33,971 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 17:31:33,971 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252071486] [2019-11-28 17:31:33,972 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 17:31:33,972 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:31:33,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 17:31:33,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 17:31:33,972 INFO L87 Difference]: Start difference. First operand 661 states and 843 transitions. Second operand 5 states. [2019-11-28 17:31:34,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:31:34,144 INFO L93 Difference]: Finished difference Result 1838 states and 2375 transitions. [2019-11-28 17:31:34,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 17:31:34,145 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 81 [2019-11-28 17:31:34,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:31:34,152 INFO L225 Difference]: With dead ends: 1838 [2019-11-28 17:31:34,152 INFO L226 Difference]: Without dead ends: 1209 [2019-11-28 17:31:34,155 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-28 17:31:34,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1209 states. [2019-11-28 17:31:34,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1209 to 673. [2019-11-28 17:31:34,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 673 states. [2019-11-28 17:31:34,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 673 states to 673 states and 842 transitions. [2019-11-28 17:31:34,208 INFO L78 Accepts]: Start accepts. Automaton has 673 states and 842 transitions. Word has length 81 [2019-11-28 17:31:34,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:31:34,209 INFO L462 AbstractCegarLoop]: Abstraction has 673 states and 842 transitions. [2019-11-28 17:31:34,209 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 17:31:34,209 INFO L276 IsEmpty]: Start isEmpty. Operand 673 states and 842 transitions. [2019-11-28 17:31:34,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-11-28 17:31:34,210 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:31:34,210 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-28 17:31:34,212 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:31:34,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:31:34,212 INFO L82 PathProgramCache]: Analyzing trace with hash -284979389, now seen corresponding path program 1 times [2019-11-28 17:31:34,212 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:31:34,213 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482195914] [2019-11-28 17:31:34,213 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:31:34,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:31:34,267 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 17:31:34,268 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482195914] [2019-11-28 17:31:34,268 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:31:34,268 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 17:31:34,268 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977931675] [2019-11-28 17:31:34,269 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 17:31:34,269 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:31:34,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 17:31:34,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 17:31:34,270 INFO L87 Difference]: Start difference. First operand 673 states and 842 transitions. Second operand 3 states. [2019-11-28 17:31:34,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:31:34,367 INFO L93 Difference]: Finished difference Result 1813 states and 2270 transitions. [2019-11-28 17:31:34,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 17:31:34,367 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 81 [2019-11-28 17:31:34,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:31:34,374 INFO L225 Difference]: With dead ends: 1813 [2019-11-28 17:31:34,374 INFO L226 Difference]: Without dead ends: 1178 [2019-11-28 17:31:34,375 INFO L630 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 [2019-11-28 17:31:34,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1178 states. [2019-11-28 17:31:34,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1178 to 1174. [2019-11-28 17:31:34,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1174 states. [2019-11-28 17:31:34,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1174 states to 1174 states and 1452 transitions. [2019-11-28 17:31:34,461 INFO L78 Accepts]: Start accepts. Automaton has 1174 states and 1452 transitions. Word has length 81 [2019-11-28 17:31:34,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:31:34,463 INFO L462 AbstractCegarLoop]: Abstraction has 1174 states and 1452 transitions. [2019-11-28 17:31:34,463 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 17:31:34,463 INFO L276 IsEmpty]: Start isEmpty. Operand 1174 states and 1452 transitions. [2019-11-28 17:31:34,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-11-28 17:31:34,465 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:31:34,465 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-28 17:31:34,465 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:31:34,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:31:34,466 INFO L82 PathProgramCache]: Analyzing trace with hash 206796516, now seen corresponding path program 1 times [2019-11-28 17:31:34,466 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:31:34,466 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782836460] [2019-11-28 17:31:34,467 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:31:34,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:31:34,542 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 17:31:34,542 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782836460] [2019-11-28 17:31:34,543 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:31:34,543 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 17:31:34,543 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111029446] [2019-11-28 17:31:34,543 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 17:31:34,544 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:31:34,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 17:31:34,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 17:31:34,544 INFO L87 Difference]: Start difference. First operand 1174 states and 1452 transitions. Second operand 3 states. [2019-11-28 17:31:34,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:31:34,688 INFO L93 Difference]: Finished difference Result 3254 states and 4030 transitions. [2019-11-28 17:31:34,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 17:31:34,688 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 82 [2019-11-28 17:31:34,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:31:34,698 INFO L225 Difference]: With dead ends: 3254 [2019-11-28 17:31:34,698 INFO L226 Difference]: Without dead ends: 2118 [2019-11-28 17:31:34,701 INFO L630 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 [2019-11-28 17:31:34,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2118 states. [2019-11-28 17:31:34,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2118 to 2114. [2019-11-28 17:31:34,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2114 states. [2019-11-28 17:31:34,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2114 states to 2114 states and 2598 transitions. [2019-11-28 17:31:34,872 INFO L78 Accepts]: Start accepts. Automaton has 2114 states and 2598 transitions. Word has length 82 [2019-11-28 17:31:34,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:31:34,873 INFO L462 AbstractCegarLoop]: Abstraction has 2114 states and 2598 transitions. [2019-11-28 17:31:34,873 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 17:31:34,873 INFO L276 IsEmpty]: Start isEmpty. Operand 2114 states and 2598 transitions. [2019-11-28 17:31:34,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-11-28 17:31:34,876 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:31:34,876 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-28 17:31:34,877 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:31:34,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:31:34,877 INFO L82 PathProgramCache]: Analyzing trace with hash 233862118, now seen corresponding path program 1 times [2019-11-28 17:31:34,877 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:31:34,882 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204214882] [2019-11-28 17:31:34,883 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:31:34,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:31:34,906 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-11-28 17:31:34,906 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204214882] [2019-11-28 17:31:34,907 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:31:34,908 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 17:31:34,908 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191046428] [2019-11-28 17:31:34,909 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 17:31:34,909 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:31:34,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 17:31:34,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 17:31:34,910 INFO L87 Difference]: Start difference. First operand 2114 states and 2598 transitions. Second operand 3 states. [2019-11-28 17:31:35,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:31:35,062 INFO L93 Difference]: Finished difference Result 4158 states and 5120 transitions. [2019-11-28 17:31:35,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 17:31:35,063 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 82 [2019-11-28 17:31:35,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:31:35,073 INFO L225 Difference]: With dead ends: 4158 [2019-11-28 17:31:35,073 INFO L226 Difference]: Without dead ends: 2082 [2019-11-28 17:31:35,079 INFO L630 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 [2019-11-28 17:31:35,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2082 states. [2019-11-28 17:31:35,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2082 to 2082. [2019-11-28 17:31:35,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2082 states. [2019-11-28 17:31:35,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2082 states to 2082 states and 2563 transitions. [2019-11-28 17:31:35,232 INFO L78 Accepts]: Start accepts. Automaton has 2082 states and 2563 transitions. Word has length 82 [2019-11-28 17:31:35,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:31:35,232 INFO L462 AbstractCegarLoop]: Abstraction has 2082 states and 2563 transitions. [2019-11-28 17:31:35,232 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 17:31:35,233 INFO L276 IsEmpty]: Start isEmpty. Operand 2082 states and 2563 transitions. [2019-11-28 17:31:35,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-11-28 17:31:35,235 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:31:35,235 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-28 17:31:35,236 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:31:35,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:31:35,236 INFO L82 PathProgramCache]: Analyzing trace with hash 794948131, now seen corresponding path program 1 times [2019-11-28 17:31:35,236 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:31:35,237 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932801672] [2019-11-28 17:31:35,237 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:31:35,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:31:35,293 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 17:31:35,295 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932801672] [2019-11-28 17:31:35,295 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:31:35,295 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 17:31:35,295 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299347644] [2019-11-28 17:31:35,296 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 17:31:35,296 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:31:35,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 17:31:35,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 17:31:35,297 INFO L87 Difference]: Start difference. First operand 2082 states and 2563 transitions. Second operand 3 states. [2019-11-28 17:31:35,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:31:35,545 INFO L93 Difference]: Finished difference Result 5880 states and 7201 transitions. [2019-11-28 17:31:35,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 17:31:35,546 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2019-11-28 17:31:35,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:31:35,561 INFO L225 Difference]: With dead ends: 5880 [2019-11-28 17:31:35,561 INFO L226 Difference]: Without dead ends: 2958 [2019-11-28 17:31:35,568 INFO L630 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 [2019-11-28 17:31:35,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2958 states. [2019-11-28 17:31:35,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2958 to 2958. [2019-11-28 17:31:35,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2958 states. [2019-11-28 17:31:35,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2958 states to 2958 states and 3600 transitions. [2019-11-28 17:31:35,786 INFO L78 Accepts]: Start accepts. Automaton has 2958 states and 3600 transitions. Word has length 83 [2019-11-28 17:31:35,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:31:35,786 INFO L462 AbstractCegarLoop]: Abstraction has 2958 states and 3600 transitions. [2019-11-28 17:31:35,787 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 17:31:35,787 INFO L276 IsEmpty]: Start isEmpty. Operand 2958 states and 3600 transitions. [2019-11-28 17:31:35,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-11-28 17:31:35,791 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:31:35,792 INFO L410 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1] [2019-11-28 17:31:35,792 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:31:35,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:31:35,793 INFO L82 PathProgramCache]: Analyzing trace with hash -471564153, now seen corresponding path program 1 times [2019-11-28 17:31:35,793 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:31:35,794 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874334839] [2019-11-28 17:31:35,794 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:31:35,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:31:35,862 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 17:31:35,862 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874334839] [2019-11-28 17:31:35,865 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:31:35,865 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 17:31:35,865 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426174532] [2019-11-28 17:31:35,866 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 17:31:35,866 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:31:35,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 17:31:35,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 17:31:35,867 INFO L87 Difference]: Start difference. First operand 2958 states and 3600 transitions. Second operand 3 states. [2019-11-28 17:31:36,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:31:36,158 INFO L93 Difference]: Finished difference Result 6752 states and 8190 transitions. [2019-11-28 17:31:36,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 17:31:36,158 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 106 [2019-11-28 17:31:36,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:31:36,180 INFO L225 Difference]: With dead ends: 6752 [2019-11-28 17:31:36,180 INFO L226 Difference]: Without dead ends: 3821 [2019-11-28 17:31:36,186 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 17:31:36,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3821 states. [2019-11-28 17:31:36,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3821 to 3797. [2019-11-28 17:31:36,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3797 states. [2019-11-28 17:31:36,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3797 states to 3797 states and 4566 transitions. [2019-11-28 17:31:36,451 INFO L78 Accepts]: Start accepts. Automaton has 3797 states and 4566 transitions. Word has length 106 [2019-11-28 17:31:36,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:31:36,452 INFO L462 AbstractCegarLoop]: Abstraction has 3797 states and 4566 transitions. [2019-11-28 17:31:36,452 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 17:31:36,452 INFO L276 IsEmpty]: Start isEmpty. Operand 3797 states and 4566 transitions. [2019-11-28 17:31:36,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-11-28 17:31:36,457 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:31:36,457 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 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] [2019-11-28 17:31:36,457 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:31:36,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:31:36,458 INFO L82 PathProgramCache]: Analyzing trace with hash -264530006, now seen corresponding path program 1 times [2019-11-28 17:31:36,458 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:31:36,458 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798194618] [2019-11-28 17:31:36,459 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:31:36,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:31:36,503 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-11-28 17:31:36,503 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798194618] [2019-11-28 17:31:36,503 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:31:36,504 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 17:31:36,504 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631059384] [2019-11-28 17:31:36,505 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 17:31:36,505 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:31:36,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 17:31:36,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 17:31:36,506 INFO L87 Difference]: Start difference. First operand 3797 states and 4566 transitions. Second operand 3 states. [2019-11-28 17:31:36,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:31:36,747 INFO L93 Difference]: Finished difference Result 7467 states and 8962 transitions. [2019-11-28 17:31:36,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 17:31:36,748 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 120 [2019-11-28 17:31:36,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:31:36,766 INFO L225 Difference]: With dead ends: 7467 [2019-11-28 17:31:36,766 INFO L226 Difference]: Without dead ends: 3707 [2019-11-28 17:31:36,773 INFO L630 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 [2019-11-28 17:31:36,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3707 states. [2019-11-28 17:31:36,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3707 to 3707. [2019-11-28 17:31:36,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3707 states. [2019-11-28 17:31:36,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3707 states to 3707 states and 4354 transitions. [2019-11-28 17:31:36,992 INFO L78 Accepts]: Start accepts. Automaton has 3707 states and 4354 transitions. Word has length 120 [2019-11-28 17:31:36,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:31:36,993 INFO L462 AbstractCegarLoop]: Abstraction has 3707 states and 4354 transitions. [2019-11-28 17:31:36,993 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 17:31:36,993 INFO L276 IsEmpty]: Start isEmpty. Operand 3707 states and 4354 transitions. [2019-11-28 17:31:36,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-11-28 17:31:36,998 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:31:36,999 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:31:36,999 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:31:37,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:31:37,000 INFO L82 PathProgramCache]: Analyzing trace with hash 1818985301, now seen corresponding path program 1 times [2019-11-28 17:31:37,000 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:31:37,001 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407506774] [2019-11-28 17:31:37,001 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:31:37,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:31:37,058 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 17:31:37,059 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407506774] [2019-11-28 17:31:37,059 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:31:37,060 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 17:31:37,060 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746724511] [2019-11-28 17:31:37,060 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 17:31:37,061 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:31:37,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 17:31:37,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 17:31:37,061 INFO L87 Difference]: Start difference. First operand 3707 states and 4354 transitions. Second operand 3 states. [2019-11-28 17:31:37,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:31:37,318 INFO L93 Difference]: Finished difference Result 6571 states and 7758 transitions. [2019-11-28 17:31:37,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 17:31:37,318 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 121 [2019-11-28 17:31:37,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:31:37,335 INFO L225 Difference]: With dead ends: 6571 [2019-11-28 17:31:37,335 INFO L226 Difference]: Without dead ends: 3723 [2019-11-28 17:31:37,339 INFO L630 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 [2019-11-28 17:31:37,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3723 states. [2019-11-28 17:31:37,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3723 to 3707. [2019-11-28 17:31:37,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3707 states. [2019-11-28 17:31:37,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3707 states to 3707 states and 4262 transitions. [2019-11-28 17:31:37,624 INFO L78 Accepts]: Start accepts. Automaton has 3707 states and 4262 transitions. Word has length 121 [2019-11-28 17:31:37,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:31:37,625 INFO L462 AbstractCegarLoop]: Abstraction has 3707 states and 4262 transitions. [2019-11-28 17:31:37,625 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 17:31:37,626 INFO L276 IsEmpty]: Start isEmpty. Operand 3707 states and 4262 transitions. [2019-11-28 17:31:37,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-11-28 17:31:37,632 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:31:37,632 INFO L410 BasicCegarLoop]: trace histogram [3, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:31:37,633 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:31:37,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:31:37,633 INFO L82 PathProgramCache]: Analyzing trace with hash -654472485, now seen corresponding path program 1 times [2019-11-28 17:31:37,634 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:31:37,634 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732149484] [2019-11-28 17:31:37,634 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:31:37,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:31:37,680 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 17:31:37,680 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732149484] [2019-11-28 17:31:37,681 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:31:37,681 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 17:31:37,681 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335349867] [2019-11-28 17:31:37,682 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 17:31:37,683 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:31:37,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 17:31:37,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 17:31:37,683 INFO L87 Difference]: Start difference. First operand 3707 states and 4262 transitions. Second operand 3 states. [2019-11-28 17:31:37,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:31:37,939 INFO L93 Difference]: Finished difference Result 6559 states and 7560 transitions. [2019-11-28 17:31:37,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 17:31:37,939 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 122 [2019-11-28 17:31:37,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:31:37,981 INFO L225 Difference]: With dead ends: 6559 [2019-11-28 17:31:37,987 INFO L226 Difference]: Without dead ends: 3711 [2019-11-28 17:31:37,993 INFO L630 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 [2019-11-28 17:31:38,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3711 states. [2019-11-28 17:31:38,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3711 to 3707. [2019-11-28 17:31:38,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3707 states. [2019-11-28 17:31:38,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3707 states to 3707 states and 4244 transitions. [2019-11-28 17:31:38,219 INFO L78 Accepts]: Start accepts. Automaton has 3707 states and 4244 transitions. Word has length 122 [2019-11-28 17:31:38,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:31:38,220 INFO L462 AbstractCegarLoop]: Abstraction has 3707 states and 4244 transitions. [2019-11-28 17:31:38,220 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 17:31:38,220 INFO L276 IsEmpty]: Start isEmpty. Operand 3707 states and 4244 transitions. [2019-11-28 17:31:38,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-11-28 17:31:38,225 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:31:38,225 INFO L410 BasicCegarLoop]: trace histogram [3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:31:38,226 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:31:38,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:31:38,226 INFO L82 PathProgramCache]: Analyzing trace with hash -1028326263, now seen corresponding path program 1 times [2019-11-28 17:31:38,227 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:31:38,227 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668168006] [2019-11-28 17:31:38,227 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:31:38,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:31:38,276 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-11-28 17:31:38,277 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668168006] [2019-11-28 17:31:38,277 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:31:38,277 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 17:31:38,278 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003563119] [2019-11-28 17:31:38,278 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 17:31:38,278 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:31:38,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 17:31:38,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 17:31:38,279 INFO L87 Difference]: Start difference. First operand 3707 states and 4244 transitions. Second operand 3 states. [2019-11-28 17:31:38,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:31:38,579 INFO L93 Difference]: Finished difference Result 8135 states and 9290 transitions. [2019-11-28 17:31:38,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 17:31:38,580 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 145 [2019-11-28 17:31:38,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:31:38,592 INFO L225 Difference]: With dead ends: 8135 [2019-11-28 17:31:38,592 INFO L226 Difference]: Without dead ends: 4448 [2019-11-28 17:31:38,599 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 17:31:38,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4448 states. [2019-11-28 17:31:38,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4448 to 4416. [2019-11-28 17:31:38,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4416 states. [2019-11-28 17:31:38,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4416 states to 4416 states and 5010 transitions. [2019-11-28 17:31:38,968 INFO L78 Accepts]: Start accepts. Automaton has 4416 states and 5010 transitions. Word has length 145 [2019-11-28 17:31:38,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:31:38,968 INFO L462 AbstractCegarLoop]: Abstraction has 4416 states and 5010 transitions. [2019-11-28 17:31:38,969 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 17:31:38,969 INFO L276 IsEmpty]: Start isEmpty. Operand 4416 states and 5010 transitions. [2019-11-28 17:31:38,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-11-28 17:31:38,978 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:31:38,978 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:31:38,979 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:31:38,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:31:38,979 INFO L82 PathProgramCache]: Analyzing trace with hash 1098265157, now seen corresponding path program 1 times [2019-11-28 17:31:38,980 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:31:38,980 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012348776] [2019-11-28 17:31:38,981 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:31:38,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:31:39,047 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-28 17:31:39,048 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012348776] [2019-11-28 17:31:39,048 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:31:39,048 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 17:31:39,049 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470673264] [2019-11-28 17:31:39,049 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 17:31:39,050 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:31:39,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 17:31:39,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 17:31:39,051 INFO L87 Difference]: Start difference. First operand 4416 states and 5010 transitions. Second operand 3 states. [2019-11-28 17:31:39,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:31:39,202 INFO L93 Difference]: Finished difference Result 6055 states and 6869 transitions. [2019-11-28 17:31:39,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 17:31:39,203 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 148 [2019-11-28 17:31:39,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:31:39,206 INFO L225 Difference]: With dead ends: 6055 [2019-11-28 17:31:39,206 INFO L226 Difference]: Without dead ends: 1503 [2019-11-28 17:31:39,213 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 17:31:39,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1503 states. [2019-11-28 17:31:39,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1503 to 1503. [2019-11-28 17:31:39,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1503 states. [2019-11-28 17:31:39,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1503 states to 1503 states and 1647 transitions. [2019-11-28 17:31:39,292 INFO L78 Accepts]: Start accepts. Automaton has 1503 states and 1647 transitions. Word has length 148 [2019-11-28 17:31:39,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:31:39,292 INFO L462 AbstractCegarLoop]: Abstraction has 1503 states and 1647 transitions. [2019-11-28 17:31:39,292 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 17:31:39,293 INFO L276 IsEmpty]: Start isEmpty. Operand 1503 states and 1647 transitions. [2019-11-28 17:31:39,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-11-28 17:31:39,295 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:31:39,296 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:31:39,296 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:31:39,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:31:39,297 INFO L82 PathProgramCache]: Analyzing trace with hash -2040513564, now seen corresponding path program 1 times [2019-11-28 17:31:39,297 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:31:39,297 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714618582] [2019-11-28 17:31:39,297 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:31:39,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:31:39,346 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-28 17:31:39,346 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714618582] [2019-11-28 17:31:39,347 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:31:39,347 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 17:31:39,347 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758613370] [2019-11-28 17:31:39,348 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 17:31:39,348 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:31:39,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 17:31:39,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 17:31:39,349 INFO L87 Difference]: Start difference. First operand 1503 states and 1647 transitions. Second operand 3 states. [2019-11-28 17:31:39,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:31:39,455 INFO L93 Difference]: Finished difference Result 2346 states and 2580 transitions. [2019-11-28 17:31:39,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 17:31:39,456 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 149 [2019-11-28 17:31:39,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:31:39,460 INFO L225 Difference]: With dead ends: 2346 [2019-11-28 17:31:39,460 INFO L226 Difference]: Without dead ends: 1539 [2019-11-28 17:31:39,464 INFO L630 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 [2019-11-28 17:31:39,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1539 states. [2019-11-28 17:31:39,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1539 to 1503. [2019-11-28 17:31:39,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1503 states. [2019-11-28 17:31:39,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1503 states to 1503 states and 1627 transitions. [2019-11-28 17:31:39,560 INFO L78 Accepts]: Start accepts. Automaton has 1503 states and 1627 transitions. Word has length 149 [2019-11-28 17:31:39,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:31:39,561 INFO L462 AbstractCegarLoop]: Abstraction has 1503 states and 1627 transitions. [2019-11-28 17:31:39,561 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 17:31:39,562 INFO L276 IsEmpty]: Start isEmpty. Operand 1503 states and 1627 transitions. [2019-11-28 17:31:39,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-11-28 17:31:39,566 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:31:39,566 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:31:39,566 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:31:39,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:31:39,567 INFO L82 PathProgramCache]: Analyzing trace with hash -1275276035, now seen corresponding path program 1 times [2019-11-28 17:31:39,567 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:31:39,571 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717854570] [2019-11-28 17:31:39,572 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:31:39,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:31:39,641 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 17:31:39,641 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717854570] [2019-11-28 17:31:39,642 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:31:39,642 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 17:31:39,643 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909547819] [2019-11-28 17:31:39,644 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 17:31:39,646 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:31:39,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 17:31:39,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 17:31:39,648 INFO L87 Difference]: Start difference. First operand 1503 states and 1627 transitions. Second operand 3 states. [2019-11-28 17:31:39,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:31:39,743 INFO L93 Difference]: Finished difference Result 2657 states and 2881 transitions. [2019-11-28 17:31:39,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 17:31:39,744 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 150 [2019-11-28 17:31:39,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:31:39,746 INFO L225 Difference]: With dead ends: 2657 [2019-11-28 17:31:39,747 INFO L226 Difference]: Without dead ends: 1503 [2019-11-28 17:31:39,749 INFO L630 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 [2019-11-28 17:31:39,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1503 states. [2019-11-28 17:31:39,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1503 to 1503. [2019-11-28 17:31:39,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1503 states. [2019-11-28 17:31:39,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1503 states to 1503 states and 1605 transitions. [2019-11-28 17:31:39,830 INFO L78 Accepts]: Start accepts. Automaton has 1503 states and 1605 transitions. Word has length 150 [2019-11-28 17:31:39,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:31:39,831 INFO L462 AbstractCegarLoop]: Abstraction has 1503 states and 1605 transitions. [2019-11-28 17:31:39,831 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 17:31:39,831 INFO L276 IsEmpty]: Start isEmpty. Operand 1503 states and 1605 transitions. [2019-11-28 17:31:39,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-11-28 17:31:39,834 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:31:39,835 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:31:39,835 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:31:39,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:31:39,835 INFO L82 PathProgramCache]: Analyzing trace with hash -660923245, now seen corresponding path program 1 times [2019-11-28 17:31:39,836 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:31:39,836 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540325680] [2019-11-28 17:31:39,836 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:31:39,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:31:40,001 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-28 17:31:40,002 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540325680] [2019-11-28 17:31:40,002 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:31:40,002 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 17:31:40,003 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445386313] [2019-11-28 17:31:40,003 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 17:31:40,004 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:31:40,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 17:31:40,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 17:31:40,004 INFO L87 Difference]: Start difference. First operand 1503 states and 1605 transitions. Second operand 5 states. [2019-11-28 17:31:40,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:31:40,118 INFO L93 Difference]: Finished difference Result 1503 states and 1605 transitions. [2019-11-28 17:31:40,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 17:31:40,119 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 152 [2019-11-28 17:31:40,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:31:40,124 INFO L225 Difference]: With dead ends: 1503 [2019-11-28 17:31:40,124 INFO L226 Difference]: Without dead ends: 1501 [2019-11-28 17:31:40,125 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 17:31:40,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1501 states. [2019-11-28 17:31:40,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1501 to 1501. [2019-11-28 17:31:40,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1501 states. [2019-11-28 17:31:40,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1501 states to 1501 states and 1602 transitions. [2019-11-28 17:31:40,256 INFO L78 Accepts]: Start accepts. Automaton has 1501 states and 1602 transitions. Word has length 152 [2019-11-28 17:31:40,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:31:40,257 INFO L462 AbstractCegarLoop]: Abstraction has 1501 states and 1602 transitions. [2019-11-28 17:31:40,257 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 17:31:40,257 INFO L276 IsEmpty]: Start isEmpty. Operand 1501 states and 1602 transitions. [2019-11-28 17:31:40,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-11-28 17:31:40,260 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:31:40,260 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:31:40,261 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:31:40,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:31:40,261 INFO L82 PathProgramCache]: Analyzing trace with hash -1317806111, now seen corresponding path program 1 times [2019-11-28 17:31:40,262 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:31:40,262 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91294056] [2019-11-28 17:31:40,262 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:31:40,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:31:40,314 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-11-28 17:31:40,314 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91294056] [2019-11-28 17:31:40,314 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:31:40,315 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 17:31:40,315 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258571432] [2019-11-28 17:31:40,316 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 17:31:40,316 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:31:40,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 17:31:40,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 17:31:40,317 INFO L87 Difference]: Start difference. First operand 1501 states and 1602 transitions. Second operand 3 states. [2019-11-28 17:31:40,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:31:40,471 INFO L93 Difference]: Finished difference Result 2757 states and 2935 transitions. [2019-11-28 17:31:40,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 17:31:40,472 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 156 [2019-11-28 17:31:40,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:31:40,478 INFO L225 Difference]: With dead ends: 2757 [2019-11-28 17:31:40,478 INFO L226 Difference]: Without dead ends: 2121 [2019-11-28 17:31:40,480 INFO L630 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 [2019-11-28 17:31:40,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2121 states. [2019-11-28 17:31:40,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2121 to 1503. [2019-11-28 17:31:40,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1503 states. [2019-11-28 17:31:40,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1503 states to 1503 states and 1604 transitions. [2019-11-28 17:31:40,611 INFO L78 Accepts]: Start accepts. Automaton has 1503 states and 1604 transitions. Word has length 156 [2019-11-28 17:31:40,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:31:40,612 INFO L462 AbstractCegarLoop]: Abstraction has 1503 states and 1604 transitions. [2019-11-28 17:31:40,612 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 17:31:40,612 INFO L276 IsEmpty]: Start isEmpty. Operand 1503 states and 1604 transitions. [2019-11-28 17:31:40,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-11-28 17:31:40,616 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:31:40,616 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:31:40,617 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:31:40,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:31:40,617 INFO L82 PathProgramCache]: Analyzing trace with hash 1860246650, now seen corresponding path program 1 times [2019-11-28 17:31:40,617 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:31:40,618 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571540258] [2019-11-28 17:31:40,618 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:31:40,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 17:31:40,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 17:31:40,735 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 17:31:40,735 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-28 17:31:40,895 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 05:31:40 BoogieIcfgContainer [2019-11-28 17:31:40,895 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 17:31:40,896 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 17:31:40,896 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 17:31:40,896 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 17:31:40,897 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 05:31:31" (3/4) ... [2019-11-28 17:31:40,899 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-28 17:31:41,064 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 17:31:41,065 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 17:31:41,067 INFO L168 Benchmark]: Toolchain (without parser) took 11410.29 ms. Allocated memory was 1.0 GB in the beginning and 1.7 GB in the end (delta: 640.2 MB). Free memory was 957.7 MB in the beginning and 1.3 GB in the end (delta: -317.5 MB). Peak memory consumption was 322.6 MB. Max. memory is 11.5 GB. [2019-11-28 17:31:41,067 INFO L168 Benchmark]: CDTParser took 0.36 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 17:31:41,068 INFO L168 Benchmark]: CACSL2BoogieTranslator took 552.33 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 99.1 MB). Free memory was 957.7 MB in the beginning and 1.1 GB in the end (delta: -131.3 MB). Peak memory consumption was 25.8 MB. Max. memory is 11.5 GB. [2019-11-28 17:31:41,068 INFO L168 Benchmark]: Boogie Procedure Inliner took 71.32 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-11-28 17:31:41,069 INFO L168 Benchmark]: Boogie Preprocessor took 58.26 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-11-28 17:31:41,070 INFO L168 Benchmark]: RCFGBuilder took 1068.45 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 57.5 MB). Peak memory consumption was 57.5 MB. Max. memory is 11.5 GB. [2019-11-28 17:31:41,070 INFO L168 Benchmark]: TraceAbstraction took 9485.51 ms. Allocated memory was 1.1 GB in the beginning and 1.7 GB in the end (delta: 541.1 MB). Free memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: -274.1 MB). Peak memory consumption was 266.9 MB. Max. memory is 11.5 GB. [2019-11-28 17:31:41,071 INFO L168 Benchmark]: Witness Printer took 168.94 ms. Allocated memory is still 1.7 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 17.1 MB). Peak memory consumption was 17.1 MB. Max. memory is 11.5 GB. [2019-11-28 17:31:41,073 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.36 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 552.33 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 99.1 MB). Free memory was 957.7 MB in the beginning and 1.1 GB in the end (delta: -131.3 MB). Peak memory consumption was 25.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 71.32 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 58.26 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1068.45 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 57.5 MB). Peak memory consumption was 57.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 9485.51 ms. Allocated memory was 1.1 GB in the beginning and 1.7 GB in the end (delta: 541.1 MB). Free memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: -274.1 MB). Peak memory consumption was 266.9 MB. Max. memory is 11.5 GB. * Witness Printer took 168.94 ms. Allocated memory is still 1.7 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 17.1 MB). Peak memory consumption was 17.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 10]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L14] int m_pc = 0; [L15] int t1_pc = 0; [L16] int t2_pc = 0; [L17] int m_st ; [L18] int t1_st ; [L19] int t2_st ; [L20] int m_i ; [L21] int t1_i ; [L22] int t2_i ; [L23] int M_E = 2; [L24] int T1_E = 2; [L25] int T2_E = 2; [L26] int E_M = 2; [L27] int E_1 = 2; [L28] int E_2 = 2; [L33] int token ; [L35] int local ; VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, token=0] [L600] int __retres1 ; [L514] m_i = 1 [L515] t1_i = 1 [L516] t2_i = 1 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L541] int kernel_st ; [L542] int tmp ; [L543] int tmp___0 ; [L547] kernel_st = 0 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L233] COND TRUE m_i == 1 [L234] m_st = 0 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L238] COND TRUE t1_i == 1 [L239] t1_st = 0 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L243] COND TRUE t2_i == 1 [L244] t2_st = 0 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L346] COND FALSE !(M_E == 0) VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L351] COND FALSE !(T1_E == 0) VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L356] COND FALSE !(T2_E == 0) VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L361] COND FALSE !(E_M == 0) VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L366] COND FALSE !(E_1 == 0) VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L371] COND FALSE !(E_2 == 0) VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L419] int tmp ; [L420] int tmp___0 ; [L421] int tmp___1 ; [L165] int __retres1 ; VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L168] COND FALSE !(m_pc == 1) VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L178] __retres1 = 0 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L180] return (__retres1); VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L425] tmp = is_master_triggered() [L427] COND FALSE !(\read(tmp)) VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L184] int __retres1 ; VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L187] COND FALSE !(t1_pc == 1) VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L197] __retres1 = 0 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L199] return (__retres1); VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L433] tmp___0 = is_transmit1_triggered() [L435] COND FALSE !(\read(tmp___0)) VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L203] int __retres1 ; VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L206] COND FALSE !(t2_pc == 1) VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L216] __retres1 = 0 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L218] return (__retres1); VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L441] tmp___1 = is_transmit2_triggered() [L443] COND FALSE !(\read(tmp___1)) VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L384] COND FALSE !(M_E == 1) VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L389] COND FALSE !(T1_E == 1) VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L394] COND FALSE !(T2_E == 1) VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L399] COND FALSE !(E_M == 1) VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L404] COND FALSE !(E_1 == 1) VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L409] COND FALSE !(E_2 == 1) VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L555] COND TRUE 1 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L558] kernel_st = 1 [L279] int tmp ; VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L283] COND TRUE 1 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L253] int __retres1 ; VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L256] COND TRUE m_st == 0 [L257] __retres1 = 1 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L274] return (__retres1); VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L286] tmp = exists_runnable_thread() [L288] COND TRUE \read(tmp) VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L293] COND TRUE m_st == 0 [L294] int tmp_ndt_1; [L295] tmp_ndt_1 = __VERIFIER_nondet_int() [L296] COND FALSE !(\read(tmp_ndt_1)) VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L307] COND TRUE t1_st == 0 [L308] int tmp_ndt_2; [L309] tmp_ndt_2 = __VERIFIER_nondet_int() [L310] COND TRUE \read(tmp_ndt_2) [L312] t1_st = 1 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L96] COND TRUE t1_pc == 0 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L107] COND TRUE 1 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L109] t1_pc = 1 [L110] t1_st = 2 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L321] COND TRUE t2_st == 0 [L322] int tmp_ndt_3; [L323] tmp_ndt_3 = __VERIFIER_nondet_int() [L324] COND TRUE \read(tmp_ndt_3) [L326] t2_st = 1 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=1, token=0] [L132] COND TRUE t2_pc == 0 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=1, token=0] [L143] COND TRUE 1 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=1, token=0] [L145] t2_pc = 1 [L146] t2_st = 2 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L283] COND TRUE 1 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L253] int __retres1 ; VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L256] COND TRUE m_st == 0 [L257] __retres1 = 1 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L274] return (__retres1); VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L286] tmp = exists_runnable_thread() [L288] COND TRUE \read(tmp) VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L293] COND TRUE m_st == 0 [L294] int tmp_ndt_1; [L295] tmp_ndt_1 = __VERIFIER_nondet_int() [L296] COND TRUE \read(tmp_ndt_1) [L298] m_st = 1 [L38] int tmp_var = __VERIFIER_nondet_int(); [L40] COND TRUE m_pc == 0 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L51] COND TRUE 1 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L54] token = __VERIFIER_nondet_int() [L55] local = token [L56] E_1 = 1 [L419] int tmp ; [L420] int tmp___0 ; [L421] int tmp___1 ; [L165] int __retres1 ; VAL [E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L168] COND FALSE !(m_pc == 1) VAL [E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L178] __retres1 = 0 VAL [E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L180] return (__retres1); VAL [E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L425] tmp = is_master_triggered() [L427] COND FALSE !(\read(tmp)) VAL [E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L184] int __retres1 ; VAL [E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L187] COND TRUE t1_pc == 1 VAL [E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L188] COND TRUE E_1 == 1 [L189] __retres1 = 1 VAL [E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L199] return (__retres1); VAL [E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L433] tmp___0 = is_transmit1_triggered() [L435] COND TRUE \read(tmp___0) [L436] t1_st = 0 VAL [E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L203] int __retres1 ; VAL [E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L206] COND TRUE t2_pc == 1 VAL [E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L207] COND FALSE !(E_2 == 1) VAL [E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L216] __retres1 = 0 VAL [E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L218] return (__retres1); VAL [E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L441] tmp___1 = is_transmit2_triggered() [L443] COND FALSE !(\read(tmp___1)) VAL [E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L58] E_1 = 2 [L59] m_pc = 1 [L60] m_st = 2 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L307] COND TRUE t1_st == 0 [L308] int tmp_ndt_2; [L309] tmp_ndt_2 = __VERIFIER_nondet_int() [L310] COND TRUE \read(tmp_ndt_2) [L312] t1_st = 1 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L96] COND FALSE !(t1_pc == 0) VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L99] COND TRUE t1_pc == 1 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L115] token += 1 [L116] E_2 = 1 [L419] int tmp ; [L420] int tmp___0 ; [L421] int tmp___1 ; [L165] int __retres1 ; VAL [E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L168] COND TRUE m_pc == 1 VAL [E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L169] COND FALSE !(E_M == 1) VAL [E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L178] __retres1 = 0 VAL [E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L180] return (__retres1); VAL [E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L425] tmp = is_master_triggered() [L427] COND FALSE !(\read(tmp)) VAL [E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L184] int __retres1 ; VAL [E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L187] COND TRUE t1_pc == 1 VAL [E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L188] COND FALSE !(E_1 == 1) VAL [E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L197] __retres1 = 0 VAL [E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L199] return (__retres1); VAL [E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L433] tmp___0 = is_transmit1_triggered() [L435] COND FALSE !(\read(tmp___0)) VAL [E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L203] int __retres1 ; VAL [E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L206] COND TRUE t2_pc == 1 VAL [E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L207] COND TRUE E_2 == 1 [L208] __retres1 = 1 VAL [E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L218] return (__retres1); VAL [E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L441] tmp___1 = is_transmit2_triggered() [L443] COND TRUE \read(tmp___1) [L444] t2_st = 0 VAL [E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, token=1] [L118] E_2 = 2 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, token=1] [L107] COND TRUE 1 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, token=1] [L109] t1_pc = 1 [L110] t1_st = 2 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, token=1] [L321] COND TRUE t2_st == 0 [L322] int tmp_ndt_3; [L323] tmp_ndt_3 = __VERIFIER_nondet_int() [L324] COND TRUE \read(tmp_ndt_3) [L326] t2_st = 1 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=1] [L132] COND FALSE !(t2_pc == 0) VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=1] [L135] COND TRUE t2_pc == 1 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=1] [L151] token += 1 [L152] E_M = 1 [L419] int tmp ; [L420] int tmp___0 ; [L421] int tmp___1 ; [L165] int __retres1 ; VAL [E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L168] COND TRUE m_pc == 1 VAL [E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L169] COND TRUE E_M == 1 [L170] __retres1 = 1 VAL [E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L180] return (__retres1); VAL [E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L425] tmp = is_master_triggered() [L427] COND TRUE \read(tmp) [L428] m_st = 0 VAL [E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L184] int __retres1 ; VAL [E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L187] COND TRUE t1_pc == 1 VAL [E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L188] COND FALSE !(E_1 == 1) VAL [E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L197] __retres1 = 0 VAL [E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L199] return (__retres1); VAL [E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L433] tmp___0 = is_transmit1_triggered() [L435] COND FALSE !(\read(tmp___0)) VAL [E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L203] int __retres1 ; VAL [E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L206] COND TRUE t2_pc == 1 VAL [E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L207] COND FALSE !(E_2 == 1) VAL [E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L216] __retres1 = 0 VAL [E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L218] return (__retres1); VAL [E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L441] tmp___1 = is_transmit2_triggered() [L443] COND FALSE !(\read(tmp___1)) VAL [E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L154] E_M = 2 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L143] COND TRUE 1 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L145] t2_pc = 1 [L146] t2_st = 2 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L283] COND TRUE 1 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L253] int __retres1 ; VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L256] COND TRUE m_st == 0 [L257] __retres1 = 1 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L274] return (__retres1); VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L286] tmp = exists_runnable_thread() [L288] COND TRUE \read(tmp) VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L293] COND TRUE m_st == 0 [L294] int tmp_ndt_1; [L295] tmp_ndt_1 = __VERIFIER_nondet_int() [L296] COND TRUE \read(tmp_ndt_1) [L298] m_st = 1 [L38] int tmp_var = __VERIFIER_nondet_int(); [L40] COND FALSE !(m_pc == 0) VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L43] COND TRUE m_pc == 1 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L65] COND FALSE !(token != local + 2) VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L70] COND TRUE tmp_var <= 5 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L71] COND TRUE tmp_var >= 5 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L76] COND TRUE tmp_var <= 5 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L77] COND TRUE tmp_var >= 5 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L78] COND TRUE tmp_var == 5 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L10] __VERIFIER_error() VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 225 locations, 2 error locations. Result: UNSAFE, OverallTime: 9.2s, OverallIterations: 26, TraceHistogramMax: 3, AutomataDifference: 4.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 8212 SDtfs, 7053 SDslu, 5879 SDs, 0 SdLazy, 402 SolverSat, 175 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 87 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4416occurred in iteration=20, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.9s AutomataMinimizationTime, 25 MinimizatonAttempts, 1848 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 2497 NumberOfCodeBlocks, 2497 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 2315 ConstructedInterpolants, 0 QuantifiedInterpolants, 459807 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 25 InterpolantComputations, 25 PerfectInterpolantSequences, 367/367 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...