./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 30f4e4ab 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-30f4e4a [2019-11-28 00:27:17,923 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 00:27:17,926 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 00:27:17,943 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 00:27:17,944 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 00:27:17,945 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 00:27:17,947 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 00:27:17,949 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 00:27:17,951 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 00:27:17,952 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 00:27:17,953 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 00:27:17,954 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 00:27:17,955 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 00:27:17,956 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 00:27:17,957 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 00:27:17,958 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 00:27:17,959 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 00:27:17,960 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 00:27:17,962 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 00:27:17,964 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 00:27:17,966 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 00:27:17,967 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 00:27:17,968 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 00:27:17,969 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 00:27:17,972 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 00:27:17,972 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 00:27:17,973 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 00:27:17,974 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 00:27:17,974 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 00:27:17,975 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 00:27:17,976 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 00:27:17,977 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 00:27:17,978 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 00:27:17,979 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 00:27:17,980 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 00:27:17,980 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 00:27:17,981 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 00:27:17,981 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 00:27:17,982 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 00:27:17,984 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 00:27:17,985 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 00:27:17,987 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-28 00:27:18,003 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 00:27:18,003 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 00:27:18,005 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 00:27:18,005 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 00:27:18,005 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 00:27:18,006 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 00:27:18,006 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 00:27:18,006 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 00:27:18,007 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 00:27:18,007 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 00:27:18,007 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 00:27:18,007 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 00:27:18,008 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 00:27:18,008 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 00:27:18,008 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 00:27:18,009 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 00:27:18,009 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 00:27:18,009 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 00:27:18,009 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 00:27:18,010 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 00:27:18,010 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 00:27:18,010 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 00:27:18,011 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 00:27:18,011 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 00:27:18,011 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 00:27:18,012 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 00:27:18,012 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 00:27:18,012 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 00:27:18,012 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 216b1eba72c80bc0eec8bb9ab0298bf8baf472d8 [2019-11-28 00:27:18,395 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 00:27:18,417 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 00:27:18,421 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 00:27:18,423 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 00:27:18,423 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 00:27:18,425 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/systemc/token_ring.02.cil-2.c [2019-11-28 00:27:18,499 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/83ad97365/5b583116760740b999efcbd92aa3f09a/FLAG6dd958d54 [2019-11-28 00:27:19,047 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 00:27:19,049 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/token_ring.02.cil-2.c [2019-11-28 00:27:19,066 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/83ad97365/5b583116760740b999efcbd92aa3f09a/FLAG6dd958d54 [2019-11-28 00:27:19,343 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/83ad97365/5b583116760740b999efcbd92aa3f09a [2019-11-28 00:27:19,347 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 00:27:19,349 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 00:27:19,350 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 00:27:19,350 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 00:27:19,354 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 00:27:19,355 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 12:27:19" (1/1) ... [2019-11-28 00:27:19,358 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5562b866 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:27:19, skipping insertion in model container [2019-11-28 00:27:19,358 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 12:27:19" (1/1) ... [2019-11-28 00:27:19,366 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 00:27:19,408 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 00:27:19,660 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 00:27:19,670 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 00:27:19,789 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 00:27:19,815 INFO L208 MainTranslator]: Completed translation [2019-11-28 00:27:19,815 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:27:19 WrapperNode [2019-11-28 00:27:19,815 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 00:27:19,816 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 00:27:19,816 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 00:27:19,816 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 00:27:19,824 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:27:19" (1/1) ... [2019-11-28 00:27:19,832 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:27:19" (1/1) ... [2019-11-28 00:27:19,876 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 00:27:19,877 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 00:27:19,877 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 00:27:19,878 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 00:27:19,887 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:27:19" (1/1) ... [2019-11-28 00:27:19,887 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:27:19" (1/1) ... [2019-11-28 00:27:19,892 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:27:19" (1/1) ... [2019-11-28 00:27:19,893 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:27:19" (1/1) ... [2019-11-28 00:27:19,903 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:27:19" (1/1) ... [2019-11-28 00:27:19,916 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:27:19" (1/1) ... [2019-11-28 00:27:19,920 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:27:19" (1/1) ... [2019-11-28 00:27:19,927 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 00:27:19,928 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 00:27:19,928 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 00:27:19,928 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 00:27:19,929 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:27:19" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 00:27:20,016 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 00:27:20,017 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 00:27:20,936 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 00:27:20,936 INFO L297 CfgBuilder]: Removed 105 assume(true) statements. [2019-11-28 00:27:20,938 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:27:20 BoogieIcfgContainer [2019-11-28 00:27:20,939 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 00:27:20,941 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 00:27:20,942 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 00:27:20,945 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 00:27:20,945 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 12:27:19" (1/3) ... [2019-11-28 00:27:20,949 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c47c054 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 12:27:20, skipping insertion in model container [2019-11-28 00:27:20,950 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:27:19" (2/3) ... [2019-11-28 00:27:20,951 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c47c054 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 12:27:20, skipping insertion in model container [2019-11-28 00:27:20,951 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:27:20" (3/3) ... [2019-11-28 00:27:20,953 INFO L109 eAbstractionObserver]: Analyzing ICFG token_ring.02.cil-2.c [2019-11-28 00:27:20,963 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 00:27:20,973 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-11-28 00:27:20,987 INFO L249 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2019-11-28 00:27:21,036 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 00:27:21,036 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 00:27:21,036 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 00:27:21,037 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 00:27:21,037 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 00:27:21,037 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 00:27:21,037 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 00:27:21,037 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 00:27:21,070 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states. [2019-11-28 00:27:21,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-28 00:27:21,084 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:27:21,085 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:27:21,086 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:27:21,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:27:21,093 INFO L82 PathProgramCache]: Analyzing trace with hash 603110903, now seen corresponding path program 1 times [2019-11-28 00:27:21,102 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:27:21,102 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124348041] [2019-11-28 00:27:21,102 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:27:21,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:27:21,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 00:27:21,264 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124348041] [2019-11-28 00:27:21,265 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:27:21,266 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 00:27:21,268 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431292897] [2019-11-28 00:27:21,274 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 00:27:21,275 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:27:21,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 00:27:21,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 00:27:21,294 INFO L87 Difference]: Start difference. First operand 225 states. Second operand 3 states. [2019-11-28 00:27:21,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:27:21,370 INFO L93 Difference]: Finished difference Result 445 states and 697 transitions. [2019-11-28 00:27:21,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 00:27:21,373 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2019-11-28 00:27:21,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:27:21,392 INFO L225 Difference]: With dead ends: 445 [2019-11-28 00:27:21,393 INFO L226 Difference]: Without dead ends: 221 [2019-11-28 00:27:21,403 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 00:27:21,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2019-11-28 00:27:21,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 221. [2019-11-28 00:27:21,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2019-11-28 00:27:21,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 335 transitions. [2019-11-28 00:27:21,519 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 335 transitions. Word has length 50 [2019-11-28 00:27:21,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:27:21,520 INFO L462 AbstractCegarLoop]: Abstraction has 221 states and 335 transitions. [2019-11-28 00:27:21,520 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 00:27:21,521 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 335 transitions. [2019-11-28 00:27:21,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-28 00:27:21,525 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:27:21,526 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:27:21,526 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:27:21,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:27:21,527 INFO L82 PathProgramCache]: Analyzing trace with hash -1325161799, now seen corresponding path program 1 times [2019-11-28 00:27:21,527 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:27:21,528 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809812084] [2019-11-28 00:27:21,528 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:27:21,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:27:21,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 00:27:21,641 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809812084] [2019-11-28 00:27:21,641 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:27:21,642 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 00:27:21,642 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130945138] [2019-11-28 00:27:21,648 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 00:27:21,649 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:27:21,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 00:27:21,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 00:27:21,650 INFO L87 Difference]: Start difference. First operand 221 states and 335 transitions. Second operand 3 states. [2019-11-28 00:27:21,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:27:21,742 INFO L93 Difference]: Finished difference Result 595 states and 901 transitions. [2019-11-28 00:27:21,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 00:27:21,743 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2019-11-28 00:27:21,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:27:21,751 INFO L225 Difference]: With dead ends: 595 [2019-11-28 00:27:21,752 INFO L226 Difference]: Without dead ends: 381 [2019-11-28 00:27:21,754 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 00:27:21,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2019-11-28 00:27:21,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 377. [2019-11-28 00:27:21,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2019-11-28 00:27:21,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 570 transitions. [2019-11-28 00:27:21,811 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 570 transitions. Word has length 50 [2019-11-28 00:27:21,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:27:21,812 INFO L462 AbstractCegarLoop]: Abstraction has 377 states and 570 transitions. [2019-11-28 00:27:21,812 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 00:27:21,812 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 570 transitions. [2019-11-28 00:27:21,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-28 00:27:21,815 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:27:21,815 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:27:21,816 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:27:21,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:27:21,817 INFO L82 PathProgramCache]: Analyzing trace with hash 102769205, now seen corresponding path program 1 times [2019-11-28 00:27:21,817 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:27:21,817 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867833992] [2019-11-28 00:27:21,818 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:27:21,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:27:21,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 00:27:21,888 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867833992] [2019-11-28 00:27:21,888 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:27:21,889 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 00:27:21,890 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523348414] [2019-11-28 00:27:21,890 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 00:27:21,890 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:27:21,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 00:27:21,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 00:27:21,893 INFO L87 Difference]: Start difference. First operand 377 states and 570 transitions. Second operand 3 states. [2019-11-28 00:27:21,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:27:21,940 INFO L93 Difference]: Finished difference Result 746 states and 1129 transitions. [2019-11-28 00:27:21,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 00:27:21,940 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2019-11-28 00:27:21,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:27:21,943 INFO L225 Difference]: With dead ends: 746 [2019-11-28 00:27:21,943 INFO L226 Difference]: Without dead ends: 377 [2019-11-28 00:27:21,946 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 00:27:21,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2019-11-28 00:27:21,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 377. [2019-11-28 00:27:21,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2019-11-28 00:27:21,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 562 transitions. [2019-11-28 00:27:21,969 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 562 transitions. Word has length 50 [2019-11-28 00:27:21,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:27:21,969 INFO L462 AbstractCegarLoop]: Abstraction has 377 states and 562 transitions. [2019-11-28 00:27:21,970 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 00:27:21,970 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 562 transitions. [2019-11-28 00:27:21,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-28 00:27:21,971 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:27:21,972 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:27:21,972 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:27:21,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:27:21,976 INFO L82 PathProgramCache]: Analyzing trace with hash 1811399481, now seen corresponding path program 1 times [2019-11-28 00:27:21,976 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:27:21,976 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263269603] [2019-11-28 00:27:21,977 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:27:21,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:27:22,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 00:27:22,044 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263269603] [2019-11-28 00:27:22,044 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:27:22,045 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 00:27:22,045 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421542430] [2019-11-28 00:27:22,046 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 00:27:22,046 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:27:22,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 00:27:22,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 00:27:22,047 INFO L87 Difference]: Start difference. First operand 377 states and 562 transitions. Second operand 3 states. [2019-11-28 00:27:22,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:27:22,091 INFO L93 Difference]: Finished difference Result 745 states and 1112 transitions. [2019-11-28 00:27:22,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 00:27:22,091 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2019-11-28 00:27:22,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:27:22,094 INFO L225 Difference]: With dead ends: 745 [2019-11-28 00:27:22,094 INFO L226 Difference]: Without dead ends: 377 [2019-11-28 00:27:22,096 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 00:27:22,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2019-11-28 00:27:22,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 377. [2019-11-28 00:27:22,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2019-11-28 00:27:22,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 554 transitions. [2019-11-28 00:27:22,117 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 554 transitions. Word has length 50 [2019-11-28 00:27:22,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:27:22,118 INFO L462 AbstractCegarLoop]: Abstraction has 377 states and 554 transitions. [2019-11-28 00:27:22,118 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 00:27:22,118 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 554 transitions. [2019-11-28 00:27:22,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-28 00:27:22,120 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:27:22,120 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:27:22,120 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:27:22,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:27:22,121 INFO L82 PathProgramCache]: Analyzing trace with hash 65401269, now seen corresponding path program 1 times [2019-11-28 00:27:22,121 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:27:22,122 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663082751] [2019-11-28 00:27:22,122 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:27:22,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:27:22,190 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 00:27:22,191 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663082751] [2019-11-28 00:27:22,191 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:27:22,191 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 00:27:22,192 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50403201] [2019-11-28 00:27:22,192 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 00:27:22,192 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:27:22,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 00:27:22,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 00:27:22,194 INFO L87 Difference]: Start difference. First operand 377 states and 554 transitions. Second operand 3 states. [2019-11-28 00:27:22,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:27:22,258 INFO L93 Difference]: Finished difference Result 744 states and 1095 transitions. [2019-11-28 00:27:22,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 00:27:22,259 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2019-11-28 00:27:22,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:27:22,262 INFO L225 Difference]: With dead ends: 744 [2019-11-28 00:27:22,262 INFO L226 Difference]: Without dead ends: 377 [2019-11-28 00:27:22,263 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 00:27:22,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2019-11-28 00:27:22,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 377. [2019-11-28 00:27:22,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2019-11-28 00:27:22,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 538 transitions. [2019-11-28 00:27:22,284 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 538 transitions. Word has length 50 [2019-11-28 00:27:22,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:27:22,284 INFO L462 AbstractCegarLoop]: Abstraction has 377 states and 538 transitions. [2019-11-28 00:27:22,285 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 00:27:22,285 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 538 transitions. [2019-11-28 00:27:22,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-28 00:27:22,286 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:27:22,286 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:27:22,286 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:27:22,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:27:22,287 INFO L82 PathProgramCache]: Analyzing trace with hash 25960058, now seen corresponding path program 1 times [2019-11-28 00:27:22,287 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:27:22,288 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470637364] [2019-11-28 00:27:22,288 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:27:22,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:27:22,315 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 00:27:22,316 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470637364] [2019-11-28 00:27:22,316 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:27:22,316 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 00:27:22,317 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642994833] [2019-11-28 00:27:22,317 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 00:27:22,317 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:27:22,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 00:27:22,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 00:27:22,318 INFO L87 Difference]: Start difference. First operand 377 states and 538 transitions. Second operand 3 states. [2019-11-28 00:27:22,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:27:22,377 INFO L93 Difference]: Finished difference Result 743 states and 1062 transitions. [2019-11-28 00:27:22,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 00:27:22,378 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2019-11-28 00:27:22,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:27:22,381 INFO L225 Difference]: With dead ends: 743 [2019-11-28 00:27:22,381 INFO L226 Difference]: Without dead ends: 377 [2019-11-28 00:27:22,382 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 00:27:22,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2019-11-28 00:27:22,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 377. [2019-11-28 00:27:22,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2019-11-28 00:27:22,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 522 transitions. [2019-11-28 00:27:22,405 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 522 transitions. Word has length 50 [2019-11-28 00:27:22,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:27:22,405 INFO L462 AbstractCegarLoop]: Abstraction has 377 states and 522 transitions. [2019-11-28 00:27:22,405 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 00:27:22,405 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 522 transitions. [2019-11-28 00:27:22,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-28 00:27:22,406 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:27:22,407 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:27:22,407 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:27:22,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:27:22,408 INFO L82 PathProgramCache]: Analyzing trace with hash 1177649081, now seen corresponding path program 1 times [2019-11-28 00:27:22,408 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:27:22,408 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662072876] [2019-11-28 00:27:22,408 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:27:22,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:27:22,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 00:27:22,454 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662072876] [2019-11-28 00:27:22,455 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:27:22,455 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 00:27:22,455 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455990766] [2019-11-28 00:27:22,455 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 00:27:22,456 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:27:22,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 00:27:22,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 00:27:22,466 INFO L87 Difference]: Start difference. First operand 377 states and 522 transitions. Second operand 3 states. [2019-11-28 00:27:22,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:27:22,538 INFO L93 Difference]: Finished difference Result 742 states and 1029 transitions. [2019-11-28 00:27:22,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 00:27:22,539 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2019-11-28 00:27:22,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:27:22,542 INFO L225 Difference]: With dead ends: 742 [2019-11-28 00:27:22,542 INFO L226 Difference]: Without dead ends: 377 [2019-11-28 00:27:22,543 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 00:27:22,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2019-11-28 00:27:22,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 377. [2019-11-28 00:27:22,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2019-11-28 00:27:22,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 506 transitions. [2019-11-28 00:27:22,567 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 506 transitions. Word has length 50 [2019-11-28 00:27:22,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:27:22,567 INFO L462 AbstractCegarLoop]: Abstraction has 377 states and 506 transitions. [2019-11-28 00:27:22,568 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 00:27:22,568 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 506 transitions. [2019-11-28 00:27:22,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-28 00:27:22,569 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:27:22,569 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:27:22,570 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:27:22,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:27:22,570 INFO L82 PathProgramCache]: Analyzing trace with hash -1947581763, now seen corresponding path program 1 times [2019-11-28 00:27:22,571 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:27:22,571 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587172832] [2019-11-28 00:27:22,571 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:27:22,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:27:22,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 00:27:22,663 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587172832] [2019-11-28 00:27:22,664 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:27:22,664 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 00:27:22,664 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231806793] [2019-11-28 00:27:22,665 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 00:27:22,665 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:27:22,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 00:27:22,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 00:27:22,666 INFO L87 Difference]: Start difference. First operand 377 states and 506 transitions. Second operand 3 states. [2019-11-28 00:27:22,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:27:22,748 INFO L93 Difference]: Finished difference Result 1050 states and 1412 transitions. [2019-11-28 00:27:22,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 00:27:22,748 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2019-11-28 00:27:22,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:27:22,753 INFO L225 Difference]: With dead ends: 1050 [2019-11-28 00:27:22,753 INFO L226 Difference]: Without dead ends: 687 [2019-11-28 00:27:22,754 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 00:27:22,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 687 states. [2019-11-28 00:27:22,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 687 to 649. [2019-11-28 00:27:22,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 649 states. [2019-11-28 00:27:22,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 649 states to 649 states and 861 transitions. [2019-11-28 00:27:22,794 INFO L78 Accepts]: Start accepts. Automaton has 649 states and 861 transitions. Word has length 50 [2019-11-28 00:27:22,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:27:22,795 INFO L462 AbstractCegarLoop]: Abstraction has 649 states and 861 transitions. [2019-11-28 00:27:22,795 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 00:27:22,795 INFO L276 IsEmpty]: Start isEmpty. Operand 649 states and 861 transitions. [2019-11-28 00:27:22,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-11-28 00:27:22,797 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:27:22,797 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:27:22,797 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:27:22,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:27:22,798 INFO L82 PathProgramCache]: Analyzing trace with hash 647371149, now seen corresponding path program 1 times [2019-11-28 00:27:22,798 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:27:22,799 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360385725] [2019-11-28 00:27:22,799 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:27:22,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:27:22,874 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 00:27:22,874 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360385725] [2019-11-28 00:27:22,874 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:27:22,875 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 00:27:22,875 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895097287] [2019-11-28 00:27:22,875 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 00:27:22,876 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:27:22,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 00:27:22,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 00:27:22,876 INFO L87 Difference]: Start difference. First operand 649 states and 861 transitions. Second operand 5 states. [2019-11-28 00:27:23,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:27:23,030 INFO L93 Difference]: Finished difference Result 1534 states and 2059 transitions. [2019-11-28 00:27:23,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 00:27:23,031 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 81 [2019-11-28 00:27:23,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:27:23,036 INFO L225 Difference]: With dead ends: 1534 [2019-11-28 00:27:23,036 INFO L226 Difference]: Without dead ends: 903 [2019-11-28 00:27:23,038 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-28 00:27:23,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 903 states. [2019-11-28 00:27:23,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 903 to 655. [2019-11-28 00:27:23,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 655 states. [2019-11-28 00:27:23,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 852 transitions. [2019-11-28 00:27:23,116 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 852 transitions. Word has length 81 [2019-11-28 00:27:23,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:27:23,117 INFO L462 AbstractCegarLoop]: Abstraction has 655 states and 852 transitions. [2019-11-28 00:27:23,117 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 00:27:23,117 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 852 transitions. [2019-11-28 00:27:23,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-11-28 00:27:23,118 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:27:23,119 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:27:23,119 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:27:23,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:27:23,119 INFO L82 PathProgramCache]: Analyzing trace with hash 83505161, now seen corresponding path program 1 times [2019-11-28 00:27:23,120 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:27:23,120 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107904747] [2019-11-28 00:27:23,120 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:27:23,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:27:23,186 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 00:27:23,187 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107904747] [2019-11-28 00:27:23,187 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:27:23,187 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 00:27:23,187 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81916990] [2019-11-28 00:27:23,188 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 00:27:23,188 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:27:23,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 00:27:23,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 00:27:23,189 INFO L87 Difference]: Start difference. First operand 655 states and 852 transitions. Second operand 5 states. [2019-11-28 00:27:23,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:27:23,348 INFO L93 Difference]: Finished difference Result 1575 states and 2073 transitions. [2019-11-28 00:27:23,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 00:27:23,353 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 81 [2019-11-28 00:27:23,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:27:23,359 INFO L225 Difference]: With dead ends: 1575 [2019-11-28 00:27:23,359 INFO L226 Difference]: Without dead ends: 945 [2019-11-28 00:27:23,361 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-28 00:27:23,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 945 states. [2019-11-28 00:27:23,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 945 to 661. [2019-11-28 00:27:23,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 661 states. [2019-11-28 00:27:23,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 661 states to 661 states and 843 transitions. [2019-11-28 00:27:23,411 INFO L78 Accepts]: Start accepts. Automaton has 661 states and 843 transitions. Word has length 81 [2019-11-28 00:27:23,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:27:23,414 INFO L462 AbstractCegarLoop]: Abstraction has 661 states and 843 transitions. [2019-11-28 00:27:23,414 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 00:27:23,414 INFO L276 IsEmpty]: Start isEmpty. Operand 661 states and 843 transitions. [2019-11-28 00:27:23,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-11-28 00:27:23,416 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:27:23,416 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:27:23,416 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:27:23,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:27:23,417 INFO L82 PathProgramCache]: Analyzing trace with hash 736088965, now seen corresponding path program 1 times [2019-11-28 00:27:23,417 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:27:23,417 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804792092] [2019-11-28 00:27:23,417 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:27:23,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:27:23,480 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 00:27:23,480 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804792092] [2019-11-28 00:27:23,480 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:27:23,480 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 00:27:23,481 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513981511] [2019-11-28 00:27:23,481 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 00:27:23,481 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:27:23,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 00:27:23,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 00:27:23,482 INFO L87 Difference]: Start difference. First operand 661 states and 843 transitions. Second operand 5 states. [2019-11-28 00:27:23,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:27:23,644 INFO L93 Difference]: Finished difference Result 1838 states and 2375 transitions. [2019-11-28 00:27:23,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 00:27:23,645 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 81 [2019-11-28 00:27:23,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:27:23,652 INFO L225 Difference]: With dead ends: 1838 [2019-11-28 00:27:23,652 INFO L226 Difference]: Without dead ends: 1209 [2019-11-28 00:27:23,655 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-28 00:27:23,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1209 states. [2019-11-28 00:27:23,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1209 to 673. [2019-11-28 00:27:23,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 673 states. [2019-11-28 00:27:23,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 673 states to 673 states and 842 transitions. [2019-11-28 00:27:23,717 INFO L78 Accepts]: Start accepts. Automaton has 673 states and 842 transitions. Word has length 81 [2019-11-28 00:27:23,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:27:23,717 INFO L462 AbstractCegarLoop]: Abstraction has 673 states and 842 transitions. [2019-11-28 00:27:23,717 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 00:27:23,718 INFO L276 IsEmpty]: Start isEmpty. Operand 673 states and 842 transitions. [2019-11-28 00:27:23,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-11-28 00:27:23,719 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:27:23,719 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:27:23,725 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:27:23,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:27:23,725 INFO L82 PathProgramCache]: Analyzing trace with hash -284979389, now seen corresponding path program 1 times [2019-11-28 00:27:23,726 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:27:23,727 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696592085] [2019-11-28 00:27:23,728 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:27:23,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:27:23,793 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 00:27:23,793 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696592085] [2019-11-28 00:27:23,794 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:27:23,794 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 00:27:23,794 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119352915] [2019-11-28 00:27:23,794 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 00:27:23,795 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:27:23,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 00:27:23,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 00:27:23,795 INFO L87 Difference]: Start difference. First operand 673 states and 842 transitions. Second operand 3 states. [2019-11-28 00:27:23,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:27:23,890 INFO L93 Difference]: Finished difference Result 1813 states and 2270 transitions. [2019-11-28 00:27:23,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 00:27:23,891 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 81 [2019-11-28 00:27:23,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:27:23,897 INFO L225 Difference]: With dead ends: 1813 [2019-11-28 00:27:23,897 INFO L226 Difference]: Without dead ends: 1178 [2019-11-28 00:27:23,899 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 00:27:23,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1178 states. [2019-11-28 00:27:23,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1178 to 1174. [2019-11-28 00:27:23,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1174 states. [2019-11-28 00:27:23,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1174 states to 1174 states and 1452 transitions. [2019-11-28 00:27:23,987 INFO L78 Accepts]: Start accepts. Automaton has 1174 states and 1452 transitions. Word has length 81 [2019-11-28 00:27:23,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:27:23,988 INFO L462 AbstractCegarLoop]: Abstraction has 1174 states and 1452 transitions. [2019-11-28 00:27:23,988 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 00:27:23,988 INFO L276 IsEmpty]: Start isEmpty. Operand 1174 states and 1452 transitions. [2019-11-28 00:27:23,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-11-28 00:27:23,989 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:27:23,990 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:27:23,990 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:27:23,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:27:23,990 INFO L82 PathProgramCache]: Analyzing trace with hash 206796516, now seen corresponding path program 1 times [2019-11-28 00:27:23,990 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:27:23,991 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623034160] [2019-11-28 00:27:23,991 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:27:24,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:27:24,031 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 00:27:24,031 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623034160] [2019-11-28 00:27:24,031 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:27:24,031 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 00:27:24,032 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782757574] [2019-11-28 00:27:24,032 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 00:27:24,032 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:27:24,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 00:27:24,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 00:27:24,033 INFO L87 Difference]: Start difference. First operand 1174 states and 1452 transitions. Second operand 3 states. [2019-11-28 00:27:24,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:27:24,189 INFO L93 Difference]: Finished difference Result 3254 states and 4030 transitions. [2019-11-28 00:27:24,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 00:27:24,190 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 82 [2019-11-28 00:27:24,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:27:24,200 INFO L225 Difference]: With dead ends: 3254 [2019-11-28 00:27:24,200 INFO L226 Difference]: Without dead ends: 2118 [2019-11-28 00:27:24,203 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 00:27:24,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2118 states. [2019-11-28 00:27:24,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2118 to 2114. [2019-11-28 00:27:24,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2114 states. [2019-11-28 00:27:24,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2114 states to 2114 states and 2598 transitions. [2019-11-28 00:27:24,367 INFO L78 Accepts]: Start accepts. Automaton has 2114 states and 2598 transitions. Word has length 82 [2019-11-28 00:27:24,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:27:24,368 INFO L462 AbstractCegarLoop]: Abstraction has 2114 states and 2598 transitions. [2019-11-28 00:27:24,368 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 00:27:24,368 INFO L276 IsEmpty]: Start isEmpty. Operand 2114 states and 2598 transitions. [2019-11-28 00:27:24,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-11-28 00:27:24,373 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:27:24,373 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:27:24,374 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:27:24,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:27:24,374 INFO L82 PathProgramCache]: Analyzing trace with hash 233862118, now seen corresponding path program 1 times [2019-11-28 00:27:24,375 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:27:24,379 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249736190] [2019-11-28 00:27:24,380 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:27:24,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:27:24,419 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-11-28 00:27:24,420 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249736190] [2019-11-28 00:27:24,420 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:27:24,421 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 00:27:24,422 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340596060] [2019-11-28 00:27:24,422 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 00:27:24,422 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:27:24,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 00:27:24,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 00:27:24,423 INFO L87 Difference]: Start difference. First operand 2114 states and 2598 transitions. Second operand 3 states. [2019-11-28 00:27:24,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:27:24,602 INFO L93 Difference]: Finished difference Result 4158 states and 5120 transitions. [2019-11-28 00:27:24,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 00:27:24,603 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 82 [2019-11-28 00:27:24,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:27:24,616 INFO L225 Difference]: With dead ends: 4158 [2019-11-28 00:27:24,616 INFO L226 Difference]: Without dead ends: 2082 [2019-11-28 00:27:24,623 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 00:27:24,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2082 states. [2019-11-28 00:27:24,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2082 to 2082. [2019-11-28 00:27:24,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2082 states. [2019-11-28 00:27:24,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2082 states to 2082 states and 2563 transitions. [2019-11-28 00:27:24,753 INFO L78 Accepts]: Start accepts. Automaton has 2082 states and 2563 transitions. Word has length 82 [2019-11-28 00:27:24,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:27:24,754 INFO L462 AbstractCegarLoop]: Abstraction has 2082 states and 2563 transitions. [2019-11-28 00:27:24,754 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 00:27:24,754 INFO L276 IsEmpty]: Start isEmpty. Operand 2082 states and 2563 transitions. [2019-11-28 00:27:24,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-11-28 00:27:24,756 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:27:24,756 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:27:24,756 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:27:24,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:27:24,757 INFO L82 PathProgramCache]: Analyzing trace with hash 794948131, now seen corresponding path program 1 times [2019-11-28 00:27:24,757 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:27:24,757 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378341588] [2019-11-28 00:27:24,758 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:27:24,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:27:24,799 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 00:27:24,800 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378341588] [2019-11-28 00:27:24,801 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:27:24,801 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 00:27:24,801 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462481697] [2019-11-28 00:27:24,802 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 00:27:24,802 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:27:24,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 00:27:24,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 00:27:24,803 INFO L87 Difference]: Start difference. First operand 2082 states and 2563 transitions. Second operand 3 states. [2019-11-28 00:27:25,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:27:25,022 INFO L93 Difference]: Finished difference Result 5880 states and 7201 transitions. [2019-11-28 00:27:25,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 00:27:25,023 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2019-11-28 00:27:25,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:27:25,037 INFO L225 Difference]: With dead ends: 5880 [2019-11-28 00:27:25,037 INFO L226 Difference]: Without dead ends: 2958 [2019-11-28 00:27:25,043 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 00:27:25,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2958 states. [2019-11-28 00:27:25,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2958 to 2958. [2019-11-28 00:27:25,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2958 states. [2019-11-28 00:27:25,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2958 states to 2958 states and 3600 transitions. [2019-11-28 00:27:25,238 INFO L78 Accepts]: Start accepts. Automaton has 2958 states and 3600 transitions. Word has length 83 [2019-11-28 00:27:25,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:27:25,239 INFO L462 AbstractCegarLoop]: Abstraction has 2958 states and 3600 transitions. [2019-11-28 00:27:25,239 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 00:27:25,239 INFO L276 IsEmpty]: Start isEmpty. Operand 2958 states and 3600 transitions. [2019-11-28 00:27:25,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-11-28 00:27:25,242 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:27:25,243 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:27:25,243 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:27:25,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:27:25,243 INFO L82 PathProgramCache]: Analyzing trace with hash -471564153, now seen corresponding path program 1 times [2019-11-28 00:27:25,244 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:27:25,244 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868486502] [2019-11-28 00:27:25,244 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:27:25,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:27:25,308 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 00:27:25,309 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868486502] [2019-11-28 00:27:25,311 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:27:25,312 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 00:27:25,312 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564601504] [2019-11-28 00:27:25,312 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 00:27:25,312 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:27:25,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 00:27:25,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 00:27:25,314 INFO L87 Difference]: Start difference. First operand 2958 states and 3600 transitions. Second operand 3 states. [2019-11-28 00:27:25,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:27:25,585 INFO L93 Difference]: Finished difference Result 6752 states and 8190 transitions. [2019-11-28 00:27:25,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 00:27:25,586 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 106 [2019-11-28 00:27:25,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:27:25,604 INFO L225 Difference]: With dead ends: 6752 [2019-11-28 00:27:25,604 INFO L226 Difference]: Without dead ends: 3821 [2019-11-28 00:27:25,610 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 00:27:25,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3821 states. [2019-11-28 00:27:25,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3821 to 3797. [2019-11-28 00:27:25,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3797 states. [2019-11-28 00:27:25,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3797 states to 3797 states and 4566 transitions. [2019-11-28 00:27:25,881 INFO L78 Accepts]: Start accepts. Automaton has 3797 states and 4566 transitions. Word has length 106 [2019-11-28 00:27:25,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:27:25,881 INFO L462 AbstractCegarLoop]: Abstraction has 3797 states and 4566 transitions. [2019-11-28 00:27:25,882 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 00:27:25,882 INFO L276 IsEmpty]: Start isEmpty. Operand 3797 states and 4566 transitions. [2019-11-28 00:27:25,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-11-28 00:27:25,886 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:27:25,886 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:27:25,886 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:27:25,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:27:25,887 INFO L82 PathProgramCache]: Analyzing trace with hash -264530006, now seen corresponding path program 1 times [2019-11-28 00:27:25,887 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:27:25,887 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810188548] [2019-11-28 00:27:25,888 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:27:25,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:27:25,937 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-11-28 00:27:25,937 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810188548] [2019-11-28 00:27:25,938 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:27:25,938 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 00:27:25,938 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569229158] [2019-11-28 00:27:25,939 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 00:27:25,939 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:27:25,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 00:27:25,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 00:27:25,940 INFO L87 Difference]: Start difference. First operand 3797 states and 4566 transitions. Second operand 3 states. [2019-11-28 00:27:26,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:27:26,130 INFO L93 Difference]: Finished difference Result 7467 states and 8962 transitions. [2019-11-28 00:27:26,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 00:27:26,131 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 120 [2019-11-28 00:27:26,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:27:26,146 INFO L225 Difference]: With dead ends: 7467 [2019-11-28 00:27:26,146 INFO L226 Difference]: Without dead ends: 3707 [2019-11-28 00:27:26,154 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 00:27:26,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3707 states. [2019-11-28 00:27:26,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3707 to 3707. [2019-11-28 00:27:26,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3707 states. [2019-11-28 00:27:26,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3707 states to 3707 states and 4354 transitions. [2019-11-28 00:27:26,358 INFO L78 Accepts]: Start accepts. Automaton has 3707 states and 4354 transitions. Word has length 120 [2019-11-28 00:27:26,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:27:26,359 INFO L462 AbstractCegarLoop]: Abstraction has 3707 states and 4354 transitions. [2019-11-28 00:27:26,359 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 00:27:26,359 INFO L276 IsEmpty]: Start isEmpty. Operand 3707 states and 4354 transitions. [2019-11-28 00:27:26,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-11-28 00:27:26,363 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:27:26,363 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:27:26,364 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:27:26,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:27:26,364 INFO L82 PathProgramCache]: Analyzing trace with hash 1818985301, now seen corresponding path program 1 times [2019-11-28 00:27:26,364 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:27:26,365 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866124310] [2019-11-28 00:27:26,365 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:27:26,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:27:26,413 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 00:27:26,414 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866124310] [2019-11-28 00:27:26,414 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:27:26,414 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 00:27:26,414 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913812596] [2019-11-28 00:27:26,415 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 00:27:26,419 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:27:26,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 00:27:26,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 00:27:26,420 INFO L87 Difference]: Start difference. First operand 3707 states and 4354 transitions. Second operand 3 states. [2019-11-28 00:27:26,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:27:26,641 INFO L93 Difference]: Finished difference Result 6571 states and 7758 transitions. [2019-11-28 00:27:26,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 00:27:26,641 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 121 [2019-11-28 00:27:26,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:27:26,656 INFO L225 Difference]: With dead ends: 6571 [2019-11-28 00:27:26,656 INFO L226 Difference]: Without dead ends: 3723 [2019-11-28 00:27:26,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-28 00:27:26,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3723 states. [2019-11-28 00:27:26,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3723 to 3707. [2019-11-28 00:27:26,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3707 states. [2019-11-28 00:27:26,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3707 states to 3707 states and 4262 transitions. [2019-11-28 00:27:26,874 INFO L78 Accepts]: Start accepts. Automaton has 3707 states and 4262 transitions. Word has length 121 [2019-11-28 00:27:26,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:27:26,875 INFO L462 AbstractCegarLoop]: Abstraction has 3707 states and 4262 transitions. [2019-11-28 00:27:26,875 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 00:27:26,875 INFO L276 IsEmpty]: Start isEmpty. Operand 3707 states and 4262 transitions. [2019-11-28 00:27:26,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-11-28 00:27:26,880 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:27:26,880 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:27:26,880 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:27:26,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:27:26,881 INFO L82 PathProgramCache]: Analyzing trace with hash -654472485, now seen corresponding path program 1 times [2019-11-28 00:27:26,883 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:27:26,883 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367081795] [2019-11-28 00:27:26,884 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:27:26,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:27:26,923 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 00:27:26,923 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367081795] [2019-11-28 00:27:26,923 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:27:26,924 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 00:27:26,924 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486312583] [2019-11-28 00:27:26,924 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 00:27:26,925 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:27:26,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 00:27:26,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 00:27:26,925 INFO L87 Difference]: Start difference. First operand 3707 states and 4262 transitions. Second operand 3 states. [2019-11-28 00:27:27,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:27:27,074 INFO L93 Difference]: Finished difference Result 6559 states and 7560 transitions. [2019-11-28 00:27:27,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 00:27:27,075 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 122 [2019-11-28 00:27:27,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:27:27,091 INFO L225 Difference]: With dead ends: 6559 [2019-11-28 00:27:27,091 INFO L226 Difference]: Without dead ends: 3711 [2019-11-28 00:27:27,096 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 00:27:27,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3711 states. [2019-11-28 00:27:27,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3711 to 3707. [2019-11-28 00:27:27,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3707 states. [2019-11-28 00:27:27,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3707 states to 3707 states and 4244 transitions. [2019-11-28 00:27:27,263 INFO L78 Accepts]: Start accepts. Automaton has 3707 states and 4244 transitions. Word has length 122 [2019-11-28 00:27:27,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:27:27,263 INFO L462 AbstractCegarLoop]: Abstraction has 3707 states and 4244 transitions. [2019-11-28 00:27:27,263 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 00:27:27,264 INFO L276 IsEmpty]: Start isEmpty. Operand 3707 states and 4244 transitions. [2019-11-28 00:27:27,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-11-28 00:27:27,269 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:27:27,269 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:27:27,269 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:27:27,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:27:27,270 INFO L82 PathProgramCache]: Analyzing trace with hash -1028326263, now seen corresponding path program 1 times [2019-11-28 00:27:27,270 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:27:27,270 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164017851] [2019-11-28 00:27:27,270 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:27:27,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:27:27,318 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-11-28 00:27:27,319 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164017851] [2019-11-28 00:27:27,319 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:27:27,319 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 00:27:27,320 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950388058] [2019-11-28 00:27:27,320 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 00:27:27,320 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:27:27,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 00:27:27,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 00:27:27,321 INFO L87 Difference]: Start difference. First operand 3707 states and 4244 transitions. Second operand 3 states. [2019-11-28 00:27:27,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:27:27,518 INFO L93 Difference]: Finished difference Result 8135 states and 9290 transitions. [2019-11-28 00:27:27,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 00:27:27,519 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 145 [2019-11-28 00:27:27,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:27:27,533 INFO L225 Difference]: With dead ends: 8135 [2019-11-28 00:27:27,534 INFO L226 Difference]: Without dead ends: 4448 [2019-11-28 00:27:27,540 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 00:27:27,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4448 states. [2019-11-28 00:27:27,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4448 to 4416. [2019-11-28 00:27:27,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4416 states. [2019-11-28 00:27:27,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4416 states to 4416 states and 5010 transitions. [2019-11-28 00:27:27,782 INFO L78 Accepts]: Start accepts. Automaton has 4416 states and 5010 transitions. Word has length 145 [2019-11-28 00:27:27,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:27:27,782 INFO L462 AbstractCegarLoop]: Abstraction has 4416 states and 5010 transitions. [2019-11-28 00:27:27,783 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 00:27:27,783 INFO L276 IsEmpty]: Start isEmpty. Operand 4416 states and 5010 transitions. [2019-11-28 00:27:27,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-11-28 00:27:27,789 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:27:27,789 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:27:27,789 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:27:27,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:27:27,789 INFO L82 PathProgramCache]: Analyzing trace with hash 1098265157, now seen corresponding path program 1 times [2019-11-28 00:27:27,790 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:27:27,790 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59013178] [2019-11-28 00:27:27,790 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:27:27,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:27:27,842 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-28 00:27:27,842 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59013178] [2019-11-28 00:27:27,842 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:27:27,842 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 00:27:27,843 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767114534] [2019-11-28 00:27:27,843 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 00:27:27,843 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:27:27,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 00:27:27,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 00:27:27,844 INFO L87 Difference]: Start difference. First operand 4416 states and 5010 transitions. Second operand 3 states. [2019-11-28 00:27:27,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:27:27,989 INFO L93 Difference]: Finished difference Result 6055 states and 6869 transitions. [2019-11-28 00:27:27,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 00:27:27,989 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 148 [2019-11-28 00:27:27,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:27:27,994 INFO L225 Difference]: With dead ends: 6055 [2019-11-28 00:27:27,994 INFO L226 Difference]: Without dead ends: 1503 [2019-11-28 00:27:27,998 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 00:27:28,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1503 states. [2019-11-28 00:27:28,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1503 to 1503. [2019-11-28 00:27:28,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1503 states. [2019-11-28 00:27:28,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1503 states to 1503 states and 1647 transitions. [2019-11-28 00:27:28,070 INFO L78 Accepts]: Start accepts. Automaton has 1503 states and 1647 transitions. Word has length 148 [2019-11-28 00:27:28,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:27:28,070 INFO L462 AbstractCegarLoop]: Abstraction has 1503 states and 1647 transitions. [2019-11-28 00:27:28,070 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 00:27:28,070 INFO L276 IsEmpty]: Start isEmpty. Operand 1503 states and 1647 transitions. [2019-11-28 00:27:28,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-11-28 00:27:28,073 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:27:28,073 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:27:28,073 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:27:28,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:27:28,074 INFO L82 PathProgramCache]: Analyzing trace with hash -2040513564, now seen corresponding path program 1 times [2019-11-28 00:27:28,074 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:27:28,074 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820893272] [2019-11-28 00:27:28,074 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:27:28,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:27:28,115 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-28 00:27:28,115 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820893272] [2019-11-28 00:27:28,115 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:27:28,115 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 00:27:28,116 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671548105] [2019-11-28 00:27:28,116 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 00:27:28,116 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:27:28,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 00:27:28,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 00:27:28,117 INFO L87 Difference]: Start difference. First operand 1503 states and 1647 transitions. Second operand 3 states. [2019-11-28 00:27:28,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:27:28,213 INFO L93 Difference]: Finished difference Result 2346 states and 2580 transitions. [2019-11-28 00:27:28,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 00:27:28,214 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 149 [2019-11-28 00:27:28,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:27:28,218 INFO L225 Difference]: With dead ends: 2346 [2019-11-28 00:27:28,218 INFO L226 Difference]: Without dead ends: 1539 [2019-11-28 00:27:28,220 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 00:27:28,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1539 states. [2019-11-28 00:27:28,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1539 to 1503. [2019-11-28 00:27:28,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1503 states. [2019-11-28 00:27:28,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1503 states to 1503 states and 1627 transitions. [2019-11-28 00:27:28,304 INFO L78 Accepts]: Start accepts. Automaton has 1503 states and 1627 transitions. Word has length 149 [2019-11-28 00:27:28,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:27:28,305 INFO L462 AbstractCegarLoop]: Abstraction has 1503 states and 1627 transitions. [2019-11-28 00:27:28,305 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 00:27:28,305 INFO L276 IsEmpty]: Start isEmpty. Operand 1503 states and 1627 transitions. [2019-11-28 00:27:28,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-11-28 00:27:28,310 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:27:28,310 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:27:28,311 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:27:28,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:27:28,311 INFO L82 PathProgramCache]: Analyzing trace with hash -1275276035, now seen corresponding path program 1 times [2019-11-28 00:27:28,312 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:27:28,312 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997852216] [2019-11-28 00:27:28,312 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:27:28,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:27:28,358 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 00:27:28,358 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997852216] [2019-11-28 00:27:28,358 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:27:28,358 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 00:27:28,359 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116905298] [2019-11-28 00:27:28,359 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 00:27:28,359 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:27:28,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 00:27:28,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 00:27:28,360 INFO L87 Difference]: Start difference. First operand 1503 states and 1627 transitions. Second operand 3 states. [2019-11-28 00:27:28,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:27:28,458 INFO L93 Difference]: Finished difference Result 2657 states and 2881 transitions. [2019-11-28 00:27:28,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 00:27:28,458 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 150 [2019-11-28 00:27:28,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:27:28,462 INFO L225 Difference]: With dead ends: 2657 [2019-11-28 00:27:28,462 INFO L226 Difference]: Without dead ends: 1503 [2019-11-28 00:27:28,464 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 00:27:28,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1503 states. [2019-11-28 00:27:28,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1503 to 1503. [2019-11-28 00:27:28,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1503 states. [2019-11-28 00:27:28,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1503 states to 1503 states and 1605 transitions. [2019-11-28 00:27:28,545 INFO L78 Accepts]: Start accepts. Automaton has 1503 states and 1605 transitions. Word has length 150 [2019-11-28 00:27:28,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:27:28,546 INFO L462 AbstractCegarLoop]: Abstraction has 1503 states and 1605 transitions. [2019-11-28 00:27:28,546 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 00:27:28,546 INFO L276 IsEmpty]: Start isEmpty. Operand 1503 states and 1605 transitions. [2019-11-28 00:27:28,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-11-28 00:27:28,548 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:27:28,548 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:27:28,548 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:27:28,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:27:28,549 INFO L82 PathProgramCache]: Analyzing trace with hash -660923245, now seen corresponding path program 1 times [2019-11-28 00:27:28,549 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:27:28,549 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623148840] [2019-11-28 00:27:28,549 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:27:28,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:27:28,706 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-28 00:27:28,716 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623148840] [2019-11-28 00:27:28,716 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:27:28,716 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 00:27:28,717 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582415772] [2019-11-28 00:27:28,717 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 00:27:28,717 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:27:28,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 00:27:28,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 00:27:28,719 INFO L87 Difference]: Start difference. First operand 1503 states and 1605 transitions. Second operand 5 states. [2019-11-28 00:27:28,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:27:28,915 INFO L93 Difference]: Finished difference Result 1503 states and 1605 transitions. [2019-11-28 00:27:28,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 00:27:28,916 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 152 [2019-11-28 00:27:28,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:27:28,920 INFO L225 Difference]: With dead ends: 1503 [2019-11-28 00:27:28,921 INFO L226 Difference]: Without dead ends: 1501 [2019-11-28 00:27:28,924 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 00:27:28,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1501 states. [2019-11-28 00:27:29,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1501 to 1501. [2019-11-28 00:27:29,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1501 states. [2019-11-28 00:27:29,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1501 states to 1501 states and 1602 transitions. [2019-11-28 00:27:29,098 INFO L78 Accepts]: Start accepts. Automaton has 1501 states and 1602 transitions. Word has length 152 [2019-11-28 00:27:29,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:27:29,099 INFO L462 AbstractCegarLoop]: Abstraction has 1501 states and 1602 transitions. [2019-11-28 00:27:29,099 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 00:27:29,100 INFO L276 IsEmpty]: Start isEmpty. Operand 1501 states and 1602 transitions. [2019-11-28 00:27:29,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-11-28 00:27:29,103 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:27:29,103 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:27:29,104 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:27:29,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:27:29,105 INFO L82 PathProgramCache]: Analyzing trace with hash -1317806111, now seen corresponding path program 1 times [2019-11-28 00:27:29,106 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:27:29,106 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547471622] [2019-11-28 00:27:29,106 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:27:29,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:27:29,192 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-11-28 00:27:29,192 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547471622] [2019-11-28 00:27:29,193 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:27:29,193 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 00:27:29,193 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134268059] [2019-11-28 00:27:29,194 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 00:27:29,194 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:27:29,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 00:27:29,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 00:27:29,195 INFO L87 Difference]: Start difference. First operand 1501 states and 1602 transitions. Second operand 3 states. [2019-11-28 00:27:29,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:27:29,392 INFO L93 Difference]: Finished difference Result 2757 states and 2935 transitions. [2019-11-28 00:27:29,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 00:27:29,392 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 156 [2019-11-28 00:27:29,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:27:29,399 INFO L225 Difference]: With dead ends: 2757 [2019-11-28 00:27:29,399 INFO L226 Difference]: Without dead ends: 2121 [2019-11-28 00:27:29,401 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 00:27:29,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2121 states. [2019-11-28 00:27:29,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2121 to 1503. [2019-11-28 00:27:29,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1503 states. [2019-11-28 00:27:29,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1503 states to 1503 states and 1604 transitions. [2019-11-28 00:27:29,553 INFO L78 Accepts]: Start accepts. Automaton has 1503 states and 1604 transitions. Word has length 156 [2019-11-28 00:27:29,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:27:29,553 INFO L462 AbstractCegarLoop]: Abstraction has 1503 states and 1604 transitions. [2019-11-28 00:27:29,554 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 00:27:29,554 INFO L276 IsEmpty]: Start isEmpty. Operand 1503 states and 1604 transitions. [2019-11-28 00:27:29,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-11-28 00:27:29,557 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:27:29,557 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:27:29,558 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:27:29,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:27:29,558 INFO L82 PathProgramCache]: Analyzing trace with hash 1860246650, now seen corresponding path program 1 times [2019-11-28 00:27:29,559 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:27:29,559 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709365287] [2019-11-28 00:27:29,559 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:27:29,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 00:27:29,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 00:27:29,725 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 00:27:29,725 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-28 00:27:29,899 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 12:27:29 BoogieIcfgContainer [2019-11-28 00:27:29,900 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 00:27:29,900 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 00:27:29,900 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 00:27:29,900 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 00:27:29,901 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:27:20" (3/4) ... [2019-11-28 00:27:29,904 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-28 00:27:30,113 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 00:27:30,113 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 00:27:30,116 INFO L168 Benchmark]: Toolchain (without parser) took 10766.36 ms. Allocated memory was 1.0 GB in the beginning and 1.8 GB in the end (delta: 782.2 MB). Free memory was 957.7 MB in the beginning and 1.5 GB in the end (delta: -537.9 MB). Peak memory consumption was 244.3 MB. Max. memory is 11.5 GB. [2019-11-28 00:27:30,116 INFO L168 Benchmark]: CDTParser took 0.41 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 00:27:30,117 INFO L168 Benchmark]: CACSL2BoogieTranslator took 465.67 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.3 MB). Free memory was 957.7 MB in the beginning and 1.1 GB in the end (delta: -179.7 MB). Peak memory consumption was 21.8 MB. Max. memory is 11.5 GB. [2019-11-28 00:27:30,117 INFO L168 Benchmark]: Boogie Procedure Inliner took 60.78 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-28 00:27:30,118 INFO L168 Benchmark]: Boogie Preprocessor took 49.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-28 00:27:30,118 INFO L168 Benchmark]: RCFGBuilder took 1012.07 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: 63.7 MB). Peak memory consumption was 63.7 MB. Max. memory is 11.5 GB. [2019-11-28 00:27:30,118 INFO L168 Benchmark]: TraceAbstraction took 8958.12 ms. Allocated memory was 1.2 GB in the beginning and 1.8 GB in the end (delta: 634.9 MB). Free memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: -447.4 MB). Peak memory consumption was 187.5 MB. Max. memory is 11.5 GB. [2019-11-28 00:27:30,119 INFO L168 Benchmark]: Witness Printer took 213.06 ms. Allocated memory is still 1.8 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 18.8 MB). Peak memory consumption was 18.8 MB. Max. memory is 11.5 GB. [2019-11-28 00:27:30,121 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.41 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 465.67 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.3 MB). Free memory was 957.7 MB in the beginning and 1.1 GB in the end (delta: -179.7 MB). Peak memory consumption was 21.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 60.78 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 49.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 1012.07 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: 63.7 MB). Peak memory consumption was 63.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 8958.12 ms. Allocated memory was 1.2 GB in the beginning and 1.8 GB in the end (delta: 634.9 MB). Free memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: -447.4 MB). Peak memory consumption was 187.5 MB. Max. memory is 11.5 GB. * Witness Printer took 213.06 ms. Allocated memory is still 1.8 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 18.8 MB). Peak memory consumption was 18.8 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.6s, OverallIterations: 26, TraceHistogramMax: 3, AutomataDifference: 3.7s, 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.7s AutomataMinimizationTime, 25 MinimizatonAttempts, 1848 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 2497 NumberOfCodeBlocks, 2497 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 2315 ConstructedInterpolants, 0 QuantifiedInterpolants, 459807 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 25 InterpolantComputations, 25 PerfectInterpolantSequences, 367/367 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...