./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 f6fb2bb1 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.24-f6fb2bb [2019-11-19 18:58:34,326 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-19 18:58:34,328 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-19 18:58:34,341 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-19 18:58:34,342 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-19 18:58:34,343 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-19 18:58:34,344 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-19 18:58:34,346 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-19 18:58:34,349 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-19 18:58:34,350 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-19 18:58:34,352 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-19 18:58:34,355 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-19 18:58:34,355 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-19 18:58:34,356 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-19 18:58:34,359 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-19 18:58:34,360 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-19 18:58:34,361 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-19 18:58:34,364 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-19 18:58:34,367 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-19 18:58:34,370 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-19 18:58:34,372 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-19 18:58:34,373 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-19 18:58:34,374 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-19 18:58:34,375 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-19 18:58:34,377 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-19 18:58:34,377 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-19 18:58:34,377 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-19 18:58:34,378 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-19 18:58:34,379 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-19 18:58:34,380 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-19 18:58:34,380 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-19 18:58:34,381 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-19 18:58:34,382 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-19 18:58:34,383 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-19 18:58:34,384 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-19 18:58:34,384 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-19 18:58:34,385 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-19 18:58:34,385 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-19 18:58:34,385 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-19 18:58:34,386 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-19 18:58:34,387 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-19 18:58:34,388 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-19 18:58:34,404 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-19 18:58:34,404 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-19 18:58:34,406 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-19 18:58:34,406 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-19 18:58:34,406 INFO L138 SettingsManager]: * Use SBE=true [2019-11-19 18:58:34,407 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-19 18:58:34,407 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-19 18:58:34,407 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-19 18:58:34,407 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-19 18:58:34,408 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-19 18:58:34,408 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-19 18:58:34,408 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-19 18:58:34,409 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-19 18:58:34,409 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-19 18:58:34,409 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-19 18:58:34,410 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-19 18:58:34,410 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-19 18:58:34,410 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-19 18:58:34,410 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-19 18:58:34,411 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-19 18:58:34,411 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-19 18:58:34,411 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-19 18:58:34,412 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-19 18:58:34,412 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-19 18:58:34,412 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-19 18:58:34,412 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-19 18:58:34,413 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-19 18:58:34,413 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-19 18:58:34,413 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-19 18:58:34,776 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-19 18:58:34,789 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-19 18:58:34,793 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-19 18:58:34,796 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-19 18:58:34,797 INFO L275 PluginConnector]: CDTParser initialized [2019-11-19 18:58:34,798 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-19 18:58:34,877 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/053c76d83/e37b0fafa02a4ba29adb48b0b6fcf15a/FLAG8aaf0358d [2019-11-19 18:58:35,419 INFO L306 CDTParser]: Found 1 translation units. [2019-11-19 18:58:35,420 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/token_ring.02.cil-2.c [2019-11-19 18:58:35,436 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/053c76d83/e37b0fafa02a4ba29adb48b0b6fcf15a/FLAG8aaf0358d [2019-11-19 18:58:35,722 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/053c76d83/e37b0fafa02a4ba29adb48b0b6fcf15a [2019-11-19 18:58:35,726 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-19 18:58:35,728 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-19 18:58:35,730 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-19 18:58:35,730 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-19 18:58:35,734 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-19 18:58:35,735 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 06:58:35" (1/1) ... [2019-11-19 18:58:35,738 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e9b7677 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:58:35, skipping insertion in model container [2019-11-19 18:58:35,739 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 06:58:35" (1/1) ... [2019-11-19 18:58:35,747 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-19 18:58:35,795 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-19 18:58:36,061 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 18:58:36,067 INFO L188 MainTranslator]: Completed pre-run [2019-11-19 18:58:36,123 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 18:58:36,211 INFO L192 MainTranslator]: Completed translation [2019-11-19 18:58:36,212 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:58:36 WrapperNode [2019-11-19 18:58:36,212 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-19 18:58:36,213 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-19 18:58:36,213 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-19 18:58:36,214 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-19 18:58:36,222 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:58:36" (1/1) ... [2019-11-19 18:58:36,231 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:58:36" (1/1) ... [2019-11-19 18:58:36,275 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-19 18:58:36,277 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-19 18:58:36,277 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-19 18:58:36,280 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-19 18:58:36,291 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:58:36" (1/1) ... [2019-11-19 18:58:36,291 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:58:36" (1/1) ... [2019-11-19 18:58:36,295 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:58:36" (1/1) ... [2019-11-19 18:58:36,296 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:58:36" (1/1) ... [2019-11-19 18:58:36,306 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:58:36" (1/1) ... [2019-11-19 18:58:36,318 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:58:36" (1/1) ... [2019-11-19 18:58:36,322 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:58:36" (1/1) ... [2019-11-19 18:58:36,329 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-19 18:58:36,329 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-19 18:58:36,329 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-19 18:58:36,329 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-19 18:58:36,330 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:58:36" (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-19 18:58:36,404 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-19 18:58:36,404 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-19 18:58:37,284 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-19 18:58:37,284 INFO L285 CfgBuilder]: Removed 105 assume(true) statements. [2019-11-19 18:58:37,286 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:58:37 BoogieIcfgContainer [2019-11-19 18:58:37,286 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-19 18:58:37,287 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-19 18:58:37,287 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-19 18:58:37,291 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-19 18:58:37,291 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 06:58:35" (1/3) ... [2019-11-19 18:58:37,292 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fd83a3f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 06:58:37, skipping insertion in model container [2019-11-19 18:58:37,292 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:58:36" (2/3) ... [2019-11-19 18:58:37,293 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fd83a3f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 06:58:37, skipping insertion in model container [2019-11-19 18:58:37,293 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:58:37" (3/3) ... [2019-11-19 18:58:37,295 INFO L109 eAbstractionObserver]: Analyzing ICFG token_ring.02.cil-2.c [2019-11-19 18:58:37,304 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-19 18:58:37,313 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-11-19 18:58:37,325 INFO L249 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2019-11-19 18:58:37,356 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-19 18:58:37,357 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-19 18:58:37,357 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-19 18:58:37,357 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-19 18:58:37,358 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-19 18:58:37,358 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-19 18:58:37,358 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-19 18:58:37,359 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-19 18:58:37,383 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states. [2019-11-19 18:58:37,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-19 18:58:37,391 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:58:37,392 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-19 18:58:37,393 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:58:37,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:58:37,399 INFO L82 PathProgramCache]: Analyzing trace with hash 603110903, now seen corresponding path program 1 times [2019-11-19 18:58:37,409 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 18:58:37,409 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687137217] [2019-11-19 18:58:37,410 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 18:58:37,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:37,574 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-19 18:58:37,575 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687137217] [2019-11-19 18:58:37,576 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 18:58:37,577 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 18:58:37,579 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820168974] [2019-11-19 18:58:37,587 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 18:58:37,589 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 18:58:37,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 18:58:37,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 18:58:37,608 INFO L87 Difference]: Start difference. First operand 225 states. Second operand 3 states. [2019-11-19 18:58:37,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 18:58:37,742 INFO L93 Difference]: Finished difference Result 445 states and 697 transitions. [2019-11-19 18:58:37,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 18:58:37,744 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2019-11-19 18:58:37,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 18:58:37,765 INFO L225 Difference]: With dead ends: 445 [2019-11-19 18:58:37,766 INFO L226 Difference]: Without dead ends: 221 [2019-11-19 18:58:37,779 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-19 18:58:37,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2019-11-19 18:58:37,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 221. [2019-11-19 18:58:37,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2019-11-19 18:58:37,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 335 transitions. [2019-11-19 18:58:37,903 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 335 transitions. Word has length 50 [2019-11-19 18:58:37,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 18:58:37,904 INFO L462 AbstractCegarLoop]: Abstraction has 221 states and 335 transitions. [2019-11-19 18:58:37,904 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 18:58:37,904 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 335 transitions. [2019-11-19 18:58:37,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-19 18:58:37,911 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:58:37,912 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-19 18:58:37,912 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:58:37,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:58:37,913 INFO L82 PathProgramCache]: Analyzing trace with hash -1325161799, now seen corresponding path program 1 times [2019-11-19 18:58:37,913 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 18:58:37,914 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263609895] [2019-11-19 18:58:37,914 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 18:58:37,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:37,995 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-19 18:58:37,995 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263609895] [2019-11-19 18:58:37,996 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 18:58:37,996 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-19 18:58:37,996 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893131173] [2019-11-19 18:58:37,999 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 18:58:37,999 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 18:58:38,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 18:58:38,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 18:58:38,000 INFO L87 Difference]: Start difference. First operand 221 states and 335 transitions. Second operand 3 states. [2019-11-19 18:58:38,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 18:58:38,097 INFO L93 Difference]: Finished difference Result 595 states and 901 transitions. [2019-11-19 18:58:38,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 18:58:38,101 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2019-11-19 18:58:38,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 18:58:38,108 INFO L225 Difference]: With dead ends: 595 [2019-11-19 18:58:38,108 INFO L226 Difference]: Without dead ends: 381 [2019-11-19 18:58:38,115 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-19 18:58:38,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2019-11-19 18:58:38,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 377. [2019-11-19 18:58:38,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2019-11-19 18:58:38,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 570 transitions. [2019-11-19 18:58:38,182 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 570 transitions. Word has length 50 [2019-11-19 18:58:38,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 18:58:38,183 INFO L462 AbstractCegarLoop]: Abstraction has 377 states and 570 transitions. [2019-11-19 18:58:38,183 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 18:58:38,183 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 570 transitions. [2019-11-19 18:58:38,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-19 18:58:38,185 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:58:38,185 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-19 18:58:38,186 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:58:38,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:58:38,187 INFO L82 PathProgramCache]: Analyzing trace with hash 102769205, now seen corresponding path program 1 times [2019-11-19 18:58:38,187 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 18:58:38,188 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435701612] [2019-11-19 18:58:38,188 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 18:58:38,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:38,251 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-19 18:58:38,252 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435701612] [2019-11-19 18:58:38,252 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 18:58:38,253 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-19 18:58:38,254 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141839173] [2019-11-19 18:58:38,254 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 18:58:38,255 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 18:58:38,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 18:58:38,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 18:58:38,257 INFO L87 Difference]: Start difference. First operand 377 states and 570 transitions. Second operand 3 states. [2019-11-19 18:58:38,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 18:58:38,298 INFO L93 Difference]: Finished difference Result 746 states and 1129 transitions. [2019-11-19 18:58:38,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 18:58:38,299 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2019-11-19 18:58:38,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 18:58:38,306 INFO L225 Difference]: With dead ends: 746 [2019-11-19 18:58:38,307 INFO L226 Difference]: Without dead ends: 377 [2019-11-19 18:58:38,309 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-19 18:58:38,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2019-11-19 18:58:38,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 377. [2019-11-19 18:58:38,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2019-11-19 18:58:38,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 562 transitions. [2019-11-19 18:58:38,345 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 562 transitions. Word has length 50 [2019-11-19 18:58:38,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 18:58:38,345 INFO L462 AbstractCegarLoop]: Abstraction has 377 states and 562 transitions. [2019-11-19 18:58:38,346 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 18:58:38,346 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 562 transitions. [2019-11-19 18:58:38,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-19 18:58:38,355 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:58:38,355 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-19 18:58:38,355 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:58:38,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:58:38,358 INFO L82 PathProgramCache]: Analyzing trace with hash 1811399481, now seen corresponding path program 1 times [2019-11-19 18:58:38,358 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 18:58:38,359 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459981442] [2019-11-19 18:58:38,359 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 18:58:38,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:38,417 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-19 18:58:38,418 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459981442] [2019-11-19 18:58:38,418 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 18:58:38,419 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-19 18:58:38,419 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526760029] [2019-11-19 18:58:38,420 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 18:58:38,420 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 18:58:38,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 18:58:38,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 18:58:38,421 INFO L87 Difference]: Start difference. First operand 377 states and 562 transitions. Second operand 3 states. [2019-11-19 18:58:38,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 18:58:38,461 INFO L93 Difference]: Finished difference Result 745 states and 1112 transitions. [2019-11-19 18:58:38,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 18:58:38,462 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2019-11-19 18:58:38,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 18:58:38,465 INFO L225 Difference]: With dead ends: 745 [2019-11-19 18:58:38,466 INFO L226 Difference]: Without dead ends: 377 [2019-11-19 18:58:38,467 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-19 18:58:38,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2019-11-19 18:58:38,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 377. [2019-11-19 18:58:38,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2019-11-19 18:58:38,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 554 transitions. [2019-11-19 18:58:38,490 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 554 transitions. Word has length 50 [2019-11-19 18:58:38,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 18:58:38,491 INFO L462 AbstractCegarLoop]: Abstraction has 377 states and 554 transitions. [2019-11-19 18:58:38,491 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 18:58:38,491 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 554 transitions. [2019-11-19 18:58:38,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-19 18:58:38,493 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:58:38,493 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-19 18:58:38,494 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:58:38,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:58:38,494 INFO L82 PathProgramCache]: Analyzing trace with hash 65401269, now seen corresponding path program 1 times [2019-11-19 18:58:38,495 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 18:58:38,495 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626461255] [2019-11-19 18:58:38,495 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 18:58:38,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:38,535 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-19 18:58:38,536 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626461255] [2019-11-19 18:58:38,536 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 18:58:38,537 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-19 18:58:38,537 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26464308] [2019-11-19 18:58:38,538 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 18:58:38,538 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 18:58:38,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 18:58:38,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 18:58:38,539 INFO L87 Difference]: Start difference. First operand 377 states and 554 transitions. Second operand 3 states. [2019-11-19 18:58:38,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 18:58:38,603 INFO L93 Difference]: Finished difference Result 744 states and 1095 transitions. [2019-11-19 18:58:38,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 18:58:38,604 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2019-11-19 18:58:38,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 18:58:38,606 INFO L225 Difference]: With dead ends: 744 [2019-11-19 18:58:38,606 INFO L226 Difference]: Without dead ends: 377 [2019-11-19 18:58:38,608 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-19 18:58:38,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2019-11-19 18:58:38,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 377. [2019-11-19 18:58:38,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2019-11-19 18:58:38,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 538 transitions. [2019-11-19 18:58:38,629 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 538 transitions. Word has length 50 [2019-11-19 18:58:38,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 18:58:38,630 INFO L462 AbstractCegarLoop]: Abstraction has 377 states and 538 transitions. [2019-11-19 18:58:38,630 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 18:58:38,630 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 538 transitions. [2019-11-19 18:58:38,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-19 18:58:38,631 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:58:38,632 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-19 18:58:38,632 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:58:38,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:58:38,632 INFO L82 PathProgramCache]: Analyzing trace with hash 25960058, now seen corresponding path program 1 times [2019-11-19 18:58:38,633 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 18:58:38,633 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925440606] [2019-11-19 18:58:38,633 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 18:58:38,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:38,683 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-19 18:58:38,684 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925440606] [2019-11-19 18:58:38,684 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 18:58:38,684 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-19 18:58:38,684 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118173527] [2019-11-19 18:58:38,685 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 18:58:38,685 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 18:58:38,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 18:58:38,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 18:58:38,685 INFO L87 Difference]: Start difference. First operand 377 states and 538 transitions. Second operand 3 states. [2019-11-19 18:58:38,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 18:58:38,756 INFO L93 Difference]: Finished difference Result 743 states and 1062 transitions. [2019-11-19 18:58:38,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 18:58:38,757 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2019-11-19 18:58:38,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 18:58:38,760 INFO L225 Difference]: With dead ends: 743 [2019-11-19 18:58:38,760 INFO L226 Difference]: Without dead ends: 377 [2019-11-19 18:58:38,761 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-19 18:58:38,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2019-11-19 18:58:38,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 377. [2019-11-19 18:58:38,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2019-11-19 18:58:38,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 522 transitions. [2019-11-19 18:58:38,784 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 522 transitions. Word has length 50 [2019-11-19 18:58:38,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 18:58:38,785 INFO L462 AbstractCegarLoop]: Abstraction has 377 states and 522 transitions. [2019-11-19 18:58:38,785 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 18:58:38,785 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 522 transitions. [2019-11-19 18:58:38,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-19 18:58:38,790 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:58:38,790 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-19 18:58:38,791 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:58:38,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:58:38,795 INFO L82 PathProgramCache]: Analyzing trace with hash 1177649081, now seen corresponding path program 1 times [2019-11-19 18:58:38,795 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 18:58:38,796 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592647823] [2019-11-19 18:58:38,797 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 18:58:38,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:38,862 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-19 18:58:38,863 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592647823] [2019-11-19 18:58:38,863 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 18:58:38,863 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-19 18:58:38,864 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797487194] [2019-11-19 18:58:38,864 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 18:58:38,865 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 18:58:38,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 18:58:38,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 18:58:38,870 INFO L87 Difference]: Start difference. First operand 377 states and 522 transitions. Second operand 3 states. [2019-11-19 18:58:38,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 18:58:38,932 INFO L93 Difference]: Finished difference Result 742 states and 1029 transitions. [2019-11-19 18:58:38,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 18:58:38,933 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2019-11-19 18:58:38,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 18:58:38,936 INFO L225 Difference]: With dead ends: 742 [2019-11-19 18:58:38,936 INFO L226 Difference]: Without dead ends: 377 [2019-11-19 18:58:38,938 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-19 18:58:38,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2019-11-19 18:58:38,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 377. [2019-11-19 18:58:38,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2019-11-19 18:58:38,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 506 transitions. [2019-11-19 18:58:38,959 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 506 transitions. Word has length 50 [2019-11-19 18:58:38,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 18:58:38,960 INFO L462 AbstractCegarLoop]: Abstraction has 377 states and 506 transitions. [2019-11-19 18:58:38,960 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 18:58:38,960 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 506 transitions. [2019-11-19 18:58:38,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-19 18:58:38,962 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:58:38,962 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-19 18:58:38,962 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:58:38,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:58:38,963 INFO L82 PathProgramCache]: Analyzing trace with hash -1947581763, now seen corresponding path program 1 times [2019-11-19 18:58:38,963 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 18:58:38,964 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550078647] [2019-11-19 18:58:38,964 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 18:58:38,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:39,068 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-19 18:58:39,069 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550078647] [2019-11-19 18:58:39,069 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 18:58:39,069 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-19 18:58:39,069 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999488775] [2019-11-19 18:58:39,070 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 18:58:39,070 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 18:58:39,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 18:58:39,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 18:58:39,071 INFO L87 Difference]: Start difference. First operand 377 states and 506 transitions. Second operand 3 states. [2019-11-19 18:58:39,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 18:58:39,157 INFO L93 Difference]: Finished difference Result 1050 states and 1412 transitions. [2019-11-19 18:58:39,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 18:58:39,157 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2019-11-19 18:58:39,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 18:58:39,161 INFO L225 Difference]: With dead ends: 1050 [2019-11-19 18:58:39,161 INFO L226 Difference]: Without dead ends: 687 [2019-11-19 18:58:39,162 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-19 18:58:39,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 687 states. [2019-11-19 18:58:39,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 687 to 649. [2019-11-19 18:58:39,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 649 states. [2019-11-19 18:58:39,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 649 states to 649 states and 861 transitions. [2019-11-19 18:58:39,194 INFO L78 Accepts]: Start accepts. Automaton has 649 states and 861 transitions. Word has length 50 [2019-11-19 18:58:39,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 18:58:39,194 INFO L462 AbstractCegarLoop]: Abstraction has 649 states and 861 transitions. [2019-11-19 18:58:39,194 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 18:58:39,194 INFO L276 IsEmpty]: Start isEmpty. Operand 649 states and 861 transitions. [2019-11-19 18:58:39,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-11-19 18:58:39,195 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:58:39,196 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-19 18:58:39,196 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:58:39,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:58:39,196 INFO L82 PathProgramCache]: Analyzing trace with hash 647371149, now seen corresponding path program 1 times [2019-11-19 18:58:39,197 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 18:58:39,197 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074870568] [2019-11-19 18:58:39,197 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 18:58:39,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:39,264 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-19 18:58:39,265 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074870568] [2019-11-19 18:58:39,265 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 18:58:39,265 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-19 18:58:39,270 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180782401] [2019-11-19 18:58:39,271 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-19 18:58:39,271 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 18:58:39,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-19 18:58:39,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-19 18:58:39,273 INFO L87 Difference]: Start difference. First operand 649 states and 861 transitions. Second operand 5 states. [2019-11-19 18:58:39,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 18:58:39,445 INFO L93 Difference]: Finished difference Result 1534 states and 2059 transitions. [2019-11-19 18:58:39,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-19 18:58:39,446 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 81 [2019-11-19 18:58:39,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 18:58:39,451 INFO L225 Difference]: With dead ends: 1534 [2019-11-19 18:58:39,452 INFO L226 Difference]: Without dead ends: 903 [2019-11-19 18:58:39,453 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-19 18:58:39,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 903 states. [2019-11-19 18:58:39,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 903 to 655. [2019-11-19 18:58:39,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 655 states. [2019-11-19 18:58:39,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 852 transitions. [2019-11-19 18:58:39,531 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 852 transitions. Word has length 81 [2019-11-19 18:58:39,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 18:58:39,531 INFO L462 AbstractCegarLoop]: Abstraction has 655 states and 852 transitions. [2019-11-19 18:58:39,531 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-19 18:58:39,532 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 852 transitions. [2019-11-19 18:58:39,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-11-19 18:58:39,533 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:58:39,533 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-19 18:58:39,534 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:58:39,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:58:39,534 INFO L82 PathProgramCache]: Analyzing trace with hash 83505161, now seen corresponding path program 1 times [2019-11-19 18:58:39,534 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 18:58:39,535 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964979407] [2019-11-19 18:58:39,535 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 18:58:39,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:39,613 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-19 18:58:39,613 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964979407] [2019-11-19 18:58:39,614 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 18:58:39,614 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-19 18:58:39,614 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745707408] [2019-11-19 18:58:39,615 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-19 18:58:39,615 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 18:58:39,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-19 18:58:39,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-19 18:58:39,616 INFO L87 Difference]: Start difference. First operand 655 states and 852 transitions. Second operand 5 states. [2019-11-19 18:58:39,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 18:58:39,769 INFO L93 Difference]: Finished difference Result 1575 states and 2073 transitions. [2019-11-19 18:58:39,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-19 18:58:39,770 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 81 [2019-11-19 18:58:39,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 18:58:39,776 INFO L225 Difference]: With dead ends: 1575 [2019-11-19 18:58:39,776 INFO L226 Difference]: Without dead ends: 945 [2019-11-19 18:58:39,778 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-19 18:58:39,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 945 states. [2019-11-19 18:58:39,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 945 to 661. [2019-11-19 18:58:39,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 661 states. [2019-11-19 18:58:39,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 661 states to 661 states and 843 transitions. [2019-11-19 18:58:39,824 INFO L78 Accepts]: Start accepts. Automaton has 661 states and 843 transitions. Word has length 81 [2019-11-19 18:58:39,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 18:58:39,825 INFO L462 AbstractCegarLoop]: Abstraction has 661 states and 843 transitions. [2019-11-19 18:58:39,826 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-19 18:58:39,826 INFO L276 IsEmpty]: Start isEmpty. Operand 661 states and 843 transitions. [2019-11-19 18:58:39,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-11-19 18:58:39,827 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:58:39,827 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-19 18:58:39,828 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:58:39,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:58:39,828 INFO L82 PathProgramCache]: Analyzing trace with hash 736088965, now seen corresponding path program 1 times [2019-11-19 18:58:39,829 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 18:58:39,829 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165396727] [2019-11-19 18:58:39,829 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 18:58:39,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:39,903 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-19 18:58:39,904 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165396727] [2019-11-19 18:58:39,905 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 18:58:39,905 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-19 18:58:39,905 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127266125] [2019-11-19 18:58:39,906 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-19 18:58:39,906 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 18:58:39,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-19 18:58:39,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-19 18:58:39,907 INFO L87 Difference]: Start difference. First operand 661 states and 843 transitions. Second operand 5 states. [2019-11-19 18:58:40,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 18:58:40,078 INFO L93 Difference]: Finished difference Result 1838 states and 2375 transitions. [2019-11-19 18:58:40,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-19 18:58:40,080 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 81 [2019-11-19 18:58:40,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 18:58:40,086 INFO L225 Difference]: With dead ends: 1838 [2019-11-19 18:58:40,087 INFO L226 Difference]: Without dead ends: 1209 [2019-11-19 18:58:40,089 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-19 18:58:40,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1209 states. [2019-11-19 18:58:40,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1209 to 673. [2019-11-19 18:58:40,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 673 states. [2019-11-19 18:58:40,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 673 states to 673 states and 842 transitions. [2019-11-19 18:58:40,148 INFO L78 Accepts]: Start accepts. Automaton has 673 states and 842 transitions. Word has length 81 [2019-11-19 18:58:40,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 18:58:40,149 INFO L462 AbstractCegarLoop]: Abstraction has 673 states and 842 transitions. [2019-11-19 18:58:40,149 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-19 18:58:40,149 INFO L276 IsEmpty]: Start isEmpty. Operand 673 states and 842 transitions. [2019-11-19 18:58:40,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-11-19 18:58:40,150 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:58:40,151 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-19 18:58:40,152 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:58:40,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:58:40,152 INFO L82 PathProgramCache]: Analyzing trace with hash -284979389, now seen corresponding path program 1 times [2019-11-19 18:58:40,153 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 18:58:40,153 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22613678] [2019-11-19 18:58:40,153 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 18:58:40,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:40,207 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-19 18:58:40,208 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22613678] [2019-11-19 18:58:40,208 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 18:58:40,208 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 18:58:40,208 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600491031] [2019-11-19 18:58:40,209 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 18:58:40,209 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 18:58:40,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 18:58:40,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 18:58:40,210 INFO L87 Difference]: Start difference. First operand 673 states and 842 transitions. Second operand 3 states. [2019-11-19 18:58:40,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 18:58:40,320 INFO L93 Difference]: Finished difference Result 1813 states and 2270 transitions. [2019-11-19 18:58:40,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 18:58:40,321 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 81 [2019-11-19 18:58:40,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 18:58:40,328 INFO L225 Difference]: With dead ends: 1813 [2019-11-19 18:58:40,329 INFO L226 Difference]: Without dead ends: 1178 [2019-11-19 18:58:40,333 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-19 18:58:40,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1178 states. [2019-11-19 18:58:40,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1178 to 1174. [2019-11-19 18:58:40,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1174 states. [2019-11-19 18:58:40,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1174 states to 1174 states and 1452 transitions. [2019-11-19 18:58:40,420 INFO L78 Accepts]: Start accepts. Automaton has 1174 states and 1452 transitions. Word has length 81 [2019-11-19 18:58:40,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 18:58:40,421 INFO L462 AbstractCegarLoop]: Abstraction has 1174 states and 1452 transitions. [2019-11-19 18:58:40,421 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 18:58:40,422 INFO L276 IsEmpty]: Start isEmpty. Operand 1174 states and 1452 transitions. [2019-11-19 18:58:40,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-11-19 18:58:40,423 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:58:40,423 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-19 18:58:40,424 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:58:40,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:58:40,424 INFO L82 PathProgramCache]: Analyzing trace with hash 206796516, now seen corresponding path program 1 times [2019-11-19 18:58:40,424 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 18:58:40,425 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173484651] [2019-11-19 18:58:40,425 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 18:58:40,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:40,501 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-19 18:58:40,502 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173484651] [2019-11-19 18:58:40,502 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 18:58:40,502 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 18:58:40,503 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513649863] [2019-11-19 18:58:40,503 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 18:58:40,503 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 18:58:40,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 18:58:40,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 18:58:40,504 INFO L87 Difference]: Start difference. First operand 1174 states and 1452 transitions. Second operand 3 states. [2019-11-19 18:58:40,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 18:58:40,646 INFO L93 Difference]: Finished difference Result 3254 states and 4030 transitions. [2019-11-19 18:58:40,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 18:58:40,646 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 82 [2019-11-19 18:58:40,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 18:58:40,656 INFO L225 Difference]: With dead ends: 3254 [2019-11-19 18:58:40,657 INFO L226 Difference]: Without dead ends: 2118 [2019-11-19 18:58:40,660 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-19 18:58:40,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2118 states. [2019-11-19 18:58:40,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2118 to 2114. [2019-11-19 18:58:40,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2114 states. [2019-11-19 18:58:40,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2114 states to 2114 states and 2598 transitions. [2019-11-19 18:58:40,837 INFO L78 Accepts]: Start accepts. Automaton has 2114 states and 2598 transitions. Word has length 82 [2019-11-19 18:58:40,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 18:58:40,838 INFO L462 AbstractCegarLoop]: Abstraction has 2114 states and 2598 transitions. [2019-11-19 18:58:40,838 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 18:58:40,838 INFO L276 IsEmpty]: Start isEmpty. Operand 2114 states and 2598 transitions. [2019-11-19 18:58:40,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-11-19 18:58:40,841 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:58:40,841 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-19 18:58:40,842 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:58:40,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:58:40,842 INFO L82 PathProgramCache]: Analyzing trace with hash 233862118, now seen corresponding path program 1 times [2019-11-19 18:58:40,843 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 18:58:40,848 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808056957] [2019-11-19 18:58:40,848 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 18:58:40,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:40,882 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-19 18:58:40,883 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808056957] [2019-11-19 18:58:40,883 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 18:58:40,884 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 18:58:40,884 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766233819] [2019-11-19 18:58:40,885 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 18:58:40,885 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 18:58:40,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 18:58:40,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 18:58:40,886 INFO L87 Difference]: Start difference. First operand 2114 states and 2598 transitions. Second operand 3 states. [2019-11-19 18:58:41,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 18:58:41,079 INFO L93 Difference]: Finished difference Result 4158 states and 5120 transitions. [2019-11-19 18:58:41,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 18:58:41,080 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 82 [2019-11-19 18:58:41,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 18:58:41,091 INFO L225 Difference]: With dead ends: 4158 [2019-11-19 18:58:41,092 INFO L226 Difference]: Without dead ends: 2082 [2019-11-19 18:58:41,097 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-19 18:58:41,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2082 states. [2019-11-19 18:58:41,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2082 to 2082. [2019-11-19 18:58:41,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2082 states. [2019-11-19 18:58:41,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2082 states to 2082 states and 2563 transitions. [2019-11-19 18:58:41,228 INFO L78 Accepts]: Start accepts. Automaton has 2082 states and 2563 transitions. Word has length 82 [2019-11-19 18:58:41,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 18:58:41,229 INFO L462 AbstractCegarLoop]: Abstraction has 2082 states and 2563 transitions. [2019-11-19 18:58:41,229 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 18:58:41,229 INFO L276 IsEmpty]: Start isEmpty. Operand 2082 states and 2563 transitions. [2019-11-19 18:58:41,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-11-19 18:58:41,232 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:58:41,232 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-19 18:58:41,232 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:58:41,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:58:41,233 INFO L82 PathProgramCache]: Analyzing trace with hash 794948131, now seen corresponding path program 1 times [2019-11-19 18:58:41,233 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 18:58:41,233 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301205431] [2019-11-19 18:58:41,234 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 18:58:41,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:41,275 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-19 18:58:41,276 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301205431] [2019-11-19 18:58:41,277 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 18:58:41,277 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 18:58:41,277 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378765237] [2019-11-19 18:58:41,278 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 18:58:41,278 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 18:58:41,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 18:58:41,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 18:58:41,279 INFO L87 Difference]: Start difference. First operand 2082 states and 2563 transitions. Second operand 3 states. [2019-11-19 18:58:41,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 18:58:41,505 INFO L93 Difference]: Finished difference Result 5880 states and 7201 transitions. [2019-11-19 18:58:41,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 18:58:41,506 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2019-11-19 18:58:41,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 18:58:41,519 INFO L225 Difference]: With dead ends: 5880 [2019-11-19 18:58:41,520 INFO L226 Difference]: Without dead ends: 2958 [2019-11-19 18:58:41,526 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-19 18:58:41,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2958 states. [2019-11-19 18:58:41,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2958 to 2958. [2019-11-19 18:58:41,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2958 states. [2019-11-19 18:58:41,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2958 states to 2958 states and 3600 transitions. [2019-11-19 18:58:41,726 INFO L78 Accepts]: Start accepts. Automaton has 2958 states and 3600 transitions. Word has length 83 [2019-11-19 18:58:41,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 18:58:41,726 INFO L462 AbstractCegarLoop]: Abstraction has 2958 states and 3600 transitions. [2019-11-19 18:58:41,726 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 18:58:41,726 INFO L276 IsEmpty]: Start isEmpty. Operand 2958 states and 3600 transitions. [2019-11-19 18:58:41,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-11-19 18:58:41,729 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:58:41,730 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-19 18:58:41,730 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:58:41,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:58:41,730 INFO L82 PathProgramCache]: Analyzing trace with hash -471564153, now seen corresponding path program 1 times [2019-11-19 18:58:41,731 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 18:58:41,731 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901347839] [2019-11-19 18:58:41,731 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 18:58:41,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:41,786 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-19 18:58:41,786 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901347839] [2019-11-19 18:58:41,789 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 18:58:41,789 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-19 18:58:41,790 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409205836] [2019-11-19 18:58:41,790 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 18:58:41,790 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 18:58:41,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 18:58:41,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 18:58:41,791 INFO L87 Difference]: Start difference. First operand 2958 states and 3600 transitions. Second operand 3 states. [2019-11-19 18:58:42,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 18:58:42,079 INFO L93 Difference]: Finished difference Result 6752 states and 8190 transitions. [2019-11-19 18:58:42,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 18:58:42,080 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 106 [2019-11-19 18:58:42,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 18:58:42,099 INFO L225 Difference]: With dead ends: 6752 [2019-11-19 18:58:42,100 INFO L226 Difference]: Without dead ends: 3821 [2019-11-19 18:58:42,106 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-19 18:58:42,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3821 states. [2019-11-19 18:58:42,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3821 to 3797. [2019-11-19 18:58:42,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3797 states. [2019-11-19 18:58:42,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3797 states to 3797 states and 4566 transitions. [2019-11-19 18:58:42,373 INFO L78 Accepts]: Start accepts. Automaton has 3797 states and 4566 transitions. Word has length 106 [2019-11-19 18:58:42,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 18:58:42,373 INFO L462 AbstractCegarLoop]: Abstraction has 3797 states and 4566 transitions. [2019-11-19 18:58:42,373 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 18:58:42,374 INFO L276 IsEmpty]: Start isEmpty. Operand 3797 states and 4566 transitions. [2019-11-19 18:58:42,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-11-19 18:58:42,377 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:58:42,378 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-19 18:58:42,378 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:58:42,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:58:42,378 INFO L82 PathProgramCache]: Analyzing trace with hash -264530006, now seen corresponding path program 1 times [2019-11-19 18:58:42,378 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 18:58:42,379 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998725204] [2019-11-19 18:58:42,379 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 18:58:42,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:42,412 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-19 18:58:42,413 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998725204] [2019-11-19 18:58:42,413 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 18:58:42,414 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 18:58:42,414 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485681887] [2019-11-19 18:58:42,414 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 18:58:42,414 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 18:58:42,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 18:58:42,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 18:58:42,415 INFO L87 Difference]: Start difference. First operand 3797 states and 4566 transitions. Second operand 3 states. [2019-11-19 18:58:42,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 18:58:42,604 INFO L93 Difference]: Finished difference Result 7467 states and 8962 transitions. [2019-11-19 18:58:42,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 18:58:42,604 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 120 [2019-11-19 18:58:42,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 18:58:42,620 INFO L225 Difference]: With dead ends: 7467 [2019-11-19 18:58:42,621 INFO L226 Difference]: Without dead ends: 3707 [2019-11-19 18:58:42,627 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-19 18:58:42,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3707 states. [2019-11-19 18:58:42,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3707 to 3707. [2019-11-19 18:58:42,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3707 states. [2019-11-19 18:58:42,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3707 states to 3707 states and 4354 transitions. [2019-11-19 18:58:42,836 INFO L78 Accepts]: Start accepts. Automaton has 3707 states and 4354 transitions. Word has length 120 [2019-11-19 18:58:42,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 18:58:42,837 INFO L462 AbstractCegarLoop]: Abstraction has 3707 states and 4354 transitions. [2019-11-19 18:58:42,837 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 18:58:42,837 INFO L276 IsEmpty]: Start isEmpty. Operand 3707 states and 4354 transitions. [2019-11-19 18:58:42,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-11-19 18:58:42,841 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:58:42,841 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-19 18:58:42,842 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:58:42,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:58:42,842 INFO L82 PathProgramCache]: Analyzing trace with hash 1818985301, now seen corresponding path program 1 times [2019-11-19 18:58:42,843 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 18:58:42,843 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191470054] [2019-11-19 18:58:42,843 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 18:58:42,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:42,890 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-19 18:58:42,891 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191470054] [2019-11-19 18:58:42,891 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 18:58:42,891 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 18:58:42,892 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016374398] [2019-11-19 18:58:42,892 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 18:58:42,893 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 18:58:42,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 18:58:42,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 18:58:42,894 INFO L87 Difference]: Start difference. First operand 3707 states and 4354 transitions. Second operand 3 states. [2019-11-19 18:58:43,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 18:58:43,123 INFO L93 Difference]: Finished difference Result 6571 states and 7758 transitions. [2019-11-19 18:58:43,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 18:58:43,123 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 121 [2019-11-19 18:58:43,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 18:58:43,138 INFO L225 Difference]: With dead ends: 6571 [2019-11-19 18:58:43,139 INFO L226 Difference]: Without dead ends: 3723 [2019-11-19 18:58:43,143 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-19 18:58:43,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3723 states. [2019-11-19 18:58:43,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3723 to 3707. [2019-11-19 18:58:43,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3707 states. [2019-11-19 18:58:43,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3707 states to 3707 states and 4262 transitions. [2019-11-19 18:58:43,352 INFO L78 Accepts]: Start accepts. Automaton has 3707 states and 4262 transitions. Word has length 121 [2019-11-19 18:58:43,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 18:58:43,352 INFO L462 AbstractCegarLoop]: Abstraction has 3707 states and 4262 transitions. [2019-11-19 18:58:43,353 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 18:58:43,353 INFO L276 IsEmpty]: Start isEmpty. Operand 3707 states and 4262 transitions. [2019-11-19 18:58:43,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-11-19 18:58:43,359 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:58:43,359 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-19 18:58:43,359 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:58:43,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:58:43,360 INFO L82 PathProgramCache]: Analyzing trace with hash -654472485, now seen corresponding path program 1 times [2019-11-19 18:58:43,361 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 18:58:43,362 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49407665] [2019-11-19 18:58:43,362 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 18:58:43,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:43,405 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-19 18:58:43,406 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49407665] [2019-11-19 18:58:43,406 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 18:58:43,406 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 18:58:43,406 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079054265] [2019-11-19 18:58:43,408 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 18:58:43,408 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 18:58:43,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 18:58:43,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 18:58:43,409 INFO L87 Difference]: Start difference. First operand 3707 states and 4262 transitions. Second operand 3 states. [2019-11-19 18:58:43,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 18:58:43,580 INFO L93 Difference]: Finished difference Result 6559 states and 7560 transitions. [2019-11-19 18:58:43,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 18:58:43,581 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 122 [2019-11-19 18:58:43,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 18:58:43,596 INFO L225 Difference]: With dead ends: 6559 [2019-11-19 18:58:43,597 INFO L226 Difference]: Without dead ends: 3711 [2019-11-19 18:58:43,602 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-19 18:58:43,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3711 states. [2019-11-19 18:58:43,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3711 to 3707. [2019-11-19 18:58:43,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3707 states. [2019-11-19 18:58:43,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3707 states to 3707 states and 4244 transitions. [2019-11-19 18:58:43,779 INFO L78 Accepts]: Start accepts. Automaton has 3707 states and 4244 transitions. Word has length 122 [2019-11-19 18:58:43,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 18:58:43,780 INFO L462 AbstractCegarLoop]: Abstraction has 3707 states and 4244 transitions. [2019-11-19 18:58:43,780 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 18:58:43,780 INFO L276 IsEmpty]: Start isEmpty. Operand 3707 states and 4244 transitions. [2019-11-19 18:58:43,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-11-19 18:58:43,784 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:58:43,785 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-19 18:58:43,785 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:58:43,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:58:43,785 INFO L82 PathProgramCache]: Analyzing trace with hash -1028326263, now seen corresponding path program 1 times [2019-11-19 18:58:43,785 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 18:58:43,786 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425497109] [2019-11-19 18:58:43,786 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 18:58:43,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:43,835 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-19 18:58:43,835 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425497109] [2019-11-19 18:58:43,836 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 18:58:43,836 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-19 18:58:43,836 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443341489] [2019-11-19 18:58:43,836 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 18:58:43,837 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 18:58:43,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 18:58:43,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 18:58:43,837 INFO L87 Difference]: Start difference. First operand 3707 states and 4244 transitions. Second operand 3 states. [2019-11-19 18:58:44,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 18:58:44,098 INFO L93 Difference]: Finished difference Result 8135 states and 9290 transitions. [2019-11-19 18:58:44,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 18:58:44,099 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 145 [2019-11-19 18:58:44,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 18:58:44,121 INFO L225 Difference]: With dead ends: 8135 [2019-11-19 18:58:44,122 INFO L226 Difference]: Without dead ends: 4448 [2019-11-19 18:58:44,127 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-19 18:58:44,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4448 states. [2019-11-19 18:58:44,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4448 to 4416. [2019-11-19 18:58:44,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4416 states. [2019-11-19 18:58:44,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4416 states to 4416 states and 5010 transitions. [2019-11-19 18:58:44,370 INFO L78 Accepts]: Start accepts. Automaton has 4416 states and 5010 transitions. Word has length 145 [2019-11-19 18:58:44,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 18:58:44,370 INFO L462 AbstractCegarLoop]: Abstraction has 4416 states and 5010 transitions. [2019-11-19 18:58:44,370 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 18:58:44,371 INFO L276 IsEmpty]: Start isEmpty. Operand 4416 states and 5010 transitions. [2019-11-19 18:58:44,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-11-19 18:58:44,376 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:58:44,376 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-19 18:58:44,376 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:58:44,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:58:44,377 INFO L82 PathProgramCache]: Analyzing trace with hash 1098265157, now seen corresponding path program 1 times [2019-11-19 18:58:44,377 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 18:58:44,377 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789092960] [2019-11-19 18:58:44,377 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 18:58:44,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:44,424 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-19 18:58:44,425 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789092960] [2019-11-19 18:58:44,425 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 18:58:44,425 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 18:58:44,425 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950725539] [2019-11-19 18:58:44,426 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 18:58:44,426 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 18:58:44,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 18:58:44,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 18:58:44,427 INFO L87 Difference]: Start difference. First operand 4416 states and 5010 transitions. Second operand 3 states. [2019-11-19 18:58:44,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 18:58:44,573 INFO L93 Difference]: Finished difference Result 6055 states and 6869 transitions. [2019-11-19 18:58:44,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 18:58:44,573 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 148 [2019-11-19 18:58:44,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 18:58:44,577 INFO L225 Difference]: With dead ends: 6055 [2019-11-19 18:58:44,577 INFO L226 Difference]: Without dead ends: 1503 [2019-11-19 18:58:44,583 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-19 18:58:44,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1503 states. [2019-11-19 18:58:44,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1503 to 1503. [2019-11-19 18:58:44,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1503 states. [2019-11-19 18:58:44,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1503 states to 1503 states and 1647 transitions. [2019-11-19 18:58:44,634 INFO L78 Accepts]: Start accepts. Automaton has 1503 states and 1647 transitions. Word has length 148 [2019-11-19 18:58:44,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 18:58:44,635 INFO L462 AbstractCegarLoop]: Abstraction has 1503 states and 1647 transitions. [2019-11-19 18:58:44,635 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 18:58:44,635 INFO L276 IsEmpty]: Start isEmpty. Operand 1503 states and 1647 transitions. [2019-11-19 18:58:44,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-11-19 18:58:44,637 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:58:44,638 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-19 18:58:44,638 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:58:44,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:58:44,638 INFO L82 PathProgramCache]: Analyzing trace with hash -2040513564, now seen corresponding path program 1 times [2019-11-19 18:58:44,638 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 18:58:44,639 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314566979] [2019-11-19 18:58:44,639 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 18:58:44,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:44,685 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-19 18:58:44,685 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314566979] [2019-11-19 18:58:44,686 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 18:58:44,686 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 18:58:44,686 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34929608] [2019-11-19 18:58:44,687 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 18:58:44,687 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 18:58:44,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 18:58:44,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 18:58:44,688 INFO L87 Difference]: Start difference. First operand 1503 states and 1647 transitions. Second operand 3 states. [2019-11-19 18:58:44,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 18:58:44,776 INFO L93 Difference]: Finished difference Result 2346 states and 2580 transitions. [2019-11-19 18:58:44,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 18:58:44,777 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 149 [2019-11-19 18:58:44,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 18:58:44,780 INFO L225 Difference]: With dead ends: 2346 [2019-11-19 18:58:44,780 INFO L226 Difference]: Without dead ends: 1539 [2019-11-19 18:58:44,782 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-19 18:58:44,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1539 states. [2019-11-19 18:58:44,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1539 to 1503. [2019-11-19 18:58:44,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1503 states. [2019-11-19 18:58:44,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1503 states to 1503 states and 1627 transitions. [2019-11-19 18:58:44,845 INFO L78 Accepts]: Start accepts. Automaton has 1503 states and 1627 transitions. Word has length 149 [2019-11-19 18:58:44,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 18:58:44,846 INFO L462 AbstractCegarLoop]: Abstraction has 1503 states and 1627 transitions. [2019-11-19 18:58:44,846 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 18:58:44,846 INFO L276 IsEmpty]: Start isEmpty. Operand 1503 states and 1627 transitions. [2019-11-19 18:58:44,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-11-19 18:58:44,849 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:58:44,849 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-19 18:58:44,849 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:58:44,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:58:44,850 INFO L82 PathProgramCache]: Analyzing trace with hash -1275276035, now seen corresponding path program 1 times [2019-11-19 18:58:44,850 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 18:58:44,850 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023310601] [2019-11-19 18:58:44,851 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 18:58:44,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:44,903 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-19 18:58:44,903 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023310601] [2019-11-19 18:58:44,903 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 18:58:44,904 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 18:58:44,904 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373034827] [2019-11-19 18:58:44,904 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 18:58:44,905 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 18:58:44,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 18:58:44,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 18:58:44,905 INFO L87 Difference]: Start difference. First operand 1503 states and 1627 transitions. Second operand 3 states. [2019-11-19 18:58:45,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 18:58:45,002 INFO L93 Difference]: Finished difference Result 2657 states and 2881 transitions. [2019-11-19 18:58:45,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 18:58:45,003 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 150 [2019-11-19 18:58:45,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 18:58:45,006 INFO L225 Difference]: With dead ends: 2657 [2019-11-19 18:58:45,006 INFO L226 Difference]: Without dead ends: 1503 [2019-11-19 18:58:45,008 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-19 18:58:45,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1503 states. [2019-11-19 18:58:45,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1503 to 1503. [2019-11-19 18:58:45,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1503 states. [2019-11-19 18:58:45,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1503 states to 1503 states and 1605 transitions. [2019-11-19 18:58:45,066 INFO L78 Accepts]: Start accepts. Automaton has 1503 states and 1605 transitions. Word has length 150 [2019-11-19 18:58:45,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 18:58:45,066 INFO L462 AbstractCegarLoop]: Abstraction has 1503 states and 1605 transitions. [2019-11-19 18:58:45,067 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 18:58:45,067 INFO L276 IsEmpty]: Start isEmpty. Operand 1503 states and 1605 transitions. [2019-11-19 18:58:45,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-11-19 18:58:45,069 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:58:45,069 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-19 18:58:45,070 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:58:45,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:58:45,070 INFO L82 PathProgramCache]: Analyzing trace with hash -660923245, now seen corresponding path program 1 times [2019-11-19 18:58:45,071 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 18:58:45,071 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084869430] [2019-11-19 18:58:45,071 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 18:58:45,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:45,209 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-19 18:58:45,210 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084869430] [2019-11-19 18:58:45,210 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 18:58:45,210 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-19 18:58:45,211 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965255255] [2019-11-19 18:58:45,211 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-19 18:58:45,211 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 18:58:45,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-19 18:58:45,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-19 18:58:45,212 INFO L87 Difference]: Start difference. First operand 1503 states and 1605 transitions. Second operand 5 states. [2019-11-19 18:58:45,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 18:58:45,373 INFO L93 Difference]: Finished difference Result 1503 states and 1605 transitions. [2019-11-19 18:58:45,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-19 18:58:45,374 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 152 [2019-11-19 18:58:45,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 18:58:45,377 INFO L225 Difference]: With dead ends: 1503 [2019-11-19 18:58:45,378 INFO L226 Difference]: Without dead ends: 1501 [2019-11-19 18:58:45,378 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-19 18:58:45,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1501 states. [2019-11-19 18:58:45,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1501 to 1501. [2019-11-19 18:58:45,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1501 states. [2019-11-19 18:58:45,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1501 states to 1501 states and 1602 transitions. [2019-11-19 18:58:45,467 INFO L78 Accepts]: Start accepts. Automaton has 1501 states and 1602 transitions. Word has length 152 [2019-11-19 18:58:45,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 18:58:45,467 INFO L462 AbstractCegarLoop]: Abstraction has 1501 states and 1602 transitions. [2019-11-19 18:58:45,468 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-19 18:58:45,468 INFO L276 IsEmpty]: Start isEmpty. Operand 1501 states and 1602 transitions. [2019-11-19 18:58:45,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-11-19 18:58:45,470 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:58:45,470 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-19 18:58:45,471 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:58:45,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:58:45,471 INFO L82 PathProgramCache]: Analyzing trace with hash -1317806111, now seen corresponding path program 1 times [2019-11-19 18:58:45,471 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 18:58:45,472 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484042901] [2019-11-19 18:58:45,472 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 18:58:45,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:45,517 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-19 18:58:45,517 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484042901] [2019-11-19 18:58:45,518 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 18:58:45,518 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 18:58:45,518 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066086290] [2019-11-19 18:58:45,519 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 18:58:45,519 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 18:58:45,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 18:58:45,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 18:58:45,520 INFO L87 Difference]: Start difference. First operand 1501 states and 1602 transitions. Second operand 3 states. [2019-11-19 18:58:45,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 18:58:45,654 INFO L93 Difference]: Finished difference Result 2757 states and 2935 transitions. [2019-11-19 18:58:45,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 18:58:45,655 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 156 [2019-11-19 18:58:45,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 18:58:45,661 INFO L225 Difference]: With dead ends: 2757 [2019-11-19 18:58:45,661 INFO L226 Difference]: Without dead ends: 2121 [2019-11-19 18:58:45,663 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-19 18:58:45,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2121 states. [2019-11-19 18:58:45,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2121 to 1503. [2019-11-19 18:58:45,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1503 states. [2019-11-19 18:58:45,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1503 states to 1503 states and 1604 transitions. [2019-11-19 18:58:45,808 INFO L78 Accepts]: Start accepts. Automaton has 1503 states and 1604 transitions. Word has length 156 [2019-11-19 18:58:45,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 18:58:45,809 INFO L462 AbstractCegarLoop]: Abstraction has 1503 states and 1604 transitions. [2019-11-19 18:58:45,809 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 18:58:45,809 INFO L276 IsEmpty]: Start isEmpty. Operand 1503 states and 1604 transitions. [2019-11-19 18:58:45,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-11-19 18:58:45,812 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:58:45,813 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-19 18:58:45,813 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:58:45,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:58:45,814 INFO L82 PathProgramCache]: Analyzing trace with hash 1860246650, now seen corresponding path program 1 times [2019-11-19 18:58:45,814 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 18:58:45,815 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64708672] [2019-11-19 18:58:45,815 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 18:58:45,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 18:58:45,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 18:58:46,005 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 18:58:46,005 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-19 18:58:46,209 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 06:58:46 BoogieIcfgContainer [2019-11-19 18:58:46,209 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-19 18:58:46,210 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-19 18:58:46,210 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-19 18:58:46,210 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-19 18:58:46,211 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:58:37" (3/4) ... [2019-11-19 18:58:46,214 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-19 18:58:46,391 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-19 18:58:46,392 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-19 18:58:46,394 INFO L168 Benchmark]: Toolchain (without parser) took 10665.47 ms. Allocated memory was 1.0 GB in the beginning and 1.8 GB in the end (delta: 751.8 MB). Free memory was 952.3 MB in the beginning and 1.4 GB in the end (delta: -463.3 MB). Peak memory consumption was 288.6 MB. Max. memory is 11.5 GB. [2019-11-19 18:58:46,395 INFO L168 Benchmark]: CDTParser took 0.62 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-19 18:58:46,395 INFO L168 Benchmark]: CACSL2BoogieTranslator took 483.00 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.1 MB). Free memory was 952.3 MB in the beginning and 1.1 GB in the end (delta: -168.4 MB). Peak memory consumption was 26.1 MB. Max. memory is 11.5 GB. [2019-11-19 18:58:46,396 INFO L168 Benchmark]: Boogie Procedure Inliner took 63.51 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-19 18:58:46,396 INFO L168 Benchmark]: Boogie Preprocessor took 51.98 ms. Allocated memory is still 1.2 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-19 18:58:46,396 INFO L168 Benchmark]: RCFGBuilder took 957.00 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 64.0 MB). Peak memory consumption was 64.0 MB. Max. memory is 11.5 GB. [2019-11-19 18:58:46,397 INFO L168 Benchmark]: TraceAbstraction took 8922.06 ms. Allocated memory was 1.2 GB in the beginning and 1.8 GB in the end (delta: 620.8 MB). Free memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: -384.1 MB). Peak memory consumption was 236.7 MB. Max. memory is 11.5 GB. [2019-11-19 18:58:46,397 INFO L168 Benchmark]: Witness Printer took 182.07 ms. Allocated memory is still 1.8 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 18.5 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. [2019-11-19 18:58:46,399 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.62 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 483.00 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.1 MB). Free memory was 952.3 MB in the beginning and 1.1 GB in the end (delta: -168.4 MB). Peak memory consumption was 26.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 63.51 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 51.98 ms. Allocated memory is still 1.2 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 957.00 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 64.0 MB). Peak memory consumption was 64.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 8922.06 ms. Allocated memory was 1.2 GB in the beginning and 1.8 GB in the end (delta: 620.8 MB). Free memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: -384.1 MB). Peak memory consumption was 236.7 MB. Max. memory is 11.5 GB. * Witness Printer took 182.07 ms. Allocated memory is still 1.8 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 18.5 MB). Peak memory consumption was 18.5 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: 8.8s, OverallIterations: 26, TraceHistogramMax: 3, AutomataDifference: 3.9s, 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.6s AutomataMinimizationTime, 25 MinimizatonAttempts, 1848 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.8s 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...