./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/systemc/kundu2_false-unreach-call_false-termination.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_baa69fca-6ce1-4270-9804-ba1337b7c1a0/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_baa69fca-6ce1-4270-9804-ba1337b7c1a0/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_baa69fca-6ce1-4270-9804-ba1337b7c1a0/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_baa69fca-6ce1-4270-9804-ba1337b7c1a0/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/systemc/kundu2_false-unreach-call_false-termination.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_baa69fca-6ce1-4270-9804-ba1337b7c1a0/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_baa69fca-6ce1-4270-9804-ba1337b7c1a0/bin-2019/utaipan --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2559ce56d5bdfaeec5255956226223494fe099f5 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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.23-635dfa2 [2018-12-09 09:03:06,158 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 09:03:06,159 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 09:03:06,165 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 09:03:06,165 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 09:03:06,165 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 09:03:06,166 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 09:03:06,167 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 09:03:06,168 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 09:03:06,168 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 09:03:06,169 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 09:03:06,169 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 09:03:06,169 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 09:03:06,170 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 09:03:06,171 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 09:03:06,171 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 09:03:06,171 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 09:03:06,172 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 09:03:06,173 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 09:03:06,174 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 09:03:06,175 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 09:03:06,175 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 09:03:06,177 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 09:03:06,177 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 09:03:06,177 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 09:03:06,178 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 09:03:06,178 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 09:03:06,179 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 09:03:06,179 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 09:03:06,180 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 09:03:06,180 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 09:03:06,180 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 09:03:06,180 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 09:03:06,180 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 09:03:06,181 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 09:03:06,181 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 09:03:06,181 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_baa69fca-6ce1-4270-9804-ba1337b7c1a0/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-09 09:03:06,189 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 09:03:06,189 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 09:03:06,189 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 09:03:06,189 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 09:03:06,190 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-09 09:03:06,190 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-09 09:03:06,190 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-09 09:03:06,190 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-09 09:03:06,190 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-09 09:03:06,190 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-09 09:03:06,190 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-09 09:03:06,190 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-09 09:03:06,190 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-09 09:03:06,191 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 09:03:06,191 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 09:03:06,191 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 09:03:06,191 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 09:03:06,191 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 09:03:06,191 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-09 09:03:06,192 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 09:03:06,192 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-09 09:03:06,192 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 09:03:06,192 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-09 09:03:06,192 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-09 09:03:06,192 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 09:03:06,192 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 09:03:06,192 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 09:03:06,193 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 09:03:06,193 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 09:03:06,193 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 09:03:06,193 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 09:03:06,193 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-09 09:03:06,193 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-09 09:03:06,193 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 09:03:06,194 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-09 09:03:06,194 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-09 09:03:06,194 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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 -> /tmp/vcloud-vcloud-master/worker/working_dir_baa69fca-6ce1-4270-9804-ba1337b7c1a0/bin-2019/utaipan 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 -> Taipan 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 -> 2559ce56d5bdfaeec5255956226223494fe099f5 [2018-12-09 09:03:06,211 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 09:03:06,217 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 09:03:06,219 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 09:03:06,220 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 09:03:06,220 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 09:03:06,221 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_baa69fca-6ce1-4270-9804-ba1337b7c1a0/bin-2019/utaipan/../../sv-benchmarks/c/systemc/kundu2_false-unreach-call_false-termination.cil.c [2018-12-09 09:03:06,253 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_baa69fca-6ce1-4270-9804-ba1337b7c1a0/bin-2019/utaipan/data/051c475f4/9656f8c10b76419fb77d0ef40d02da26/FLAGc20666571 [2018-12-09 09:03:06,677 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 09:03:06,677 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_baa69fca-6ce1-4270-9804-ba1337b7c1a0/sv-benchmarks/c/systemc/kundu2_false-unreach-call_false-termination.cil.c [2018-12-09 09:03:06,682 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_baa69fca-6ce1-4270-9804-ba1337b7c1a0/bin-2019/utaipan/data/051c475f4/9656f8c10b76419fb77d0ef40d02da26/FLAGc20666571 [2018-12-09 09:03:06,690 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_baa69fca-6ce1-4270-9804-ba1337b7c1a0/bin-2019/utaipan/data/051c475f4/9656f8c10b76419fb77d0ef40d02da26 [2018-12-09 09:03:06,692 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 09:03:06,693 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 09:03:06,693 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 09:03:06,693 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 09:03:06,695 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 09:03:06,696 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 09:03:06" (1/1) ... [2018-12-09 09:03:06,697 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@55a03fd0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:03:06, skipping insertion in model container [2018-12-09 09:03:06,697 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 09:03:06" (1/1) ... [2018-12-09 09:03:06,701 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 09:03:06,717 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 09:03:06,825 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 09:03:06,828 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 09:03:06,851 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 09:03:06,861 INFO L195 MainTranslator]: Completed translation [2018-12-09 09:03:06,861 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:03:06 WrapperNode [2018-12-09 09:03:06,861 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 09:03:06,862 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 09:03:06,862 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 09:03:06,862 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 09:03:06,867 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:03:06" (1/1) ... [2018-12-09 09:03:06,871 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:03:06" (1/1) ... [2018-12-09 09:03:06,904 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 09:03:06,905 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 09:03:06,905 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 09:03:06,905 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 09:03:06,911 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:03:06" (1/1) ... [2018-12-09 09:03:06,911 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:03:06" (1/1) ... [2018-12-09 09:03:06,913 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:03:06" (1/1) ... [2018-12-09 09:03:06,914 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:03:06" (1/1) ... [2018-12-09 09:03:06,921 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:03:06" (1/1) ... [2018-12-09 09:03:06,929 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:03:06" (1/1) ... [2018-12-09 09:03:06,930 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:03:06" (1/1) ... [2018-12-09 09:03:06,933 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 09:03:06,933 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 09:03:06,933 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 09:03:06,933 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 09:03:06,934 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:03:06" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_baa69fca-6ce1-4270-9804-ba1337b7c1a0/bin-2019/utaipan/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 [2018-12-09 09:03:06,969 INFO L130 BoogieDeclarations]: Found specification of procedure P_2 [2018-12-09 09:03:06,969 INFO L138 BoogieDeclarations]: Found implementation of procedure P_2 [2018-12-09 09:03:06,969 INFO L130 BoogieDeclarations]: Found specification of procedure P_1 [2018-12-09 09:03:06,969 INFO L138 BoogieDeclarations]: Found implementation of procedure P_1 [2018-12-09 09:03:06,969 INFO L130 BoogieDeclarations]: Found specification of procedure write_data [2018-12-09 09:03:06,969 INFO L138 BoogieDeclarations]: Found implementation of procedure write_data [2018-12-09 09:03:06,969 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-09 09:03:06,969 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-09 09:03:06,970 INFO L130 BoogieDeclarations]: Found specification of procedure error [2018-12-09 09:03:06,970 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2018-12-09 09:03:06,970 INFO L130 BoogieDeclarations]: Found specification of procedure stop_simulation [2018-12-09 09:03:06,970 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_simulation [2018-12-09 09:03:06,970 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2018-12-09 09:03:06,970 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2018-12-09 09:03:06,970 INFO L130 BoogieDeclarations]: Found specification of procedure is_P_2_triggered [2018-12-09 09:03:06,970 INFO L138 BoogieDeclarations]: Found implementation of procedure is_P_2_triggered [2018-12-09 09:03:06,970 INFO L130 BoogieDeclarations]: Found specification of procedure reset_time_events [2018-12-09 09:03:06,970 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_time_events [2018-12-09 09:03:06,970 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2018-12-09 09:03:06,970 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2018-12-09 09:03:06,970 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2018-12-09 09:03:06,971 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2018-12-09 09:03:06,971 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2018-12-09 09:03:06,971 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2018-12-09 09:03:06,971 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2018-12-09 09:03:06,971 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2018-12-09 09:03:06,971 INFO L130 BoogieDeclarations]: Found specification of procedure init_threads [2018-12-09 09:03:06,971 INFO L138 BoogieDeclarations]: Found implementation of procedure init_threads [2018-12-09 09:03:06,971 INFO L130 BoogieDeclarations]: Found specification of procedure is_P_1_triggered [2018-12-09 09:03:06,971 INFO L138 BoogieDeclarations]: Found implementation of procedure is_P_1_triggered [2018-12-09 09:03:06,972 INFO L130 BoogieDeclarations]: Found specification of procedure read_data [2018-12-09 09:03:06,972 INFO L138 BoogieDeclarations]: Found implementation of procedure read_data [2018-12-09 09:03:06,972 INFO L130 BoogieDeclarations]: Found specification of procedure fire_time_events [2018-12-09 09:03:06,972 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_time_events [2018-12-09 09:03:06,972 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-09 09:03:06,972 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-09 09:03:06,972 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2018-12-09 09:03:06,972 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2018-12-09 09:03:06,972 INFO L130 BoogieDeclarations]: Found specification of procedure C_1 [2018-12-09 09:03:06,973 INFO L138 BoogieDeclarations]: Found implementation of procedure C_1 [2018-12-09 09:03:06,973 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2018-12-09 09:03:06,973 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2018-12-09 09:03:06,973 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2018-12-09 09:03:06,973 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2018-12-09 09:03:06,973 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 09:03:06,973 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 09:03:06,973 INFO L130 BoogieDeclarations]: Found specification of procedure is_C_1_triggered [2018-12-09 09:03:06,974 INFO L138 BoogieDeclarations]: Found implementation of procedure is_C_1_triggered [2018-12-09 09:03:06,974 INFO L130 BoogieDeclarations]: Found specification of procedure init_model [2018-12-09 09:03:06,974 INFO L138 BoogieDeclarations]: Found implementation of procedure init_model [2018-12-09 09:03:07,251 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 09:03:07,251 INFO L280 CfgBuilder]: Removed 5 assue(true) statements. [2018-12-09 09:03:07,252 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 09:03:07 BoogieIcfgContainer [2018-12-09 09:03:07,252 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 09:03:07,252 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-09 09:03:07,252 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-09 09:03:07,254 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-09 09:03:07,254 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 09:03:06" (1/3) ... [2018-12-09 09:03:07,255 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fb419bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 09:03:07, skipping insertion in model container [2018-12-09 09:03:07,255 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:03:06" (2/3) ... [2018-12-09 09:03:07,255 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fb419bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 09:03:07, skipping insertion in model container [2018-12-09 09:03:07,255 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 09:03:07" (3/3) ... [2018-12-09 09:03:07,256 INFO L112 eAbstractionObserver]: Analyzing ICFG kundu2_false-unreach-call_false-termination.cil.c [2018-12-09 09:03:07,261 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-09 09:03:07,266 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-09 09:03:07,276 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-09 09:03:07,295 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-09 09:03:07,295 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-09 09:03:07,295 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-09 09:03:07,295 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 09:03:07,295 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 09:03:07,295 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-09 09:03:07,295 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 09:03:07,295 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-09 09:03:07,308 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states. [2018-12-09 09:03:07,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-12-09 09:03:07,313 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:03:07,314 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:03:07,315 INFO L423 AbstractCegarLoop]: === Iteration 1 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:03:07,318 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:03:07,318 INFO L82 PathProgramCache]: Analyzing trace with hash 1386603579, now seen corresponding path program 1 times [2018-12-09 09:03:07,319 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:03:07,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:03:07,347 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:03:07,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:03:07,348 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:03:07,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:03:07,478 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:03:07,479 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:03:07,479 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 09:03:07,479 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 09:03:07,483 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 09:03:07,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 09:03:07,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 09:03:07,492 INFO L87 Difference]: Start difference. First operand 181 states. Second operand 4 states. [2018-12-09 09:03:07,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:03:07,691 INFO L93 Difference]: Finished difference Result 493 states and 700 transitions. [2018-12-09 09:03:07,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 09:03:07,692 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 82 [2018-12-09 09:03:07,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:03:07,701 INFO L225 Difference]: With dead ends: 493 [2018-12-09 09:03:07,701 INFO L226 Difference]: Without dead ends: 319 [2018-12-09 09:03:07,704 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 09:03:07,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2018-12-09 09:03:07,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 312. [2018-12-09 09:03:07,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 312 states. [2018-12-09 09:03:07,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 410 transitions. [2018-12-09 09:03:07,751 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 410 transitions. Word has length 82 [2018-12-09 09:03:07,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:03:07,752 INFO L480 AbstractCegarLoop]: Abstraction has 312 states and 410 transitions. [2018-12-09 09:03:07,752 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 09:03:07,752 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 410 transitions. [2018-12-09 09:03:07,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-12-09 09:03:07,754 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:03:07,754 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:03:07,755 INFO L423 AbstractCegarLoop]: === Iteration 2 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:03:07,755 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:03:07,755 INFO L82 PathProgramCache]: Analyzing trace with hash 513125884, now seen corresponding path program 1 times [2018-12-09 09:03:07,755 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:03:07,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:03:07,756 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:03:07,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:03:07,756 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:03:07,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:03:07,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:03:07,828 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:03:07,828 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 09:03:07,828 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 09:03:07,829 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 09:03:07,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 09:03:07,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 09:03:07,830 INFO L87 Difference]: Start difference. First operand 312 states and 410 transitions. Second operand 4 states. [2018-12-09 09:03:07,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:03:07,982 INFO L93 Difference]: Finished difference Result 881 states and 1195 transitions. [2018-12-09 09:03:07,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 09:03:07,982 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 82 [2018-12-09 09:03:07,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:03:07,986 INFO L225 Difference]: With dead ends: 881 [2018-12-09 09:03:07,986 INFO L226 Difference]: Without dead ends: 590 [2018-12-09 09:03:07,987 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 09:03:07,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states. [2018-12-09 09:03:08,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 565. [2018-12-09 09:03:08,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 565 states. [2018-12-09 09:03:08,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 565 states to 565 states and 735 transitions. [2018-12-09 09:03:08,027 INFO L78 Accepts]: Start accepts. Automaton has 565 states and 735 transitions. Word has length 82 [2018-12-09 09:03:08,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:03:08,028 INFO L480 AbstractCegarLoop]: Abstraction has 565 states and 735 transitions. [2018-12-09 09:03:08,028 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 09:03:08,028 INFO L276 IsEmpty]: Start isEmpty. Operand 565 states and 735 transitions. [2018-12-09 09:03:08,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-12-09 09:03:08,029 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:03:08,029 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:03:08,029 INFO L423 AbstractCegarLoop]: === Iteration 3 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:03:08,029 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:03:08,029 INFO L82 PathProgramCache]: Analyzing trace with hash 45566462, now seen corresponding path program 1 times [2018-12-09 09:03:08,029 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:03:08,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:03:08,030 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:03:08,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:03:08,030 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:03:08,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:03:08,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:03:08,105 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:03:08,105 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 09:03:08,106 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 09:03:08,106 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 09:03:08,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 09:03:08,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 09:03:08,106 INFO L87 Difference]: Start difference. First operand 565 states and 735 transitions. Second operand 6 states. [2018-12-09 09:03:08,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:03:08,169 INFO L93 Difference]: Finished difference Result 1161 states and 1553 transitions. [2018-12-09 09:03:08,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 09:03:08,169 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 83 [2018-12-09 09:03:08,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:03:08,173 INFO L225 Difference]: With dead ends: 1161 [2018-12-09 09:03:08,174 INFO L226 Difference]: Without dead ends: 617 [2018-12-09 09:03:08,176 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-09 09:03:08,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2018-12-09 09:03:08,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 585. [2018-12-09 09:03:08,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 585 states. [2018-12-09 09:03:08,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 585 states and 755 transitions. [2018-12-09 09:03:08,214 INFO L78 Accepts]: Start accepts. Automaton has 585 states and 755 transitions. Word has length 83 [2018-12-09 09:03:08,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:03:08,215 INFO L480 AbstractCegarLoop]: Abstraction has 585 states and 755 transitions. [2018-12-09 09:03:08,215 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 09:03:08,215 INFO L276 IsEmpty]: Start isEmpty. Operand 585 states and 755 transitions. [2018-12-09 09:03:08,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-12-09 09:03:08,216 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:03:08,217 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:03:08,217 INFO L423 AbstractCegarLoop]: === Iteration 4 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:03:08,217 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:03:08,217 INFO L82 PathProgramCache]: Analyzing trace with hash 30047744, now seen corresponding path program 1 times [2018-12-09 09:03:08,217 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:03:08,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:03:08,218 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:03:08,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:03:08,218 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:03:08,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:03:08,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:03:08,288 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:03:08,288 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 09:03:08,288 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 09:03:08,288 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 09:03:08,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 09:03:08,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 09:03:08,289 INFO L87 Difference]: Start difference. First operand 585 states and 755 transitions. Second operand 6 states. [2018-12-09 09:03:08,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:03:08,334 INFO L93 Difference]: Finished difference Result 1169 states and 1542 transitions. [2018-12-09 09:03:08,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 09:03:08,334 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 83 [2018-12-09 09:03:08,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:03:08,336 INFO L225 Difference]: With dead ends: 1169 [2018-12-09 09:03:08,336 INFO L226 Difference]: Without dead ends: 605 [2018-12-09 09:03:08,338 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-09 09:03:08,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2018-12-09 09:03:08,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 595. [2018-12-09 09:03:08,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 595 states. [2018-12-09 09:03:08,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 595 states to 595 states and 763 transitions. [2018-12-09 09:03:08,357 INFO L78 Accepts]: Start accepts. Automaton has 595 states and 763 transitions. Word has length 83 [2018-12-09 09:03:08,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:03:08,357 INFO L480 AbstractCegarLoop]: Abstraction has 595 states and 763 transitions. [2018-12-09 09:03:08,357 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 09:03:08,357 INFO L276 IsEmpty]: Start isEmpty. Operand 595 states and 763 transitions. [2018-12-09 09:03:08,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-12-09 09:03:08,358 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:03:08,358 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:03:08,358 INFO L423 AbstractCegarLoop]: === Iteration 5 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:03:08,358 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:03:08,358 INFO L82 PathProgramCache]: Analyzing trace with hash -1341759554, now seen corresponding path program 1 times [2018-12-09 09:03:08,359 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:03:08,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:03:08,359 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:03:08,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:03:08,359 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:03:08,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:03:08,436 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:03:08,436 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:03:08,436 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 09:03:08,437 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 09:03:08,437 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 09:03:08,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 09:03:08,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 09:03:08,437 INFO L87 Difference]: Start difference. First operand 595 states and 763 transitions. Second operand 6 states. [2018-12-09 09:03:08,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:03:08,495 INFO L93 Difference]: Finished difference Result 1197 states and 1569 transitions. [2018-12-09 09:03:08,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 09:03:08,496 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 83 [2018-12-09 09:03:08,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:03:08,499 INFO L225 Difference]: With dead ends: 1197 [2018-12-09 09:03:08,499 INFO L226 Difference]: Without dead ends: 623 [2018-12-09 09:03:08,501 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-09 09:03:08,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 623 states. [2018-12-09 09:03:08,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 623 to 615. [2018-12-09 09:03:08,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 615 states. [2018-12-09 09:03:08,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 615 states to 615 states and 783 transitions. [2018-12-09 09:03:08,521 INFO L78 Accepts]: Start accepts. Automaton has 615 states and 783 transitions. Word has length 83 [2018-12-09 09:03:08,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:03:08,522 INFO L480 AbstractCegarLoop]: Abstraction has 615 states and 783 transitions. [2018-12-09 09:03:08,522 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 09:03:08,522 INFO L276 IsEmpty]: Start isEmpty. Operand 615 states and 783 transitions. [2018-12-09 09:03:08,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-12-09 09:03:08,522 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:03:08,523 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:03:08,523 INFO L423 AbstractCegarLoop]: === Iteration 6 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:03:08,523 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:03:08,523 INFO L82 PathProgramCache]: Analyzing trace with hash -1319127300, now seen corresponding path program 1 times [2018-12-09 09:03:08,523 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:03:08,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:03:08,524 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:03:08,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:03:08,524 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:03:08,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:03:08,575 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:03:08,575 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:03:08,575 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 09:03:08,576 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 09:03:08,576 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 09:03:08,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 09:03:08,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 09:03:08,576 INFO L87 Difference]: Start difference. First operand 615 states and 783 transitions. Second operand 6 states. [2018-12-09 09:03:08,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:03:08,665 INFO L93 Difference]: Finished difference Result 1614 states and 2106 transitions. [2018-12-09 09:03:08,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 09:03:08,665 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 83 [2018-12-09 09:03:08,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:03:08,670 INFO L225 Difference]: With dead ends: 1614 [2018-12-09 09:03:08,670 INFO L226 Difference]: Without dead ends: 1021 [2018-12-09 09:03:08,672 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2018-12-09 09:03:08,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1021 states. [2018-12-09 09:03:08,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1021 to 997. [2018-12-09 09:03:08,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 997 states. [2018-12-09 09:03:08,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 997 states to 997 states and 1283 transitions. [2018-12-09 09:03:08,717 INFO L78 Accepts]: Start accepts. Automaton has 997 states and 1283 transitions. Word has length 83 [2018-12-09 09:03:08,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:03:08,718 INFO L480 AbstractCegarLoop]: Abstraction has 997 states and 1283 transitions. [2018-12-09 09:03:08,718 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 09:03:08,718 INFO L276 IsEmpty]: Start isEmpty. Operand 997 states and 1283 transitions. [2018-12-09 09:03:08,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-09 09:03:08,719 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:03:08,719 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-12-09 09:03:08,719 INFO L423 AbstractCegarLoop]: === Iteration 7 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:03:08,719 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:03:08,719 INFO L82 PathProgramCache]: Analyzing trace with hash -1464051195, now seen corresponding path program 1 times [2018-12-09 09:03:08,719 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:03:08,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:03:08,720 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:03:08,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:03:08,720 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:03:08,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:03:08,813 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:03:08,813 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:03:08,813 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-09 09:03:08,814 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 09:03:08,814 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 09:03:08,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 09:03:08,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-12-09 09:03:08,814 INFO L87 Difference]: Start difference. First operand 997 states and 1283 transitions. Second operand 8 states. [2018-12-09 09:03:09,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:03:09,757 INFO L93 Difference]: Finished difference Result 3104 states and 4403 transitions. [2018-12-09 09:03:09,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-09 09:03:09,758 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 96 [2018-12-09 09:03:09,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:03:09,765 INFO L225 Difference]: With dead ends: 3104 [2018-12-09 09:03:09,765 INFO L226 Difference]: Without dead ends: 2261 [2018-12-09 09:03:09,768 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2018-12-09 09:03:09,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2261 states. [2018-12-09 09:03:09,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2261 to 2144. [2018-12-09 09:03:09,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2144 states. [2018-12-09 09:03:09,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2144 states to 2144 states and 2980 transitions. [2018-12-09 09:03:09,836 INFO L78 Accepts]: Start accepts. Automaton has 2144 states and 2980 transitions. Word has length 96 [2018-12-09 09:03:09,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:03:09,836 INFO L480 AbstractCegarLoop]: Abstraction has 2144 states and 2980 transitions. [2018-12-09 09:03:09,836 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 09:03:09,837 INFO L276 IsEmpty]: Start isEmpty. Operand 2144 states and 2980 transitions. [2018-12-09 09:03:09,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-12-09 09:03:09,838 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:03:09,838 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:03:09,838 INFO L423 AbstractCegarLoop]: === Iteration 8 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:03:09,838 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:03:09,839 INFO L82 PathProgramCache]: Analyzing trace with hash 431251471, now seen corresponding path program 1 times [2018-12-09 09:03:09,839 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:03:09,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:03:09,839 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:03:09,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:03:09,840 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:03:09,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:03:09,928 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:03:09,929 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:03:09,929 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-09 09:03:09,929 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 09:03:09,929 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 09:03:09,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 09:03:09,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-09 09:03:09,930 INFO L87 Difference]: Start difference. First operand 2144 states and 2980 transitions. Second operand 8 states. [2018-12-09 09:03:11,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:03:11,039 INFO L93 Difference]: Finished difference Result 4432 states and 6597 transitions. [2018-12-09 09:03:11,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-09 09:03:11,040 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 101 [2018-12-09 09:03:11,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:03:11,048 INFO L225 Difference]: With dead ends: 4432 [2018-12-09 09:03:11,049 INFO L226 Difference]: Without dead ends: 2441 [2018-12-09 09:03:11,055 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2018-12-09 09:03:11,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2441 states. [2018-12-09 09:03:11,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2441 to 2246. [2018-12-09 09:03:11,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2246 states. [2018-12-09 09:03:11,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2246 states to 2246 states and 3205 transitions. [2018-12-09 09:03:11,128 INFO L78 Accepts]: Start accepts. Automaton has 2246 states and 3205 transitions. Word has length 101 [2018-12-09 09:03:11,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:03:11,128 INFO L480 AbstractCegarLoop]: Abstraction has 2246 states and 3205 transitions. [2018-12-09 09:03:11,128 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 09:03:11,129 INFO L276 IsEmpty]: Start isEmpty. Operand 2246 states and 3205 transitions. [2018-12-09 09:03:11,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-12-09 09:03:11,130 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:03:11,130 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:03:11,130 INFO L423 AbstractCegarLoop]: === Iteration 9 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:03:11,130 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:03:11,130 INFO L82 PathProgramCache]: Analyzing trace with hash 461860182, now seen corresponding path program 1 times [2018-12-09 09:03:11,130 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:03:11,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:03:11,131 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:03:11,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:03:11,131 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:03:11,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:03:11,160 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-09 09:03:11,160 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 09:03:11,160 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 09:03:11,161 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 105 with the following transitions: [2018-12-09 09:03:11,163 INFO L205 CegarAbsIntRunner]: [81], [86], [100], [101], [111], [113], [115], [116], [136], [138], [143], [146], [151], [154], [159], [161], [164], [167], [181], [182], [183], [186], [192], [198], [202], [203], [213], [215], [217], [218], [237], [238], [239], [248], [251], [254], [269], [282], [286], [289], [301], [304], [306], [309], [325], [329], [334], [337], [350], [351], [365], [367], [397], [401], [411], [422], [424], [426], [427], [428], [429], [438], [439], [440], [444], [445], [446], [447], [448], [449], [454], [455], [460], [461], [462], [466], [467], [468], [469], [470], [471], [472], [473], [474], [475], [476], [496], [497], [498] [2018-12-09 09:03:11,192 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 09:03:11,193 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 09:03:11,385 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-09 09:03:11,386 INFO L272 AbstractInterpreter]: Visited 73 different actions 73 times. Never merged. Never widened. Performed 697 root evaluator evaluations with a maximum evaluation depth of 3. Performed 697 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Never found a fixpoint. Largest state had 46 variables. [2018-12-09 09:03:11,392 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:03:11,392 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-09 09:03:11,548 INFO L227 lantSequenceWeakener]: Weakened 81 states. On average, predicates are now at 82.05% of their original sizes. [2018-12-09 09:03:11,548 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-09 09:03:11,761 INFO L418 sIntCurrentIteration]: We unified 103 AI predicates to 103 [2018-12-09 09:03:11,761 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-09 09:03:11,762 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-09 09:03:11,762 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [30] imperfect sequences [3] total 31 [2018-12-09 09:03:11,762 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 09:03:11,762 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-12-09 09:03:11,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-12-09 09:03:11,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=759, Unknown=0, NotChecked=0, Total=870 [2018-12-09 09:03:11,763 INFO L87 Difference]: Start difference. First operand 2246 states and 3205 transitions. Second operand 30 states. [2018-12-09 09:03:14,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:03:14,661 INFO L93 Difference]: Finished difference Result 4428 states and 6358 transitions. [2018-12-09 09:03:14,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-12-09 09:03:14,661 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 104 [2018-12-09 09:03:14,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:03:14,667 INFO L225 Difference]: With dead ends: 4428 [2018-12-09 09:03:14,667 INFO L226 Difference]: Without dead ends: 2197 [2018-12-09 09:03:14,672 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 123 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 522 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=403, Invalid=2047, Unknown=0, NotChecked=0, Total=2450 [2018-12-09 09:03:14,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2197 states. [2018-12-09 09:03:14,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2197 to 2191. [2018-12-09 09:03:14,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2191 states. [2018-12-09 09:03:14,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2191 states to 2191 states and 3113 transitions. [2018-12-09 09:03:14,736 INFO L78 Accepts]: Start accepts. Automaton has 2191 states and 3113 transitions. Word has length 104 [2018-12-09 09:03:14,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:03:14,736 INFO L480 AbstractCegarLoop]: Abstraction has 2191 states and 3113 transitions. [2018-12-09 09:03:14,736 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-12-09 09:03:14,736 INFO L276 IsEmpty]: Start isEmpty. Operand 2191 states and 3113 transitions. [2018-12-09 09:03:14,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-12-09 09:03:14,737 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:03:14,738 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:03:14,738 INFO L423 AbstractCegarLoop]: === Iteration 10 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:03:14,738 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:03:14,738 INFO L82 PathProgramCache]: Analyzing trace with hash -232846251, now seen corresponding path program 1 times [2018-12-09 09:03:14,738 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:03:14,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:03:14,739 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:03:14,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:03:14,739 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:03:14,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:03:14,768 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-12-09 09:03:14,768 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 09:03:14,768 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 09:03:14,768 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 107 with the following transitions: [2018-12-09 09:03:14,769 INFO L205 CegarAbsIntRunner]: [81], [86], [100], [101], [111], [113], [115], [116], [136], [138], [143], [146], [151], [154], [159], [161], [164], [167], [181], [182], [183], [186], [192], [198], [202], [203], [213], [215], [217], [218], [237], [238], [239], [248], [251], [254], [260], [266], [269], [273], [279], [282], [286], [289], [301], [304], [306], [309], [325], [329], [334], [337], [350], [351], [365], [367], [397], [401], [411], [422], [424], [426], [427], [428], [429], [438], [439], [440], [444], [445], [446], [447], [448], [449], [454], [455], [460], [461], [462], [466], [467], [468], [469], [470], [471], [472], [473], [474], [475], [476], [496], [497], [498] [2018-12-09 09:03:14,772 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 09:03:14,772 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 09:03:14,835 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-09 09:03:14,835 INFO L272 AbstractInterpreter]: Visited 88 different actions 104 times. Merged at 9 different actions 9 times. Never widened. Performed 1032 root evaluator evaluations with a maximum evaluation depth of 3. Performed 1032 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 48 variables. [2018-12-09 09:03:14,839 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:03:14,839 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-09 09:03:14,921 INFO L227 lantSequenceWeakener]: Weakened 99 states. On average, predicates are now at 83.27% of their original sizes. [2018-12-09 09:03:14,921 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-09 09:03:15,182 INFO L418 sIntCurrentIteration]: We unified 105 AI predicates to 105 [2018-12-09 09:03:15,182 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-09 09:03:15,182 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-09 09:03:15,182 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [38] imperfect sequences [3] total 39 [2018-12-09 09:03:15,182 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 09:03:15,183 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-12-09 09:03:15,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-12-09 09:03:15,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=268, Invalid=1138, Unknown=0, NotChecked=0, Total=1406 [2018-12-09 09:03:15,183 INFO L87 Difference]: Start difference. First operand 2191 states and 3113 transitions. Second operand 38 states. [2018-12-09 09:03:21,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:03:21,882 INFO L93 Difference]: Finished difference Result 5938 states and 9273 transitions. [2018-12-09 09:03:21,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-12-09 09:03:21,882 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 106 [2018-12-09 09:03:21,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:03:21,892 INFO L225 Difference]: With dead ends: 5938 [2018-12-09 09:03:21,892 INFO L226 Difference]: Without dead ends: 3611 [2018-12-09 09:03:21,902 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 147 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2039 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1065, Invalid=5255, Unknown=0, NotChecked=0, Total=6320 [2018-12-09 09:03:21,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3611 states. [2018-12-09 09:03:22,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3611 to 3287. [2018-12-09 09:03:22,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3287 states. [2018-12-09 09:03:22,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3287 states to 3287 states and 4806 transitions. [2018-12-09 09:03:22,042 INFO L78 Accepts]: Start accepts. Automaton has 3287 states and 4806 transitions. Word has length 106 [2018-12-09 09:03:22,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:03:22,043 INFO L480 AbstractCegarLoop]: Abstraction has 3287 states and 4806 transitions. [2018-12-09 09:03:22,043 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-12-09 09:03:22,043 INFO L276 IsEmpty]: Start isEmpty. Operand 3287 states and 4806 transitions. [2018-12-09 09:03:22,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-12-09 09:03:22,044 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:03:22,044 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:03:22,044 INFO L423 AbstractCegarLoop]: === Iteration 11 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:03:22,044 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:03:22,044 INFO L82 PathProgramCache]: Analyzing trace with hash -2009266943, now seen corresponding path program 1 times [2018-12-09 09:03:22,045 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:03:22,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:03:22,045 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:03:22,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:03:22,045 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:03:22,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:03:22,092 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-09 09:03:22,093 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:03:22,093 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 09:03:22,093 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 09:03:22,093 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 09:03:22,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 09:03:22,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-09 09:03:22,093 INFO L87 Difference]: Start difference. First operand 3287 states and 4806 transitions. Second operand 7 states. [2018-12-09 09:03:22,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:03:22,480 INFO L93 Difference]: Finished difference Result 7904 states and 12345 transitions. [2018-12-09 09:03:22,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-09 09:03:22,481 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 112 [2018-12-09 09:03:22,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:03:22,494 INFO L225 Difference]: With dead ends: 7904 [2018-12-09 09:03:22,494 INFO L226 Difference]: Without dead ends: 4708 [2018-12-09 09:03:22,508 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2018-12-09 09:03:22,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4708 states. [2018-12-09 09:03:22,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4708 to 4670. [2018-12-09 09:03:22,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4670 states. [2018-12-09 09:03:22,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4670 states to 4670 states and 6974 transitions. [2018-12-09 09:03:22,658 INFO L78 Accepts]: Start accepts. Automaton has 4670 states and 6974 transitions. Word has length 112 [2018-12-09 09:03:22,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:03:22,658 INFO L480 AbstractCegarLoop]: Abstraction has 4670 states and 6974 transitions. [2018-12-09 09:03:22,658 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 09:03:22,658 INFO L276 IsEmpty]: Start isEmpty. Operand 4670 states and 6974 transitions. [2018-12-09 09:03:22,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-12-09 09:03:22,659 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:03:22,659 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:03:22,660 INFO L423 AbstractCegarLoop]: === Iteration 12 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:03:22,660 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:03:22,660 INFO L82 PathProgramCache]: Analyzing trace with hash 303602526, now seen corresponding path program 1 times [2018-12-09 09:03:22,660 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:03:22,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:03:22,660 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:03:22,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:03:22,660 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:03:22,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:03:22,739 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-09 09:03:22,740 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:03:22,740 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-09 09:03:22,740 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 09:03:22,740 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 09:03:22,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 09:03:22,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-09 09:03:22,740 INFO L87 Difference]: Start difference. First operand 4670 states and 6974 transitions. Second operand 8 states. [2018-12-09 09:03:23,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:03:23,088 INFO L93 Difference]: Finished difference Result 9927 states and 15577 transitions. [2018-12-09 09:03:23,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-09 09:03:23,089 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 116 [2018-12-09 09:03:23,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:03:23,104 INFO L225 Difference]: With dead ends: 9927 [2018-12-09 09:03:23,104 INFO L226 Difference]: Without dead ends: 5018 [2018-12-09 09:03:23,125 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2018-12-09 09:03:23,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5018 states. [2018-12-09 09:03:23,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5018 to 4950. [2018-12-09 09:03:23,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4950 states. [2018-12-09 09:03:23,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4950 states to 4950 states and 7442 transitions. [2018-12-09 09:03:23,310 INFO L78 Accepts]: Start accepts. Automaton has 4950 states and 7442 transitions. Word has length 116 [2018-12-09 09:03:23,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:03:23,310 INFO L480 AbstractCegarLoop]: Abstraction has 4950 states and 7442 transitions. [2018-12-09 09:03:23,310 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 09:03:23,310 INFO L276 IsEmpty]: Start isEmpty. Operand 4950 states and 7442 transitions. [2018-12-09 09:03:23,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-12-09 09:03:23,312 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:03:23,312 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:03:23,312 INFO L423 AbstractCegarLoop]: === Iteration 13 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:03:23,312 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:03:23,312 INFO L82 PathProgramCache]: Analyzing trace with hash 37612192, now seen corresponding path program 1 times [2018-12-09 09:03:23,312 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:03:23,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:03:23,313 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:03:23,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:03:23,313 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:03:23,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:03:23,378 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 14 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-09 09:03:23,378 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 09:03:23,379 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 09:03:23,379 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 122 with the following transitions: [2018-12-09 09:03:23,379 INFO L205 CegarAbsIntRunner]: [2], [18], [40], [56], [59], [66], [67], [70], [72], [75], [77], [80], [81], [86], [100], [101], [111], [113], [115], [116], [136], [138], [143], [146], [151], [154], [159], [161], [164], [167], [181], [182], [183], [186], [192], [198], [202], [203], [213], [215], [217], [218], [237], [238], [239], [248], [251], [254], [260], [263], [273], [276], [282], [295], [351], [365], [367], [397], [401], [411], [422], [424], [426], [427], [428], [429], [430], [434], [435], [436], [438], [439], [440], [444], [445], [446], [447], [448], [449], [454], [455], [456], [457], [458], [466], [467], [468], [469], [470], [471], [472], [473], [474], [475], [476], [496], [497], [498] [2018-12-09 09:03:23,380 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 09:03:23,380 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 09:03:23,407 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-09 09:03:23,407 INFO L272 AbstractInterpreter]: Visited 95 different actions 99 times. Never merged. Never widened. Performed 928 root evaluator evaluations with a maximum evaluation depth of 3. Performed 928 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Never found a fixpoint. Largest state had 47 variables. [2018-12-09 09:03:23,415 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:03:23,415 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-09 09:03:23,504 INFO L227 lantSequenceWeakener]: Weakened 115 states. On average, predicates are now at 81.95% of their original sizes. [2018-12-09 09:03:23,504 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-09 09:03:23,955 INFO L418 sIntCurrentIteration]: We unified 120 AI predicates to 120 [2018-12-09 09:03:23,955 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-09 09:03:23,955 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-09 09:03:23,955 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [44] imperfect sequences [8] total 50 [2018-12-09 09:03:23,955 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 09:03:23,955 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-12-09 09:03:23,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-12-09 09:03:23,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=256, Invalid=1636, Unknown=0, NotChecked=0, Total=1892 [2018-12-09 09:03:23,956 INFO L87 Difference]: Start difference. First operand 4950 states and 7442 transitions. Second operand 44 states. [2018-12-09 09:03:27,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:03:27,974 INFO L93 Difference]: Finished difference Result 10248 states and 15502 transitions. [2018-12-09 09:03:27,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-12-09 09:03:27,974 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 121 [2018-12-09 09:03:27,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:03:27,996 INFO L225 Difference]: With dead ends: 10248 [2018-12-09 09:03:27,996 INFO L226 Difference]: Without dead ends: 5413 [2018-12-09 09:03:28,010 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 150 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1496 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=714, Invalid=4688, Unknown=0, NotChecked=0, Total=5402 [2018-12-09 09:03:28,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5413 states. [2018-12-09 09:03:28,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5413 to 5394. [2018-12-09 09:03:28,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5394 states. [2018-12-09 09:03:28,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5394 states to 5394 states and 8051 transitions. [2018-12-09 09:03:28,200 INFO L78 Accepts]: Start accepts. Automaton has 5394 states and 8051 transitions. Word has length 121 [2018-12-09 09:03:28,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:03:28,201 INFO L480 AbstractCegarLoop]: Abstraction has 5394 states and 8051 transitions. [2018-12-09 09:03:28,201 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-12-09 09:03:28,201 INFO L276 IsEmpty]: Start isEmpty. Operand 5394 states and 8051 transitions. [2018-12-09 09:03:28,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-12-09 09:03:28,202 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:03:28,203 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:03:28,203 INFO L423 AbstractCegarLoop]: === Iteration 14 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:03:28,203 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:03:28,203 INFO L82 PathProgramCache]: Analyzing trace with hash 695809695, now seen corresponding path program 1 times [2018-12-09 09:03:28,203 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:03:28,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:03:28,204 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:03:28,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:03:28,204 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:03:28,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:03:28,258 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 16 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-09 09:03:28,259 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 09:03:28,259 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 09:03:28,259 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 123 with the following transitions: [2018-12-09 09:03:28,259 INFO L205 CegarAbsIntRunner]: [2], [18], [21], [28], [30], [37], [40], [56], [59], [66], [67], [70], [72], [75], [77], [80], [81], [86], [100], [101], [111], [113], [115], [116], [136], [138], [143], [146], [151], [154], [159], [161], [164], [167], [181], [182], [183], [186], [192], [198], [202], [203], [213], [215], [217], [218], [237], [238], [239], [248], [251], [254], [260], [263], [273], [276], [295], [351], [365], [367], [397], [401], [411], [422], [424], [426], [427], [428], [429], [430], [431], [434], [435], [436], [438], [439], [440], [444], [445], [446], [447], [448], [449], [454], [455], [456], [457], [458], [459], [466], [467], [468], [469], [470], [471], [472], [473], [474], [475], [476], [496], [497], [498] [2018-12-09 09:03:28,260 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 09:03:28,260 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 09:03:28,285 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-09 09:03:28,285 INFO L272 AbstractInterpreter]: Visited 101 different actions 105 times. Never merged. Never widened. Performed 938 root evaluator evaluations with a maximum evaluation depth of 3. Performed 938 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Never found a fixpoint. Largest state had 47 variables. [2018-12-09 09:03:28,286 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:03:28,286 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-09 09:03:28,361 INFO L227 lantSequenceWeakener]: Weakened 117 states. On average, predicates are now at 80.1% of their original sizes. [2018-12-09 09:03:28,362 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-09 09:03:28,759 INFO L418 sIntCurrentIteration]: We unified 121 AI predicates to 121 [2018-12-09 09:03:28,759 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-09 09:03:28,760 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-09 09:03:28,760 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [45] imperfect sequences [9] total 52 [2018-12-09 09:03:28,760 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 09:03:28,760 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-12-09 09:03:28,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-12-09 09:03:28,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=292, Invalid=1688, Unknown=0, NotChecked=0, Total=1980 [2018-12-09 09:03:28,761 INFO L87 Difference]: Start difference. First operand 5394 states and 8051 transitions. Second operand 45 states. [2018-12-09 09:03:33,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:03:33,140 INFO L93 Difference]: Finished difference Result 8110 states and 12002 transitions. [2018-12-09 09:03:33,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-12-09 09:03:33,140 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 122 [2018-12-09 09:03:33,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:03:33,153 INFO L225 Difference]: With dead ends: 8110 [2018-12-09 09:03:33,153 INFO L226 Difference]: Without dead ends: 5566 [2018-12-09 09:03:33,159 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 153 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1662 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=797, Invalid=5055, Unknown=0, NotChecked=0, Total=5852 [2018-12-09 09:03:33,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5566 states. [2018-12-09 09:03:33,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5566 to 5545. [2018-12-09 09:03:33,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5545 states. [2018-12-09 09:03:33,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5545 states to 5545 states and 8249 transitions. [2018-12-09 09:03:33,316 INFO L78 Accepts]: Start accepts. Automaton has 5545 states and 8249 transitions. Word has length 122 [2018-12-09 09:03:33,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:03:33,317 INFO L480 AbstractCegarLoop]: Abstraction has 5545 states and 8249 transitions. [2018-12-09 09:03:33,317 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-12-09 09:03:33,317 INFO L276 IsEmpty]: Start isEmpty. Operand 5545 states and 8249 transitions. [2018-12-09 09:03:33,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-12-09 09:03:33,318 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:03:33,318 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:03:33,318 INFO L423 AbstractCegarLoop]: === Iteration 15 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:03:33,319 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:03:33,319 INFO L82 PathProgramCache]: Analyzing trace with hash -1013829255, now seen corresponding path program 1 times [2018-12-09 09:03:33,319 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:03:33,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:03:33,319 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:03:33,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:03:33,319 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:03:33,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:03:33,379 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-09 09:03:33,379 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 09:03:33,379 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 09:03:33,380 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 126 with the following transitions: [2018-12-09 09:03:33,380 INFO L205 CegarAbsIntRunner]: [40], [56], [59], [66], [67], [70], [72], [77], [80], [81], [86], [100], [101], [111], [113], [115], [116], [136], [138], [143], [146], [151], [154], [159], [161], [164], [167], [181], [182], [183], [186], [192], [198], [202], [203], [213], [215], [217], [218], [219], [222], [233], [234], [237], [238], [239], [248], [251], [254], [260], [263], [273], [279], [286], [289], [301], [304], [325], [332], [334], [340], [343], [350], [351], [365], [367], [397], [401], [411], [422], [424], [426], [427], [428], [429], [434], [435], [436], [438], [439], [440], [444], [445], [446], [447], [448], [449], [454], [455], [456], [457], [460], [461], [464], [465], [466], [467], [468], [469], [470], [471], [472], [473], [474], [475], [476], [496], [497], [498] [2018-12-09 09:03:33,382 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 09:03:33,382 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 09:03:33,447 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-09 09:03:33,447 INFO L272 AbstractInterpreter]: Visited 106 different actions 113 times. Merged at 2 different actions 2 times. Never widened. Performed 1116 root evaluator evaluations with a maximum evaluation depth of 3. Performed 1116 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 48 variables. [2018-12-09 09:03:33,451 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:03:33,451 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-09 09:03:33,507 INFO L227 lantSequenceWeakener]: Weakened 120 states. On average, predicates are now at 82.25% of their original sizes. [2018-12-09 09:03:33,507 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-09 09:03:33,971 INFO L418 sIntCurrentIteration]: We unified 124 AI predicates to 124 [2018-12-09 09:03:33,972 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-09 09:03:33,972 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-09 09:03:33,972 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [52] imperfect sequences [9] total 59 [2018-12-09 09:03:33,972 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 09:03:33,972 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-12-09 09:03:33,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-12-09 09:03:33,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=363, Invalid=2289, Unknown=0, NotChecked=0, Total=2652 [2018-12-09 09:03:33,973 INFO L87 Difference]: Start difference. First operand 5545 states and 8249 transitions. Second operand 52 states. [2018-12-09 09:03:39,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:03:39,044 INFO L93 Difference]: Finished difference Result 11051 states and 16613 transitions. [2018-12-09 09:03:39,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-12-09 09:03:39,044 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 125 [2018-12-09 09:03:39,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:03:39,057 INFO L225 Difference]: With dead ends: 11051 [2018-12-09 09:03:39,058 INFO L226 Difference]: Without dead ends: 5850 [2018-12-09 09:03:39,069 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 160 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2176 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=964, Invalid=6692, Unknown=0, NotChecked=0, Total=7656 [2018-12-09 09:03:39,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5850 states. [2018-12-09 09:03:39,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5850 to 5825. [2018-12-09 09:03:39,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5825 states. [2018-12-09 09:03:39,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5825 states to 5825 states and 8671 transitions. [2018-12-09 09:03:39,258 INFO L78 Accepts]: Start accepts. Automaton has 5825 states and 8671 transitions. Word has length 125 [2018-12-09 09:03:39,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:03:39,258 INFO L480 AbstractCegarLoop]: Abstraction has 5825 states and 8671 transitions. [2018-12-09 09:03:39,258 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-12-09 09:03:39,258 INFO L276 IsEmpty]: Start isEmpty. Operand 5825 states and 8671 transitions. [2018-12-09 09:03:39,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-12-09 09:03:39,260 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:03:39,260 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:03:39,260 INFO L423 AbstractCegarLoop]: === Iteration 16 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:03:39,260 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:03:39,260 INFO L82 PathProgramCache]: Analyzing trace with hash -1909929768, now seen corresponding path program 1 times [2018-12-09 09:03:39,260 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:03:39,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:03:39,261 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:03:39,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:03:39,261 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:03:39,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:03:39,323 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 15 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-09 09:03:39,323 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 09:03:39,323 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 09:03:39,323 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 126 with the following transitions: [2018-12-09 09:03:39,324 INFO L205 CegarAbsIntRunner]: [2], [4], [7], [18], [21], [28], [30], [37], [40], [56], [59], [66], [67], [70], [72], [75], [77], [80], [81], [86], [100], [101], [111], [113], [115], [116], [136], [138], [143], [146], [151], [154], [159], [161], [164], [167], [181], [182], [183], [186], [192], [198], [202], [203], [213], [215], [217], [218], [237], [238], [239], [248], [251], [254], [260], [263], [266], [273], [276], [295], [351], [365], [367], [397], [401], [411], [422], [424], [426], [427], [428], [429], [430], [431], [434], [435], [436], [438], [439], [440], [444], [445], [446], [447], [448], [449], [454], [455], [456], [457], [458], [459], [466], [467], [468], [469], [470], [471], [472], [473], [474], [475], [476], [496], [497], [498] [2018-12-09 09:03:39,325 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 09:03:39,325 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 09:03:39,371 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 09:03:39,371 INFO L272 AbstractInterpreter]: Visited 105 different actions 135 times. Merged at 11 different actions 12 times. Never widened. Performed 1540 root evaluator evaluations with a maximum evaluation depth of 3. Performed 1540 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Never found a fixpoint. Largest state had 47 variables. [2018-12-09 09:03:39,372 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:03:39,373 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 09:03:39,373 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 09:03:39,373 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_baa69fca-6ce1-4270-9804-ba1337b7c1a0/bin-2019/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 09:03:39,380 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:03:39,380 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 09:03:39,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:03:39,447 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 09:03:39,481 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:03:39,481 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 09:03:39,541 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-09 09:03:39,557 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-12-09 09:03:39,557 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [7] total 9 [2018-12-09 09:03:39,557 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 09:03:39,557 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 09:03:39,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 09:03:39,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2018-12-09 09:03:39,558 INFO L87 Difference]: Start difference. First operand 5825 states and 8671 transitions. Second operand 3 states. [2018-12-09 09:03:39,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:03:39,802 INFO L93 Difference]: Finished difference Result 15110 states and 24633 transitions. [2018-12-09 09:03:39,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 09:03:39,802 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 125 [2018-12-09 09:03:39,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:03:39,827 INFO L225 Difference]: With dead ends: 15110 [2018-12-09 09:03:39,827 INFO L226 Difference]: Without dead ends: 9854 [2018-12-09 09:03:39,849 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 259 GetRequests, 250 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2018-12-09 09:03:39,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9854 states. [2018-12-09 09:03:40,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9854 to 9840. [2018-12-09 09:03:40,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9840 states. [2018-12-09 09:03:40,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9840 states to 9840 states and 14802 transitions. [2018-12-09 09:03:40,133 INFO L78 Accepts]: Start accepts. Automaton has 9840 states and 14802 transitions. Word has length 125 [2018-12-09 09:03:40,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:03:40,133 INFO L480 AbstractCegarLoop]: Abstraction has 9840 states and 14802 transitions. [2018-12-09 09:03:40,133 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 09:03:40,133 INFO L276 IsEmpty]: Start isEmpty. Operand 9840 states and 14802 transitions. [2018-12-09 09:03:40,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-12-09 09:03:40,135 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:03:40,135 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:03:40,135 INFO L423 AbstractCegarLoop]: === Iteration 17 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:03:40,135 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:03:40,135 INFO L82 PathProgramCache]: Analyzing trace with hash 376796922, now seen corresponding path program 1 times [2018-12-09 09:03:40,135 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:03:40,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:03:40,136 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:03:40,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:03:40,136 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:03:40,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:03:40,225 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-12-09 09:03:40,225 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:03:40,225 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-09 09:03:40,225 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 09:03:40,226 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-09 09:03:40,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-09 09:03:40,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-12-09 09:03:40,226 INFO L87 Difference]: Start difference. First operand 9840 states and 14802 transitions. Second operand 9 states. [2018-12-09 09:03:40,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:03:40,632 INFO L93 Difference]: Finished difference Result 19570 states and 31538 transitions. [2018-12-09 09:03:40,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-09 09:03:40,632 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 127 [2018-12-09 09:03:40,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:03:40,672 INFO L225 Difference]: With dead ends: 19570 [2018-12-09 09:03:40,673 INFO L226 Difference]: Without dead ends: 11058 [2018-12-09 09:03:40,700 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2018-12-09 09:03:40,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11058 states. [2018-12-09 09:03:41,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11058 to 11031. [2018-12-09 09:03:41,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11031 states. [2018-12-09 09:03:41,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11031 states to 11031 states and 16887 transitions. [2018-12-09 09:03:41,060 INFO L78 Accepts]: Start accepts. Automaton has 11031 states and 16887 transitions. Word has length 127 [2018-12-09 09:03:41,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:03:41,060 INFO L480 AbstractCegarLoop]: Abstraction has 11031 states and 16887 transitions. [2018-12-09 09:03:41,061 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-09 09:03:41,061 INFO L276 IsEmpty]: Start isEmpty. Operand 11031 states and 16887 transitions. [2018-12-09 09:03:41,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-12-09 09:03:41,062 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:03:41,062 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:03:41,062 INFO L423 AbstractCegarLoop]: === Iteration 18 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:03:41,062 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:03:41,062 INFO L82 PathProgramCache]: Analyzing trace with hash -39889876, now seen corresponding path program 1 times [2018-12-09 09:03:41,062 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:03:41,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:03:41,063 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:03:41,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:03:41,063 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:03:41,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:03:41,127 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 16 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-09 09:03:41,127 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 09:03:41,127 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 09:03:41,128 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 131 with the following transitions: [2018-12-09 09:03:41,128 INFO L205 CegarAbsIntRunner]: [2], [18], [21], [28], [30], [37], [40], [56], [59], [66], [67], [70], [72], [75], [77], [80], [81], [86], [100], [101], [111], [113], [115], [116], [136], [138], [143], [146], [151], [154], [159], [161], [164], [167], [181], [182], [183], [186], [192], [198], [202], [203], [213], [215], [217], [218], [237], [238], [239], [248], [251], [254], [260], [263], [273], [276], [286], [289], [301], [304], [323], [348], [350], [351], [365], [367], [397], [401], [411], [422], [424], [426], [427], [428], [429], [430], [431], [434], [435], [436], [438], [439], [440], [444], [445], [446], [447], [448], [449], [454], [455], [456], [457], [458], [459], [460], [461], [466], [467], [468], [469], [470], [471], [472], [473], [474], [475], [476], [496], [497], [498] [2018-12-09 09:03:41,129 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 09:03:41,129 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 09:03:41,154 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-09 09:03:41,154 INFO L272 AbstractInterpreter]: Visited 106 different actions 110 times. Never merged. Never widened. Performed 992 root evaluator evaluations with a maximum evaluation depth of 3. Performed 992 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Never found a fixpoint. Largest state had 48 variables. [2018-12-09 09:03:41,155 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:03:41,155 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-09 09:03:41,210 INFO L227 lantSequenceWeakener]: Weakened 122 states. On average, predicates are now at 79.27% of their original sizes. [2018-12-09 09:03:41,211 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-09 09:03:41,614 INFO L418 sIntCurrentIteration]: We unified 129 AI predicates to 129 [2018-12-09 09:03:41,614 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-09 09:03:41,615 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-09 09:03:41,615 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [46] imperfect sequences [10] total 54 [2018-12-09 09:03:41,615 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 09:03:41,615 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-12-09 09:03:41,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-12-09 09:03:41,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=293, Invalid=1777, Unknown=0, NotChecked=0, Total=2070 [2018-12-09 09:03:41,616 INFO L87 Difference]: Start difference. First operand 11031 states and 16887 transitions. Second operand 46 states. [2018-12-09 09:03:46,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:03:46,462 INFO L93 Difference]: Finished difference Result 16252 states and 24808 transitions. [2018-12-09 09:03:46,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-12-09 09:03:46,462 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 130 [2018-12-09 09:03:46,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:03:46,486 INFO L225 Difference]: With dead ends: 16252 [2018-12-09 09:03:46,487 INFO L226 Difference]: Without dead ends: 11045 [2018-12-09 09:03:46,500 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 161 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1626 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=782, Invalid=5224, Unknown=0, NotChecked=0, Total=6006 [2018-12-09 09:03:46,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11045 states. [2018-12-09 09:03:46,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11045 to 11027. [2018-12-09 09:03:46,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11027 states. [2018-12-09 09:03:46,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11027 states to 11027 states and 16873 transitions. [2018-12-09 09:03:46,823 INFO L78 Accepts]: Start accepts. Automaton has 11027 states and 16873 transitions. Word has length 130 [2018-12-09 09:03:46,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:03:46,823 INFO L480 AbstractCegarLoop]: Abstraction has 11027 states and 16873 transitions. [2018-12-09 09:03:46,824 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-12-09 09:03:46,824 INFO L276 IsEmpty]: Start isEmpty. Operand 11027 states and 16873 transitions. [2018-12-09 09:03:46,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2018-12-09 09:03:46,825 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:03:46,825 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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] [2018-12-09 09:03:46,825 INFO L423 AbstractCegarLoop]: === Iteration 19 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:03:46,825 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:03:46,825 INFO L82 PathProgramCache]: Analyzing trace with hash 1995082838, now seen corresponding path program 1 times [2018-12-09 09:03:46,825 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:03:46,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:03:46,826 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:03:46,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:03:46,826 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:03:46,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:03:46,877 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 32 proven. 3 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-12-09 09:03:46,877 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 09:03:46,877 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 09:03:46,877 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 136 with the following transitions: [2018-12-09 09:03:46,877 INFO L205 CegarAbsIntRunner]: [2], [18], [21], [28], [30], [37], [40], [56], [59], [66], [67], [70], [72], [75], [77], [80], [81], [86], [100], [101], [111], [113], [115], [116], [136], [138], [143], [146], [151], [154], [159], [161], [164], [167], [181], [182], [183], [186], [192], [198], [202], [203], [213], [215], [217], [218], [237], [238], [239], [248], [251], [254], [260], [263], [266], [273], [276], [282], [295], [351], [365], [367], [397], [401], [411], [422], [424], [426], [427], [428], [429], [430], [431], [434], [435], [436], [438], [439], [440], [444], [445], [446], [447], [448], [449], [454], [455], [456], [457], [458], [459], [466], [467], [468], [469], [470], [471], [472], [473], [474], [475], [476], [496], [497], [498] [2018-12-09 09:03:46,878 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 09:03:46,878 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 09:03:46,968 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 09:03:46,969 INFO L272 AbstractInterpreter]: Visited 105 different actions 135 times. Merged at 11 different actions 12 times. Never widened. Performed 1540 root evaluator evaluations with a maximum evaluation depth of 3. Performed 1540 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Never found a fixpoint. Largest state had 47 variables. [2018-12-09 09:03:46,975 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:03:46,976 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 09:03:46,976 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 09:03:46,976 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_baa69fca-6ce1-4270-9804-ba1337b7c1a0/bin-2019/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 09:03:46,983 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:03:46,984 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 09:03:47,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:03:47,035 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 09:03:47,050 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-12-09 09:03:47,050 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 09:03:47,104 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-12-09 09:03:47,120 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-12-09 09:03:47,120 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 4] imperfect sequences [7] total 10 [2018-12-09 09:03:47,120 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 09:03:47,120 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 09:03:47,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 09:03:47,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2018-12-09 09:03:47,121 INFO L87 Difference]: Start difference. First operand 11027 states and 16873 transitions. Second operand 3 states. [2018-12-09 09:03:47,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:03:47,635 INFO L93 Difference]: Finished difference Result 28838 states and 47882 transitions. [2018-12-09 09:03:47,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 09:03:47,635 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 135 [2018-12-09 09:03:47,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:03:47,689 INFO L225 Difference]: With dead ends: 28838 [2018-12-09 09:03:47,689 INFO L226 Difference]: Without dead ends: 18792 [2018-12-09 09:03:47,738 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 276 GetRequests, 267 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2018-12-09 09:03:47,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18792 states. [2018-12-09 09:03:48,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18792 to 18776. [2018-12-09 09:03:48,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18776 states. [2018-12-09 09:03:48,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18776 states to 18776 states and 27349 transitions. [2018-12-09 09:03:48,259 INFO L78 Accepts]: Start accepts. Automaton has 18776 states and 27349 transitions. Word has length 135 [2018-12-09 09:03:48,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:03:48,259 INFO L480 AbstractCegarLoop]: Abstraction has 18776 states and 27349 transitions. [2018-12-09 09:03:48,259 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 09:03:48,259 INFO L276 IsEmpty]: Start isEmpty. Operand 18776 states and 27349 transitions. [2018-12-09 09:03:48,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-12-09 09:03:48,261 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:03:48,261 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:03:48,261 INFO L423 AbstractCegarLoop]: === Iteration 20 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:03:48,261 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:03:48,261 INFO L82 PathProgramCache]: Analyzing trace with hash 360364542, now seen corresponding path program 1 times [2018-12-09 09:03:48,262 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:03:48,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:03:48,262 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:03:48,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:03:48,262 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:03:48,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:03:48,316 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 16 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-09 09:03:48,316 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 09:03:48,317 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 09:03:48,317 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 145 with the following transitions: [2018-12-09 09:03:48,317 INFO L205 CegarAbsIntRunner]: [2], [18], [21], [28], [30], [37], [40], [56], [59], [66], [67], [70], [72], [75], [80], [81], [86], [100], [101], [111], [113], [115], [116], [136], [138], [143], [146], [151], [154], [159], [161], [164], [167], [169], [174], [177], [181], [182], [183], [186], [192], [198], [202], [203], [213], [215], [217], [218], [219], [224], [227], [233], [234], [237], [238], [239], [248], [251], [254], [260], [263], [269], [273], [276], [282], [286], [289], [301], [304], [325], [332], [334], [337], [340], [343], [350], [351], [365], [367], [397], [401], [411], [422], [424], [426], [427], [428], [429], [430], [431], [434], [435], [438], [439], [440], [444], [445], [446], [447], [448], [449], [454], [455], [456], [457], [458], [459], [460], [461], [462], [464], [465], [466], [467], [468], [469], [470], [471], [472], [473], [474], [475], [476], [496], [497], [498] [2018-12-09 09:03:48,318 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 09:03:48,318 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 09:03:48,349 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-09 09:03:48,349 INFO L272 AbstractInterpreter]: Visited 124 different actions 136 times. Merged at 2 different actions 2 times. Never widened. Performed 1241 root evaluator evaluations with a maximum evaluation depth of 3. Performed 1241 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 48 variables. [2018-12-09 09:03:48,351 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:03:48,351 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-09 09:03:48,416 INFO L227 lantSequenceWeakener]: Weakened 140 states. On average, predicates are now at 79.78% of their original sizes. [2018-12-09 09:03:48,416 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-09 09:03:49,103 INFO L418 sIntCurrentIteration]: We unified 143 AI predicates to 143 [2018-12-09 09:03:49,103 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-09 09:03:49,103 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-09 09:03:49,103 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [58] imperfect sequences [8] total 64 [2018-12-09 09:03:49,103 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 09:03:49,103 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-12-09 09:03:49,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-12-09 09:03:49,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=304, Invalid=3002, Unknown=0, NotChecked=0, Total=3306 [2018-12-09 09:03:49,104 INFO L87 Difference]: Start difference. First operand 18776 states and 27349 transitions. Second operand 58 states. [2018-12-09 09:04:04,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:04:04,309 INFO L93 Difference]: Finished difference Result 39158 states and 57522 transitions. [2018-12-09 09:04:04,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-12-09 09:04:04,309 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 144 [2018-12-09 09:04:04,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:04:04,358 INFO L225 Difference]: With dead ends: 39158 [2018-12-09 09:04:04,358 INFO L226 Difference]: Without dead ends: 21800 [2018-12-09 09:04:04,390 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 175 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2249 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=745, Invalid=7265, Unknown=0, NotChecked=0, Total=8010 [2018-12-09 09:04:04,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21800 states. [2018-12-09 09:04:04,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21800 to 21678. [2018-12-09 09:04:04,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21678 states. [2018-12-09 09:04:04,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21678 states to 21678 states and 31652 transitions. [2018-12-09 09:04:05,002 INFO L78 Accepts]: Start accepts. Automaton has 21678 states and 31652 transitions. Word has length 144 [2018-12-09 09:04:05,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:04:05,003 INFO L480 AbstractCegarLoop]: Abstraction has 21678 states and 31652 transitions. [2018-12-09 09:04:05,003 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-12-09 09:04:05,003 INFO L276 IsEmpty]: Start isEmpty. Operand 21678 states and 31652 transitions. [2018-12-09 09:04:05,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2018-12-09 09:04:05,005 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:04:05,005 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:04:05,006 INFO L423 AbstractCegarLoop]: === Iteration 21 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:04:05,006 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:04:05,006 INFO L82 PathProgramCache]: Analyzing trace with hash -914170763, now seen corresponding path program 1 times [2018-12-09 09:04:05,006 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:04:05,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:04:05,006 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:04:05,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:04:05,006 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:04:05,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:04:05,044 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-12-09 09:04:05,044 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:04:05,044 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 09:04:05,044 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 09:04:05,044 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 09:04:05,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 09:04:05,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 09:04:05,044 INFO L87 Difference]: Start difference. First operand 21678 states and 31652 transitions. Second operand 3 states. [2018-12-09 09:04:05,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:04:05,900 INFO L93 Difference]: Finished difference Result 56584 states and 88711 transitions. [2018-12-09 09:04:05,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 09:04:05,901 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 157 [2018-12-09 09:04:05,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:04:05,986 INFO L225 Difference]: With dead ends: 56584 [2018-12-09 09:04:05,986 INFO L226 Difference]: Without dead ends: 36143 [2018-12-09 09:04:06,056 INFO L631 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 [2018-12-09 09:04:06,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36143 states. [2018-12-09 09:04:06,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36143 to 36118. [2018-12-09 09:04:06,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36118 states. [2018-12-09 09:04:06,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36118 states to 36118 states and 50683 transitions. [2018-12-09 09:04:06,932 INFO L78 Accepts]: Start accepts. Automaton has 36118 states and 50683 transitions. Word has length 157 [2018-12-09 09:04:06,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:04:06,932 INFO L480 AbstractCegarLoop]: Abstraction has 36118 states and 50683 transitions. [2018-12-09 09:04:06,933 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 09:04:06,933 INFO L276 IsEmpty]: Start isEmpty. Operand 36118 states and 50683 transitions. [2018-12-09 09:04:06,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-12-09 09:04:06,938 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:04:06,939 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-12-09 09:04:06,939 INFO L423 AbstractCegarLoop]: === Iteration 22 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:04:06,939 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:04:06,939 INFO L82 PathProgramCache]: Analyzing trace with hash -1057338962, now seen corresponding path program 1 times [2018-12-09 09:04:06,939 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:04:06,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:04:06,939 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:04:06,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:04:06,940 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:04:06,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:04:06,991 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-12-09 09:04:06,991 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:04:06,991 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 09:04:06,991 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 09:04:06,991 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 09:04:06,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 09:04:06,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 09:04:06,992 INFO L87 Difference]: Start difference. First operand 36118 states and 50683 transitions. Second operand 4 states. [2018-12-09 09:04:08,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:04:08,119 INFO L93 Difference]: Finished difference Result 83166 states and 117573 transitions. [2018-12-09 09:04:08,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 09:04:08,120 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 179 [2018-12-09 09:04:08,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:04:08,221 INFO L225 Difference]: With dead ends: 83166 [2018-12-09 09:04:08,222 INFO L226 Difference]: Without dead ends: 47214 [2018-12-09 09:04:08,289 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 09:04:08,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47214 states. [2018-12-09 09:04:09,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47214 to 47214. [2018-12-09 09:04:09,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47214 states. [2018-12-09 09:04:09,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47214 states to 47214 states and 60410 transitions. [2018-12-09 09:04:09,346 INFO L78 Accepts]: Start accepts. Automaton has 47214 states and 60410 transitions. Word has length 179 [2018-12-09 09:04:09,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:04:09,346 INFO L480 AbstractCegarLoop]: Abstraction has 47214 states and 60410 transitions. [2018-12-09 09:04:09,346 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 09:04:09,346 INFO L276 IsEmpty]: Start isEmpty. Operand 47214 states and 60410 transitions. [2018-12-09 09:04:09,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2018-12-09 09:04:09,356 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:04:09,356 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:04:09,356 INFO L423 AbstractCegarLoop]: === Iteration 23 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:04:09,356 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:04:09,356 INFO L82 PathProgramCache]: Analyzing trace with hash -659305976, now seen corresponding path program 1 times [2018-12-09 09:04:09,356 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:04:09,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:04:09,357 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:04:09,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:04:09,357 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:04:09,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:04:09,418 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 25 proven. 20 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2018-12-09 09:04:09,418 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 09:04:09,419 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 09:04:09,419 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 209 with the following transitions: [2018-12-09 09:04:09,419 INFO L205 CegarAbsIntRunner]: [2], [4], [7], [18], [21], [28], [30], [37], [40], [56], [59], [66], [67], [70], [72], [75], [77], [80], [81], [86], [89], [91], [96], [98], [99], [100], [101], [104], [107], [111], [113], [115], [116], [136], [138], [143], [146], [149], [151], [154], [157], [159], [161], [164], [167], [169], [174], [179], [181], [182], [183], [186], [192], [198], [202], [203], [213], [215], [217], [218], [237], [238], [239], [248], [251], [254], [256], [260], [263], [266], [273], [276], [295], [300], [351], [365], [367], [369], [371], [376], [384], [387], [392], [397], [401], [411], [415], [418], [422], [424], [426], [427], [428], [429], [430], [431], [434], [435], [436], [438], [439], [440], [442], [443], [444], [445], [446], [447], [448], [449], [454], [455], [456], [457], [458], [459], [466], [467], [468], [469], [470], [471], [472], [473], [474], [475], [476], [477], [478], [479], [480], [481], [482], [483], [484], [485], [486], [487], [494], [495], [496], [497], [498] [2018-12-09 09:04:09,420 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 09:04:09,420 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 09:04:09,456 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 09:04:09,456 INFO L272 AbstractInterpreter]: Visited 111 different actions 141 times. Merged at 11 different actions 12 times. Never widened. Performed 1550 root evaluator evaluations with a maximum evaluation depth of 3. Performed 1550 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Never found a fixpoint. Largest state had 47 variables. [2018-12-09 09:04:09,457 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:04:09,457 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 09:04:09,457 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 09:04:09,458 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_baa69fca-6ce1-4270-9804-ba1337b7c1a0/bin-2019/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 09:04:09,463 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:04:09,463 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 09:04:09,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:04:09,522 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 09:04:09,539 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2018-12-09 09:04:09,540 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 09:04:09,598 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2018-12-09 09:04:09,613 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-12-09 09:04:09,613 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [8] total 9 [2018-12-09 09:04:09,613 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 09:04:09,614 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 09:04:09,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 09:04:09,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-12-09 09:04:09,614 INFO L87 Difference]: Start difference. First operand 47214 states and 60410 transitions. Second operand 3 states. [2018-12-09 09:04:11,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:04:11,069 INFO L93 Difference]: Finished difference Result 115031 states and 153532 transitions. [2018-12-09 09:04:11,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 09:04:11,070 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 208 [2018-12-09 09:04:11,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:04:11,244 INFO L225 Difference]: With dead ends: 115031 [2018-12-09 09:04:11,244 INFO L226 Difference]: Without dead ends: 68914 [2018-12-09 09:04:11,333 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 426 GetRequests, 417 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-12-09 09:04:11,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68914 states. [2018-12-09 09:04:12,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68914 to 68880. [2018-12-09 09:04:12,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68880 states. [2018-12-09 09:04:13,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68880 states to 68880 states and 88335 transitions. [2018-12-09 09:04:13,070 INFO L78 Accepts]: Start accepts. Automaton has 68880 states and 88335 transitions. Word has length 208 [2018-12-09 09:04:13,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:04:13,070 INFO L480 AbstractCegarLoop]: Abstraction has 68880 states and 88335 transitions. [2018-12-09 09:04:13,070 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 09:04:13,070 INFO L276 IsEmpty]: Start isEmpty. Operand 68880 states and 88335 transitions. [2018-12-09 09:04:13,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2018-12-09 09:04:13,082 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:04:13,082 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:04:13,082 INFO L423 AbstractCegarLoop]: === Iteration 24 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:04:13,082 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:04:13,082 INFO L82 PathProgramCache]: Analyzing trace with hash 1821969868, now seen corresponding path program 1 times [2018-12-09 09:04:13,082 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:04:13,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:04:13,083 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:04:13,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:04:13,083 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:04:13,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:04:13,163 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 25 proven. 20 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2018-12-09 09:04:13,163 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 09:04:13,163 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 09:04:13,163 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 207 with the following transitions: [2018-12-09 09:04:13,163 INFO L205 CegarAbsIntRunner]: [2], [4], [7], [18], [21], [28], [30], [37], [40], [56], [59], [66], [67], [70], [72], [75], [77], [80], [81], [86], [89], [91], [96], [98], [99], [100], [101], [104], [107], [111], [113], [115], [116], [136], [138], [143], [146], [149], [151], [154], [159], [161], [164], [167], [181], [182], [183], [186], [192], [198], [202], [203], [213], [215], [217], [218], [237], [238], [239], [248], [251], [254], [256], [260], [263], [266], [273], [276], [295], [300], [351], [365], [367], [369], [371], [376], [384], [387], [392], [397], [401], [411], [422], [424], [426], [427], [428], [429], [430], [431], [434], [435], [436], [438], [439], [440], [442], [443], [444], [445], [446], [447], [448], [449], [454], [455], [456], [457], [458], [459], [466], [467], [468], [469], [470], [471], [472], [473], [474], [475], [476], [477], [478], [479], [480], [481], [482], [483], [484], [485], [486], [487], [494], [495], [496], [497], [498] [2018-12-09 09:04:13,164 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 09:04:13,164 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 09:04:13,201 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 09:04:13,201 INFO L272 AbstractInterpreter]: Visited 108 different actions 138 times. Merged at 11 different actions 12 times. Never widened. Performed 1555 root evaluator evaluations with a maximum evaluation depth of 3. Performed 1555 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Never found a fixpoint. Largest state had 47 variables. [2018-12-09 09:04:13,203 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:04:13,203 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 09:04:13,203 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 09:04:13,203 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_baa69fca-6ce1-4270-9804-ba1337b7c1a0/bin-2019/utaipan/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 09:04:13,210 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:04:13,210 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 09:04:13,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:04:13,265 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 09:04:13,297 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2018-12-09 09:04:13,297 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 09:04:13,403 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-12-09 09:04:13,418 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-12-09 09:04:13,419 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 4] imperfect sequences [8] total 10 [2018-12-09 09:04:13,419 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 09:04:13,419 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 09:04:13,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 09:04:13,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-12-09 09:04:13,419 INFO L87 Difference]: Start difference. First operand 68880 states and 88335 transitions. Second operand 3 states. [2018-12-09 09:04:15,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:04:15,118 INFO L93 Difference]: Finished difference Result 114758 states and 147004 transitions. [2018-12-09 09:04:15,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 09:04:15,118 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 206 [2018-12-09 09:04:15,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:04:15,289 INFO L225 Difference]: With dead ends: 114758 [2018-12-09 09:04:15,289 INFO L226 Difference]: Without dead ends: 79118 [2018-12-09 09:04:15,340 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 422 GetRequests, 406 SyntacticMatches, 8 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-12-09 09:04:15,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79118 states. [2018-12-09 09:04:17,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79118 to 78923. [2018-12-09 09:04:17,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78923 states. [2018-12-09 09:04:17,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78923 states to 78923 states and 100608 transitions. [2018-12-09 09:04:17,430 INFO L78 Accepts]: Start accepts. Automaton has 78923 states and 100608 transitions. Word has length 206 [2018-12-09 09:04:17,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:04:17,431 INFO L480 AbstractCegarLoop]: Abstraction has 78923 states and 100608 transitions. [2018-12-09 09:04:17,431 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 09:04:17,431 INFO L276 IsEmpty]: Start isEmpty. Operand 78923 states and 100608 transitions. [2018-12-09 09:04:17,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2018-12-09 09:04:17,440 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:04:17,440 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:04:17,440 INFO L423 AbstractCegarLoop]: === Iteration 25 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:04:17,440 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:04:17,441 INFO L82 PathProgramCache]: Analyzing trace with hash 2045967119, now seen corresponding path program 1 times [2018-12-09 09:04:17,441 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:04:17,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:04:17,441 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:04:17,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:04:17,442 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:04:17,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:04:17,496 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 31 proven. 25 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2018-12-09 09:04:17,496 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 09:04:17,496 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 09:04:17,496 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 207 with the following transitions: [2018-12-09 09:04:17,497 INFO L205 CegarAbsIntRunner]: [2], [16], [35], [37], [81], [86], [89], [91], [96], [98], [99], [100], [101], [111], [113], [115], [116], [136], [138], [143], [146], [151], [154], [157], [159], [161], [164], [167], [181], [182], [183], [186], [192], [198], [202], [203], [213], [215], [217], [218], [237], [238], [239], [248], [251], [254], [256], [260], [266], [269], [273], [276], [279], [282], [286], [289], [295], [300], [301], [304], [306], [309], [325], [329], [334], [337], [350], [351], [365], [367], [369], [371], [376], [384], [387], [392], [397], [401], [404], [407], [411], [422], [424], [426], [427], [428], [429], [438], [439], [440], [442], [443], [444], [445], [446], [447], [448], [449], [454], [455], [458], [459], [460], [461], [462], [466], [467], [468], [469], [470], [471], [472], [473], [474], [475], [476], [477], [478], [479], [480], [481], [482], [483], [484], [485], [486], [487], [494], [495], [496], [497], [498] [2018-12-09 09:04:17,497 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 09:04:17,497 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 09:04:17,528 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-09 09:04:17,529 INFO L272 AbstractInterpreter]: Visited 96 different actions 125 times. Merged at 11 different actions 12 times. Never widened. Performed 1436 root evaluator evaluations with a maximum evaluation depth of 3. Performed 1436 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 48 variables. [2018-12-09 09:04:17,530 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:04:17,530 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-09 09:04:17,607 INFO L227 lantSequenceWeakener]: Weakened 129 states. On average, predicates are now at 78.67% of their original sizes. [2018-12-09 09:04:17,607 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-09 09:04:17,971 INFO L418 sIntCurrentIteration]: We unified 205 AI predicates to 205 [2018-12-09 09:04:17,971 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-09 09:04:17,972 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-09 09:04:17,972 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [44] imperfect sequences [8] total 50 [2018-12-09 09:04:17,972 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 09:04:17,972 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-12-09 09:04:17,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-12-09 09:04:17,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=376, Invalid=1516, Unknown=0, NotChecked=0, Total=1892 [2018-12-09 09:04:17,973 INFO L87 Difference]: Start difference. First operand 78923 states and 100608 transitions. Second operand 44 states. [2018-12-09 09:04:26,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:04:26,308 INFO L93 Difference]: Finished difference Result 167382 states and 214986 transitions. [2018-12-09 09:04:26,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-12-09 09:04:26,309 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 206 [2018-12-09 09:04:26,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:04:26,571 INFO L225 Difference]: With dead ends: 167382 [2018-12-09 09:04:26,571 INFO L226 Difference]: Without dead ends: 103411 [2018-12-09 09:04:26,669 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 242 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2144 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1235, Invalid=5245, Unknown=0, NotChecked=0, Total=6480 [2018-12-09 09:04:26,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103411 states. [2018-12-09 09:04:29,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103411 to 103339. [2018-12-09 09:04:29,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103339 states. [2018-12-09 09:04:29,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103339 states to 103339 states and 132644 transitions. [2018-12-09 09:04:29,393 INFO L78 Accepts]: Start accepts. Automaton has 103339 states and 132644 transitions. Word has length 206 [2018-12-09 09:04:29,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:04:29,394 INFO L480 AbstractCegarLoop]: Abstraction has 103339 states and 132644 transitions. [2018-12-09 09:04:29,394 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-12-09 09:04:29,394 INFO L276 IsEmpty]: Start isEmpty. Operand 103339 states and 132644 transitions. [2018-12-09 09:04:29,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2018-12-09 09:04:29,408 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:04:29,408 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:04:29,408 INFO L423 AbstractCegarLoop]: === Iteration 26 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:04:29,408 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:04:29,408 INFO L82 PathProgramCache]: Analyzing trace with hash -1933496065, now seen corresponding path program 1 times [2018-12-09 09:04:29,409 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:04:29,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:04:29,409 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:04:29,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:04:29,409 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:04:29,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:04:29,474 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2018-12-09 09:04:29,474 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:04:29,474 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 09:04:29,474 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 09:04:29,475 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 09:04:29,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 09:04:29,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 09:04:29,475 INFO L87 Difference]: Start difference. First operand 103339 states and 132644 transitions. Second operand 4 states. [2018-12-09 09:04:34,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:04:34,197 INFO L93 Difference]: Finished difference Result 261564 states and 353931 transitions. [2018-12-09 09:04:34,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 09:04:34,198 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 232 [2018-12-09 09:04:34,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:04:34,604 INFO L225 Difference]: With dead ends: 261564 [2018-12-09 09:04:34,604 INFO L226 Difference]: Without dead ends: 159493 [2018-12-09 09:04:34,778 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 09:04:34,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159493 states. [2018-12-09 09:04:38,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159493 to 159174. [2018-12-09 09:04:38,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159174 states. [2018-12-09 09:04:38,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159174 states to 159174 states and 203417 transitions. [2018-12-09 09:04:38,903 INFO L78 Accepts]: Start accepts. Automaton has 159174 states and 203417 transitions. Word has length 232 [2018-12-09 09:04:38,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:04:38,903 INFO L480 AbstractCegarLoop]: Abstraction has 159174 states and 203417 transitions. [2018-12-09 09:04:38,903 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 09:04:38,904 INFO L276 IsEmpty]: Start isEmpty. Operand 159174 states and 203417 transitions. [2018-12-09 09:04:38,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2018-12-09 09:04:38,915 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:04:38,915 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:04:38,915 INFO L423 AbstractCegarLoop]: === Iteration 27 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:04:38,916 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:04:38,916 INFO L82 PathProgramCache]: Analyzing trace with hash -187946573, now seen corresponding path program 1 times [2018-12-09 09:04:38,916 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:04:38,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:04:38,916 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:04:38,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:04:38,916 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:04:38,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:04:38,973 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2018-12-09 09:04:38,973 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:04:38,973 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 09:04:38,973 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 09:04:38,973 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 09:04:38,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 09:04:38,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 09:04:38,974 INFO L87 Difference]: Start difference. First operand 159174 states and 203417 transitions. Second operand 4 states. [2018-12-09 09:04:43,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:04:43,237 INFO L93 Difference]: Finished difference Result 306136 states and 400076 transitions. [2018-12-09 09:04:43,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 09:04:43,238 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 233 [2018-12-09 09:04:43,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:04:43,627 INFO L225 Difference]: With dead ends: 306136 [2018-12-09 09:04:43,627 INFO L226 Difference]: Without dead ends: 149155 [2018-12-09 09:04:43,828 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 09:04:43,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149155 states. [2018-12-09 09:04:49,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149155 to 149155. [2018-12-09 09:04:49,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149155 states. [2018-12-09 09:04:49,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149155 states to 149155 states and 186013 transitions. [2018-12-09 09:04:49,458 INFO L78 Accepts]: Start accepts. Automaton has 149155 states and 186013 transitions. Word has length 233 [2018-12-09 09:04:49,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:04:49,459 INFO L480 AbstractCegarLoop]: Abstraction has 149155 states and 186013 transitions. [2018-12-09 09:04:49,459 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 09:04:49,459 INFO L276 IsEmpty]: Start isEmpty. Operand 149155 states and 186013 transitions. [2018-12-09 09:04:49,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2018-12-09 09:04:49,471 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:04:49,471 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:04:49,471 INFO L423 AbstractCegarLoop]: === Iteration 28 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:04:49,471 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:04:49,471 INFO L82 PathProgramCache]: Analyzing trace with hash 323625693, now seen corresponding path program 1 times [2018-12-09 09:04:49,471 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:04:49,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:04:49,472 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:04:49,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:04:49,472 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:04:49,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:04:49,537 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 37 proven. 26 refuted. 0 times theorem prover too weak. 160 trivial. 0 not checked. [2018-12-09 09:04:49,537 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 09:04:49,537 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 09:04:49,538 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 263 with the following transitions: [2018-12-09 09:04:49,538 INFO L205 CegarAbsIntRunner]: [2], [4], [7], [18], [21], [28], [30], [37], [40], [56], [59], [66], [67], [70], [72], [75], [77], [80], [81], [86], [89], [91], [96], [98], [99], [100], [101], [104], [107], [109], [111], [113], [115], [116], [119], [125], [131], [135], [136], [138], [143], [146], [149], [151], [154], [157], [159], [161], [164], [167], [181], [182], [183], [186], [192], [198], [202], [203], [213], [215], [217], [218], [235], [236], [237], [238], [239], [248], [251], [254], [256], [260], [263], [266], [273], [276], [282], [295], [300], [351], [365], [367], [369], [371], [376], [379], [387], [392], [397], [401], [411], [415], [418], [422], [424], [426], [427], [428], [429], [430], [431], [434], [435], [436], [438], [439], [440], [442], [443], [444], [445], [446], [447], [448], [449], [454], [455], [456], [457], [458], [459], [466], [467], [468], [469], [470], [471], [472], [473], [474], [475], [476], [477], [478], [479], [480], [481], [482], [483], [484], [485], [486], [487], [488], [489], [490], [491], [492], [493], [494], [495], [496], [497], [498] [2018-12-09 09:04:49,538 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 09:04:49,539 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 09:04:49,574 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 09:04:49,574 INFO L272 AbstractInterpreter]: Visited 111 different actions 142 times. Merged at 11 different actions 12 times. Never widened. Performed 1562 root evaluator evaluations with a maximum evaluation depth of 3. Performed 1562 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Never found a fixpoint. Largest state had 47 variables. [2018-12-09 09:04:49,575 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:04:49,575 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 09:04:49,575 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 09:04:49,575 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_baa69fca-6ce1-4270-9804-ba1337b7c1a0/bin-2019/utaipan/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 09:04:49,582 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:04:49,582 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 09:04:49,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:04:49,642 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 09:04:49,668 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 162 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2018-12-09 09:04:49,668 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 09:04:49,779 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 52 proven. 7 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2018-12-09 09:04:49,795 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-09 09:04:49,795 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [8, 4] total 10 [2018-12-09 09:04:49,795 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 09:04:49,795 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 09:04:49,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 09:04:49,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-12-09 09:04:49,796 INFO L87 Difference]: Start difference. First operand 149155 states and 186013 transitions. Second operand 3 states. [2018-12-09 09:04:55,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:04:55,850 INFO L93 Difference]: Finished difference Result 392678 states and 513170 transitions. [2018-12-09 09:04:55,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 09:04:55,850 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 262 [2018-12-09 09:04:55,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:04:56,544 INFO L225 Difference]: With dead ends: 392678 [2018-12-09 09:04:56,544 INFO L226 Difference]: Without dead ends: 247786 [2018-12-09 09:04:56,770 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 534 GetRequests, 524 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-12-09 09:04:56,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247786 states. [2018-12-09 09:05:03,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247786 to 245859. [2018-12-09 09:05:03,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245859 states. [2018-12-09 09:05:03,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245859 states to 245859 states and 315000 transitions. [2018-12-09 09:05:03,679 INFO L78 Accepts]: Start accepts. Automaton has 245859 states and 315000 transitions. Word has length 262 [2018-12-09 09:05:03,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:05:03,679 INFO L480 AbstractCegarLoop]: Abstraction has 245859 states and 315000 transitions. [2018-12-09 09:05:03,679 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 09:05:03,680 INFO L276 IsEmpty]: Start isEmpty. Operand 245859 states and 315000 transitions. [2018-12-09 09:05:03,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2018-12-09 09:05:03,696 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:05:03,696 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:05:03,696 INFO L423 AbstractCegarLoop]: === Iteration 29 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:05:03,696 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:05:03,696 INFO L82 PathProgramCache]: Analyzing trace with hash -1710664161, now seen corresponding path program 1 times [2018-12-09 09:05:03,697 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:05:03,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:05:03,697 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:05:03,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:05:03,698 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:05:03,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:05:03,752 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 25 proven. 20 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-12-09 09:05:03,753 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 09:05:03,753 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 09:05:03,753 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 250 with the following transitions: [2018-12-09 09:05:03,753 INFO L205 CegarAbsIntRunner]: [2], [4], [7], [18], [21], [28], [30], [37], [40], [56], [59], [66], [67], [70], [72], [75], [77], [80], [81], [86], [89], [91], [96], [98], [99], [100], [101], [104], [107], [109], [111], [113], [115], [116], [119], [125], [131], [135], [136], [138], [143], [146], [149], [151], [154], [159], [161], [164], [167], [181], [182], [183], [186], [192], [198], [202], [203], [213], [215], [217], [218], [235], [236], [237], [238], [239], [248], [251], [254], [256], [260], [263], [266], [273], [276], [295], [300], [351], [365], [367], [369], [371], [376], [379], [387], [392], [397], [401], [411], [422], [424], [426], [427], [428], [429], [430], [431], [434], [435], [436], [438], [439], [440], [442], [443], [444], [445], [446], [447], [448], [449], [454], [455], [456], [457], [458], [459], [466], [467], [468], [469], [470], [471], [472], [473], [474], [475], [476], [477], [478], [479], [480], [481], [482], [483], [484], [485], [486], [487], [488], [489], [490], [491], [492], [493], [494], [495], [496], [497], [498] [2018-12-09 09:05:03,754 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 09:05:03,754 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 09:05:03,789 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 09:05:03,789 INFO L272 AbstractInterpreter]: Visited 108 different actions 138 times. Merged at 11 different actions 12 times. Never widened. Performed 1555 root evaluator evaluations with a maximum evaluation depth of 3. Performed 1555 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Never found a fixpoint. Largest state had 47 variables. [2018-12-09 09:05:03,791 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:05:03,791 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 09:05:03,791 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 09:05:03,791 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_baa69fca-6ce1-4270-9804-ba1337b7c1a0/bin-2019/utaipan/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 09:05:03,799 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:05:03,799 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 09:05:03,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:05:03,867 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 09:05:04,111 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2018-12-09 09:05:04,111 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 09:05:04,216 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 30 proven. 9 refuted. 0 times theorem prover too weak. 142 trivial. 0 not checked. [2018-12-09 09:05:04,234 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-09 09:05:04,234 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [8, 6] total 12 [2018-12-09 09:05:04,234 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 09:05:04,235 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 09:05:04,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 09:05:04,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2018-12-09 09:05:04,235 INFO L87 Difference]: Start difference. First operand 245859 states and 315000 transitions. Second operand 6 states. [2018-12-09 09:05:10,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:05:10,246 INFO L93 Difference]: Finished difference Result 371705 states and 479974 transitions. [2018-12-09 09:05:10,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 09:05:10,247 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 249 [2018-12-09 09:05:10,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:05:10,624 INFO L225 Difference]: With dead ends: 371705 [2018-12-09 09:05:10,624 INFO L226 Difference]: Without dead ends: 126373 [2018-12-09 09:05:10,905 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 510 GetRequests, 492 SyntacticMatches, 6 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2018-12-09 09:05:10,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126373 states. [2018-12-09 09:05:14,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126373 to 119106. [2018-12-09 09:05:14,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119106 states. [2018-12-09 09:05:14,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119106 states to 119106 states and 148601 transitions. [2018-12-09 09:05:14,486 INFO L78 Accepts]: Start accepts. Automaton has 119106 states and 148601 transitions. Word has length 249 [2018-12-09 09:05:14,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:05:14,486 INFO L480 AbstractCegarLoop]: Abstraction has 119106 states and 148601 transitions. [2018-12-09 09:05:14,486 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 09:05:14,487 INFO L276 IsEmpty]: Start isEmpty. Operand 119106 states and 148601 transitions. [2018-12-09 09:05:14,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2018-12-09 09:05:14,499 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:05:14,499 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:05:14,499 INFO L423 AbstractCegarLoop]: === Iteration 30 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:05:14,499 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:05:14,499 INFO L82 PathProgramCache]: Analyzing trace with hash 1178572169, now seen corresponding path program 1 times [2018-12-09 09:05:14,500 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:05:14,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:05:14,500 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:05:14,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:05:14,500 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:05:14,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:05:14,565 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 38 proven. 19 refuted. 0 times theorem prover too weak. 166 trivial. 0 not checked. [2018-12-09 09:05:14,565 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 09:05:14,565 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 09:05:14,566 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 266 with the following transitions: [2018-12-09 09:05:14,566 INFO L205 CegarAbsIntRunner]: [2], [18], [21], [28], [30], [37], [40], [42], [45], [56], [59], [66], [67], [70], [72], [75], [77], [80], [81], [86], [89], [91], [96], [98], [99], [100], [101], [104], [107], [109], [111], [113], [115], [116], [119], [125], [131], [135], [136], [138], [141], [143], [146], [149], [151], [154], [159], [161], [164], [167], [169], [174], [179], [181], [182], [183], [186], [192], [198], [202], [203], [206], [209], [211], [213], [215], [217], [218], [235], [236], [237], [238], [239], [248], [251], [254], [256], [260], [263], [266], [273], [276], [282], [295], [300], [351], [365], [367], [369], [371], [376], [379], [387], [392], [397], [401], [411], [422], [424], [426], [427], [428], [429], [430], [431], [434], [435], [436], [438], [439], [440], [442], [443], [444], [445], [446], [447], [448], [449], [454], [455], [456], [457], [458], [459], [466], [467], [468], [469], [470], [471], [472], [473], [474], [475], [476], [477], [478], [479], [480], [481], [482], [483], [484], [485], [486], [487], [488], [489], [490], [491], [492], [493], [494], [495], [496], [497], [498] [2018-12-09 09:05:14,566 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 09:05:14,567 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 09:05:14,600 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 09:05:14,601 INFO L272 AbstractInterpreter]: Visited 112 different actions 142 times. Merged at 11 different actions 12 times. Never widened. Performed 1559 root evaluator evaluations with a maximum evaluation depth of 3. Performed 1559 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Never found a fixpoint. Largest state had 47 variables. [2018-12-09 09:05:14,602 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:05:14,602 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 09:05:14,602 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 09:05:14,602 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_baa69fca-6ce1-4270-9804-ba1337b7c1a0/bin-2019/utaipan/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 09:05:14,609 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:05:14,609 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 09:05:14,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:05:14,671 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 09:05:14,716 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 157 trivial. 0 not checked. [2018-12-09 09:05:14,716 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 09:05:14,819 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 41 proven. 3 refuted. 0 times theorem prover too weak. 179 trivial. 0 not checked. [2018-12-09 09:05:14,834 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-09 09:05:14,834 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [8, 6] total 12 [2018-12-09 09:05:14,834 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 09:05:14,835 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 09:05:14,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 09:05:14,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-12-09 09:05:14,835 INFO L87 Difference]: Start difference. First operand 119106 states and 148601 transitions. Second operand 6 states. [2018-12-09 09:05:18,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:05:18,141 INFO L93 Difference]: Finished difference Result 236833 states and 296714 transitions. [2018-12-09 09:05:18,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 09:05:18,141 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 265 [2018-12-09 09:05:18,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:05:18,498 INFO L225 Difference]: With dead ends: 236833 [2018-12-09 09:05:18,498 INFO L226 Difference]: Without dead ends: 120321 [2018-12-09 09:05:18,806 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 542 GetRequests, 525 SyntacticMatches, 6 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2018-12-09 09:05:18,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120321 states. [2018-12-09 09:05:21,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120321 to 119943. [2018-12-09 09:05:21,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119943 states. [2018-12-09 09:05:22,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119943 states to 119943 states and 148997 transitions. [2018-12-09 09:05:22,229 INFO L78 Accepts]: Start accepts. Automaton has 119943 states and 148997 transitions. Word has length 265 [2018-12-09 09:05:22,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:05:22,229 INFO L480 AbstractCegarLoop]: Abstraction has 119943 states and 148997 transitions. [2018-12-09 09:05:22,230 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 09:05:22,230 INFO L276 IsEmpty]: Start isEmpty. Operand 119943 states and 148997 transitions. [2018-12-09 09:05:22,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2018-12-09 09:05:22,241 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:05:22,241 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:05:22,241 INFO L423 AbstractCegarLoop]: === Iteration 31 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:05:22,241 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:05:22,241 INFO L82 PathProgramCache]: Analyzing trace with hash 476972295, now seen corresponding path program 1 times [2018-12-09 09:05:22,241 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:05:22,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:05:22,242 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:05:22,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:05:22,242 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:05:22,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:05:22,334 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 39 proven. 28 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2018-12-09 09:05:22,334 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 09:05:22,334 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 09:05:22,335 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 266 with the following transitions: [2018-12-09 09:05:22,335 INFO L205 CegarAbsIntRunner]: [2], [18], [21], [28], [30], [37], [40], [42], [45], [56], [59], [66], [67], [70], [72], [75], [77], [80], [81], [86], [89], [91], [94], [98], [99], [100], [101], [104], [107], [109], [111], [113], [115], [116], [119], [125], [131], [135], [136], [138], [141], [143], [146], [149], [151], [154], [159], [161], [164], [167], [169], [174], [179], [181], [182], [183], [186], [192], [198], [202], [203], [206], [209], [211], [213], [215], [217], [218], [235], [236], [237], [238], [239], [248], [251], [254], [256], [260], [263], [266], [273], [276], [282], [295], [300], [351], [365], [367], [369], [371], [376], [379], [387], [392], [397], [401], [411], [422], [424], [426], [427], [428], [429], [430], [431], [434], [435], [436], [438], [439], [440], [442], [443], [444], [445], [446], [447], [448], [449], [454], [455], [456], [457], [458], [459], [466], [467], [468], [469], [470], [471], [472], [473], [474], [475], [476], [477], [478], [479], [480], [481], [482], [483], [484], [485], [486], [487], [488], [489], [490], [491], [492], [493], [494], [495], [496], [497], [498] [2018-12-09 09:05:22,336 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 09:05:22,336 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 09:05:22,373 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 09:05:22,373 INFO L272 AbstractInterpreter]: Visited 112 different actions 142 times. Merged at 11 different actions 12 times. Never widened. Performed 1559 root evaluator evaluations with a maximum evaluation depth of 3. Performed 1559 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Never found a fixpoint. Largest state had 47 variables. [2018-12-09 09:05:22,374 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:05:22,374 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 09:05:22,374 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 09:05:22,374 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_baa69fca-6ce1-4270-9804-ba1337b7c1a0/bin-2019/utaipan/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 09:05:22,383 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:05:22,383 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 09:05:22,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:05:22,458 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 09:05:22,531 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 168 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-12-09 09:05:22,531 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 09:05:22,675 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 41 proven. 24 refuted. 0 times theorem prover too weak. 158 trivial. 0 not checked. [2018-12-09 09:05:22,690 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-09 09:05:22,691 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [7, 5] total 9 [2018-12-09 09:05:22,691 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 09:05:22,691 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 09:05:22,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 09:05:22,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2018-12-09 09:05:22,691 INFO L87 Difference]: Start difference. First operand 119943 states and 148997 transitions. Second operand 6 states. [2018-12-09 09:05:26,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:05:26,541 INFO L93 Difference]: Finished difference Result 242236 states and 304594 transitions. [2018-12-09 09:05:26,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 09:05:26,542 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 265 [2018-12-09 09:05:26,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:05:26,876 INFO L225 Difference]: With dead ends: 242236 [2018-12-09 09:05:26,876 INFO L226 Difference]: Without dead ends: 125135 [2018-12-09 09:05:27,029 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 544 GetRequests, 522 SyntacticMatches, 14 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-12-09 09:05:27,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125135 states. [2018-12-09 09:05:30,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125135 to 106385. [2018-12-09 09:05:30,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106385 states. [2018-12-09 09:05:30,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106385 states to 106385 states and 133126 transitions. [2018-12-09 09:05:30,503 INFO L78 Accepts]: Start accepts. Automaton has 106385 states and 133126 transitions. Word has length 265 [2018-12-09 09:05:30,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:05:30,504 INFO L480 AbstractCegarLoop]: Abstraction has 106385 states and 133126 transitions. [2018-12-09 09:05:30,504 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 09:05:30,504 INFO L276 IsEmpty]: Start isEmpty. Operand 106385 states and 133126 transitions. [2018-12-09 09:05:30,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2018-12-09 09:05:30,515 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:05:30,516 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1] [2018-12-09 09:05:30,516 INFO L423 AbstractCegarLoop]: === Iteration 32 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:05:30,516 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:05:30,516 INFO L82 PathProgramCache]: Analyzing trace with hash -1657484469, now seen corresponding path program 1 times [2018-12-09 09:05:30,516 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:05:30,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:05:30,517 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:05:30,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:05:30,517 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:05:30,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:05:30,576 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2018-12-09 09:05:30,576 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:05:30,577 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 09:05:30,577 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 09:05:30,577 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 09:05:30,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 09:05:30,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 09:05:30,577 INFO L87 Difference]: Start difference. First operand 106385 states and 133126 transitions. Second operand 3 states. [2018-12-09 09:05:33,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:05:33,152 INFO L93 Difference]: Finished difference Result 178646 states and 225441 transitions. [2018-12-09 09:05:33,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 09:05:33,152 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 272 [2018-12-09 09:05:33,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:05:33,349 INFO L225 Difference]: With dead ends: 178646 [2018-12-09 09:05:33,349 INFO L226 Difference]: Without dead ends: 75934 [2018-12-09 09:05:33,482 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 09:05:33,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75934 states. [2018-12-09 09:05:37,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75934 to 75839. [2018-12-09 09:05:37,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75839 states. [2018-12-09 09:05:37,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75839 states to 75839 states and 93238 transitions. [2018-12-09 09:05:37,327 INFO L78 Accepts]: Start accepts. Automaton has 75839 states and 93238 transitions. Word has length 272 [2018-12-09 09:05:37,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:05:37,327 INFO L480 AbstractCegarLoop]: Abstraction has 75839 states and 93238 transitions. [2018-12-09 09:05:37,327 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 09:05:37,328 INFO L276 IsEmpty]: Start isEmpty. Operand 75839 states and 93238 transitions. [2018-12-09 09:05:37,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2018-12-09 09:05:37,336 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:05:37,337 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:05:37,337 INFO L423 AbstractCegarLoop]: === Iteration 33 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:05:37,337 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:05:37,337 INFO L82 PathProgramCache]: Analyzing trace with hash -2069729360, now seen corresponding path program 1 times [2018-12-09 09:05:37,337 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:05:37,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:05:37,337 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:05:37,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:05:37,338 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:05:37,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:05:37,371 INFO L134 CoverageAnalysis]: Checked inductivity of 230 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 189 trivial. 0 not checked. [2018-12-09 09:05:37,372 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:05:37,372 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 09:05:37,372 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 09:05:37,372 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 09:05:37,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 09:05:37,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 09:05:37,372 INFO L87 Difference]: Start difference. First operand 75839 states and 93238 transitions. Second operand 3 states. [2018-12-09 09:05:39,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:05:39,203 INFO L93 Difference]: Finished difference Result 130421 states and 162588 transitions. [2018-12-09 09:05:39,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 09:05:39,203 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 273 [2018-12-09 09:05:39,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:05:39,353 INFO L225 Difference]: With dead ends: 130421 [2018-12-09 09:05:39,353 INFO L226 Difference]: Without dead ends: 56598 [2018-12-09 09:05:39,461 INFO L631 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 [2018-12-09 09:05:39,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56598 states. [2018-12-09 09:05:41,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56598 to 55591. [2018-12-09 09:05:41,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55591 states. [2018-12-09 09:05:41,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55591 states to 55591 states and 66965 transitions. [2018-12-09 09:05:41,310 INFO L78 Accepts]: Start accepts. Automaton has 55591 states and 66965 transitions. Word has length 273 [2018-12-09 09:05:41,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:05:41,311 INFO L480 AbstractCegarLoop]: Abstraction has 55591 states and 66965 transitions. [2018-12-09 09:05:41,311 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 09:05:41,311 INFO L276 IsEmpty]: Start isEmpty. Operand 55591 states and 66965 transitions. [2018-12-09 09:05:41,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2018-12-09 09:05:41,317 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:05:41,317 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-12-09 09:05:41,318 INFO L423 AbstractCegarLoop]: === Iteration 34 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:05:41,318 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:05:41,318 INFO L82 PathProgramCache]: Analyzing trace with hash 381260242, now seen corresponding path program 1 times [2018-12-09 09:05:41,318 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:05:41,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:05:41,318 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:05:41,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:05:41,319 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:05:41,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:05:41,384 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 42 proven. 26 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2018-12-09 09:05:41,384 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 09:05:41,385 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 09:05:41,385 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 274 with the following transitions: [2018-12-09 09:05:41,385 INFO L205 CegarAbsIntRunner]: [2], [18], [21], [28], [30], [37], [40], [56], [59], [66], [67], [70], [72], [75], [80], [81], [86], [89], [91], [94], [98], [99], [100], [101], [104], [107], [109], [111], [113], [115], [116], [119], [125], [131], [135], [136], [138], [141], [143], [146], [151], [154], [157], [159], [161], [164], [167], [169], [174], [179], [181], [182], [183], [186], [192], [198], [202], [203], [206], [209], [211], [213], [215], [217], [218], [219], [224], [227], [233], [234], [235], [236], [237], [238], [239], [248], [251], [254], [256], [260], [263], [266], [273], [276], [282], [286], [289], [300], [301], [304], [325], [332], [334], [337], [340], [343], [350], [351], [365], [367], [369], [371], [376], [379], [387], [392], [397], [401], [411], [415], [418], [420], [422], [424], [426], [427], [428], [429], [430], [431], [434], [435], [438], [439], [440], [442], [443], [444], [445], [446], [447], [448], [449], [454], [455], [456], [457], [458], [459], [460], [461], [462], [464], [465], [466], [467], [468], [469], [470], [471], [472], [473], [474], [475], [476], [477], [478], [479], [480], [481], [482], [483], [484], [485], [486], [487], [488], [489], [490], [491], [492], [493], [494], [495], [496], [497], [498] [2018-12-09 09:05:41,386 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 09:05:41,386 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 09:05:42,188 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 09:05:42,188 INFO L272 AbstractInterpreter]: Visited 177 different actions 2733 times. Merged at 77 different actions 765 times. Widened at 1 different actions 1 times. Performed 30644 root evaluator evaluations with a maximum evaluation depth of 3. Performed 30644 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 154 fixpoints after 23 different actions. Largest state had 48 variables. [2018-12-09 09:05:42,190 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:05:42,190 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 09:05:42,190 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 09:05:42,190 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_baa69fca-6ce1-4270-9804-ba1337b7c1a0/bin-2019/utaipan/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 09:05:42,197 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:05:42,197 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 09:05:42,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:05:42,262 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 09:05:42,303 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2018-12-09 09:05:42,303 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 09:05:42,413 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-12-09 09:05:42,429 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-12-09 09:05:42,429 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [9] total 13 [2018-12-09 09:05:42,429 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 09:05:42,429 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 09:05:42,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 09:05:42,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-12-09 09:05:42,429 INFO L87 Difference]: Start difference. First operand 55591 states and 66965 transitions. Second operand 6 states. [2018-12-09 09:05:44,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:05:44,215 INFO L93 Difference]: Finished difference Result 108979 states and 134761 transitions. [2018-12-09 09:05:44,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 09:05:44,216 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 273 [2018-12-09 09:05:44,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:05:44,349 INFO L225 Difference]: With dead ends: 108979 [2018-12-09 09:05:44,350 INFO L226 Difference]: Without dead ends: 56853 [2018-12-09 09:05:44,418 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 559 GetRequests, 543 SyntacticMatches, 4 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2018-12-09 09:05:44,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56853 states. [2018-12-09 09:05:46,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56853 to 56210. [2018-12-09 09:05:46,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56210 states. [2018-12-09 09:05:46,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56210 states to 56210 states and 67499 transitions. [2018-12-09 09:05:46,180 INFO L78 Accepts]: Start accepts. Automaton has 56210 states and 67499 transitions. Word has length 273 [2018-12-09 09:05:46,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:05:46,181 INFO L480 AbstractCegarLoop]: Abstraction has 56210 states and 67499 transitions. [2018-12-09 09:05:46,181 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 09:05:46,181 INFO L276 IsEmpty]: Start isEmpty. Operand 56210 states and 67499 transitions. [2018-12-09 09:05:46,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2018-12-09 09:05:46,188 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:05:46,188 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:05:46,188 INFO L423 AbstractCegarLoop]: === Iteration 35 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:05:46,188 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:05:46,188 INFO L82 PathProgramCache]: Analyzing trace with hash 1637575003, now seen corresponding path program 1 times [2018-12-09 09:05:46,188 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:05:46,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:05:46,189 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:05:46,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:05:46,189 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:05:46,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:05:46,249 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2018-12-09 09:05:46,249 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:05:46,249 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 09:05:46,249 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 09:05:46,250 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 09:05:46,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 09:05:46,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-09 09:05:46,250 INFO L87 Difference]: Start difference. First operand 56210 states and 67499 transitions. Second operand 5 states. [2018-12-09 09:05:48,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:05:48,575 INFO L93 Difference]: Finished difference Result 116171 states and 140920 transitions. [2018-12-09 09:05:48,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 09:05:48,576 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 274 [2018-12-09 09:05:48,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:05:48,747 INFO L225 Difference]: With dead ends: 116171 [2018-12-09 09:05:48,747 INFO L226 Difference]: Without dead ends: 63374 [2018-12-09 09:05:48,825 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-09 09:05:48,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63374 states. [2018-12-09 09:05:50,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63374 to 62998. [2018-12-09 09:05:50,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62998 states. [2018-12-09 09:05:51,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62998 states to 62998 states and 74588 transitions. [2018-12-09 09:05:51,053 INFO L78 Accepts]: Start accepts. Automaton has 62998 states and 74588 transitions. Word has length 274 [2018-12-09 09:05:51,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:05:51,054 INFO L480 AbstractCegarLoop]: Abstraction has 62998 states and 74588 transitions. [2018-12-09 09:05:51,054 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 09:05:51,054 INFO L276 IsEmpty]: Start isEmpty. Operand 62998 states and 74588 transitions. [2018-12-09 09:05:51,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2018-12-09 09:05:51,061 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:05:51,061 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-12-09 09:05:51,061 INFO L423 AbstractCegarLoop]: === Iteration 36 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:05:51,061 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:05:51,061 INFO L82 PathProgramCache]: Analyzing trace with hash -1884172308, now seen corresponding path program 1 times [2018-12-09 09:05:51,061 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:05:51,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:05:51,062 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:05:51,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:05:51,062 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:05:51,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:05:51,125 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 4 proven. 40 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2018-12-09 09:05:51,125 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 09:05:51,125 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 09:05:51,125 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 275 with the following transitions: [2018-12-09 09:05:51,125 INFO L205 CegarAbsIntRunner]: [2], [18], [21], [28], [30], [37], [40], [56], [59], [66], [67], [70], [72], [75], [80], [81], [86], [89], [91], [94], [98], [99], [100], [101], [104], [107], [109], [111], [113], [115], [116], [119], [125], [131], [135], [136], [138], [141], [143], [146], [149], [151], [154], [157], [159], [161], [164], [167], [169], [174], [179], [181], [182], [183], [186], [192], [198], [202], [203], [206], [209], [211], [213], [215], [217], [218], [219], [224], [227], [233], [234], [235], [236], [237], [238], [239], [248], [251], [254], [256], [260], [263], [266], [273], [276], [279], [286], [289], [300], [301], [304], [325], [332], [334], [337], [340], [343], [350], [351], [365], [367], [369], [371], [376], [379], [387], [392], [397], [401], [411], [415], [418], [420], [422], [424], [426], [427], [428], [429], [430], [431], [434], [435], [438], [439], [440], [442], [443], [444], [445], [446], [447], [448], [449], [454], [455], [456], [457], [458], [459], [460], [461], [462], [464], [465], [466], [467], [468], [469], [470], [471], [472], [473], [474], [475], [476], [477], [478], [479], [480], [481], [482], [483], [484], [485], [486], [487], [488], [489], [490], [491], [492], [493], [494], [495], [496], [497], [498] [2018-12-09 09:05:51,126 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 09:05:51,126 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 09:05:52,825 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 09:05:52,825 INFO L272 AbstractInterpreter]: Visited 178 different actions 5707 times. Merged at 77 different actions 1655 times. Widened at 2 different actions 8 times. Performed 69321 root evaluator evaluations with a maximum evaluation depth of 3. Performed 69321 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 332 fixpoints after 27 different actions. Largest state had 48 variables. [2018-12-09 09:05:52,827 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:05:52,827 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 09:05:52,827 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 09:05:52,827 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_baa69fca-6ce1-4270-9804-ba1337b7c1a0/bin-2019/utaipan/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 09:05:52,833 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:05:52,833 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 09:05:52,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:05:52,901 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 09:05:52,942 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 110 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2018-12-09 09:05:52,942 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 09:05:53,035 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2018-12-09 09:05:53,050 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-12-09 09:05:53,050 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [7] total 9 [2018-12-09 09:05:53,051 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 09:05:53,051 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 09:05:53,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 09:05:53,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2018-12-09 09:05:53,051 INFO L87 Difference]: Start difference. First operand 62998 states and 74588 transitions. Second operand 3 states. [2018-12-09 09:05:55,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:05:55,254 INFO L93 Difference]: Finished difference Result 122823 states and 147329 transitions. [2018-12-09 09:05:55,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 09:05:55,255 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 274 [2018-12-09 09:05:55,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:05:55,406 INFO L225 Difference]: With dead ends: 122823 [2018-12-09 09:05:55,406 INFO L226 Difference]: Without dead ends: 63286 [2018-12-09 09:05:55,484 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 558 GetRequests, 551 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2018-12-09 09:05:55,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63286 states. [2018-12-09 09:05:57,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63286 to 62998. [2018-12-09 09:05:57,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62998 states. [2018-12-09 09:05:57,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62998 states to 62998 states and 74369 transitions. [2018-12-09 09:05:57,750 INFO L78 Accepts]: Start accepts. Automaton has 62998 states and 74369 transitions. Word has length 274 [2018-12-09 09:05:57,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:05:57,751 INFO L480 AbstractCegarLoop]: Abstraction has 62998 states and 74369 transitions. [2018-12-09 09:05:57,751 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 09:05:57,751 INFO L276 IsEmpty]: Start isEmpty. Operand 62998 states and 74369 transitions. [2018-12-09 09:05:57,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2018-12-09 09:05:57,757 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:05:57,757 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:05:57,757 INFO L423 AbstractCegarLoop]: === Iteration 37 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:05:57,757 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:05:57,758 INFO L82 PathProgramCache]: Analyzing trace with hash 1717476141, now seen corresponding path program 1 times [2018-12-09 09:05:57,758 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:05:57,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:05:57,758 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:05:57,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:05:57,758 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:05:57,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:05:57,819 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 40 proven. 17 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2018-12-09 09:05:57,819 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 09:05:57,819 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 09:05:57,819 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 277 with the following transitions: [2018-12-09 09:05:57,819 INFO L205 CegarAbsIntRunner]: [2], [18], [21], [28], [30], [37], [40], [42], [45], [56], [59], [66], [67], [70], [72], [75], [77], [80], [81], [86], [89], [91], [94], [98], [99], [100], [101], [104], [107], [109], [111], [113], [115], [116], [119], [125], [131], [135], [136], [138], [141], [143], [146], [149], [151], [154], [159], [161], [164], [167], [169], [174], [179], [181], [182], [183], [186], [192], [198], [202], [203], [206], [209], [211], [213], [215], [217], [218], [235], [236], [237], [238], [239], [248], [251], [254], [256], [260], [263], [266], [273], [276], [279], [286], [289], [295], [300], [301], [304], [325], [329], [350], [351], [365], [367], [369], [371], [376], [379], [387], [392], [397], [401], [404], [409], [411], [422], [424], [426], [427], [428], [429], [430], [431], [434], [435], [436], [438], [439], [440], [442], [443], [444], [445], [446], [447], [448], [449], [454], [455], [456], [457], [458], [459], [460], [461], [466], [467], [468], [469], [470], [471], [472], [473], [474], [475], [476], [477], [478], [479], [480], [481], [482], [483], [484], [485], [486], [487], [488], [489], [490], [491], [492], [493], [494], [495], [496], [497], [498] [2018-12-09 09:05:57,820 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 09:05:57,820 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 09:05:59,193 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 09:05:59,193 INFO L272 AbstractInterpreter]: Visited 169 different actions 4328 times. Merged at 74 different actions 1328 times. Widened at 2 different actions 6 times. Performed 62450 root evaluator evaluations with a maximum evaluation depth of 3. Performed 62450 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 327 fixpoints after 24 different actions. Largest state had 48 variables. [2018-12-09 09:05:59,194 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:05:59,194 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 09:05:59,194 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 09:05:59,194 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_baa69fca-6ce1-4270-9804-ba1337b7c1a0/bin-2019/utaipan/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 09:05:59,200 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:05:59,200 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 09:05:59,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:05:59,263 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 09:05:59,312 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 153 proven. 4 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2018-12-09 09:05:59,312 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 09:05:59,437 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 183 trivial. 0 not checked. [2018-12-09 09:05:59,453 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-09 09:05:59,453 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [10, 5] total 15 [2018-12-09 09:05:59,453 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 09:05:59,453 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 09:05:59,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 09:05:59,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2018-12-09 09:05:59,453 INFO L87 Difference]: Start difference. First operand 62998 states and 74369 transitions. Second operand 5 states. [2018-12-09 09:06:02,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:06:02,652 INFO L93 Difference]: Finished difference Result 118559 states and 146037 transitions. [2018-12-09 09:06:02,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 09:06:02,653 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 276 [2018-12-09 09:06:02,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:06:02,881 INFO L225 Difference]: With dead ends: 118559 [2018-12-09 09:06:02,881 INFO L226 Difference]: Without dead ends: 86221 [2018-12-09 09:06:02,942 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 564 GetRequests, 549 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2018-12-09 09:06:03,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86221 states. [2018-12-09 09:06:05,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86221 to 81917. [2018-12-09 09:06:05,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81917 states. [2018-12-09 09:06:06,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81917 states to 81917 states and 97923 transitions. [2018-12-09 09:06:06,131 INFO L78 Accepts]: Start accepts. Automaton has 81917 states and 97923 transitions. Word has length 276 [2018-12-09 09:06:06,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:06:06,132 INFO L480 AbstractCegarLoop]: Abstraction has 81917 states and 97923 transitions. [2018-12-09 09:06:06,132 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 09:06:06,132 INFO L276 IsEmpty]: Start isEmpty. Operand 81917 states and 97923 transitions. [2018-12-09 09:06:06,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2018-12-09 09:06:06,139 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:06:06,139 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1] [2018-12-09 09:06:06,139 INFO L423 AbstractCegarLoop]: === Iteration 38 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:06:06,139 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:06:06,139 INFO L82 PathProgramCache]: Analyzing trace with hash 481126417, now seen corresponding path program 1 times [2018-12-09 09:06:06,140 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:06:06,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:06:06,140 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:06:06,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:06:06,140 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:06:06,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:06:06,193 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2018-12-09 09:06:06,193 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:06:06,193 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 09:06:06,193 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 09:06:06,193 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 09:06:06,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 09:06:06,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-09 09:06:06,194 INFO L87 Difference]: Start difference. First operand 81917 states and 97923 transitions. Second operand 6 states. [2018-12-09 09:06:09,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:06:09,126 INFO L93 Difference]: Finished difference Result 133235 states and 159092 transitions. [2018-12-09 09:06:09,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 09:06:09,126 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 276 [2018-12-09 09:06:09,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:06:09,312 INFO L225 Difference]: With dead ends: 133235 [2018-12-09 09:06:09,313 INFO L226 Difference]: Without dead ends: 81831 [2018-12-09 09:06:09,387 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-12-09 09:06:09,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81831 states. [2018-12-09 09:06:12,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81831 to 81724. [2018-12-09 09:06:12,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81724 states. [2018-12-09 09:06:12,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81724 states to 81724 states and 97502 transitions. [2018-12-09 09:06:12,507 INFO L78 Accepts]: Start accepts. Automaton has 81724 states and 97502 transitions. Word has length 276 [2018-12-09 09:06:12,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:06:12,507 INFO L480 AbstractCegarLoop]: Abstraction has 81724 states and 97502 transitions. [2018-12-09 09:06:12,507 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 09:06:12,507 INFO L276 IsEmpty]: Start isEmpty. Operand 81724 states and 97502 transitions. [2018-12-09 09:06:12,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2018-12-09 09:06:12,514 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:06:12,514 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-12-09 09:06:12,514 INFO L423 AbstractCegarLoop]: === Iteration 39 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:06:12,515 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:06:12,515 INFO L82 PathProgramCache]: Analyzing trace with hash 1652618862, now seen corresponding path program 1 times [2018-12-09 09:06:12,515 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:06:12,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:06:12,516 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:06:12,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:06:12,516 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:06:12,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:06:12,608 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 28 proven. 1 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2018-12-09 09:06:12,609 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 09:06:12,609 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 09:06:12,609 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 281 with the following transitions: [2018-12-09 09:06:12,609 INFO L205 CegarAbsIntRunner]: [2], [18], [21], [28], [30], [37], [40], [56], [59], [66], [67], [70], [72], [75], [80], [81], [86], [89], [91], [94], [98], [99], [100], [101], [104], [107], [109], [111], [113], [115], [116], [119], [125], [131], [135], [136], [138], [141], [143], [146], [149], [151], [154], [157], [159], [161], [164], [167], [169], [174], [179], [181], [182], [183], [186], [192], [198], [202], [203], [206], [209], [211], [213], [215], [217], [218], [219], [224], [227], [229], [233], [234], [235], [236], [237], [238], [239], [248], [251], [254], [256], [260], [263], [266], [273], [276], [279], [286], [289], [300], [301], [304], [306], [311], [314], [325], [332], [334], [340], [343], [350], [351], [365], [367], [369], [371], [376], [379], [387], [392], [397], [401], [411], [415], [418], [420], [422], [424], [426], [427], [428], [429], [430], [431], [434], [435], [438], [439], [440], [442], [443], [444], [445], [446], [447], [448], [449], [452], [454], [455], [456], [457], [458], [459], [460], [461], [464], [465], [466], [467], [468], [469], [470], [471], [472], [473], [474], [475], [476], [477], [478], [479], [480], [481], [482], [483], [484], [485], [486], [487], [488], [489], [490], [491], [492], [493], [494], [495], [496], [497], [498] [2018-12-09 09:06:12,610 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 09:06:12,610 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 09:06:14,830 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 09:06:14,830 INFO L272 AbstractInterpreter]: Visited 181 different actions 7153 times. Merged at 82 different actions 2153 times. Widened at 2 different actions 5 times. Performed 91405 root evaluator evaluations with a maximum evaluation depth of 3. Performed 91405 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 399 fixpoints after 25 different actions. Largest state had 48 variables. [2018-12-09 09:06:14,832 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:06:14,832 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 09:06:14,832 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 09:06:14,832 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_baa69fca-6ce1-4270-9804-ba1337b7c1a0/bin-2019/utaipan/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 09:06:14,839 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:06:14,839 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 09:06:14,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:06:14,904 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 09:06:14,983 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 35 proven. 95 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-12-09 09:06:14,983 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 09:06:15,260 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 9 proven. 24 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2018-12-09 09:06:15,275 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 09:06:15,275 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 13] total 19 [2018-12-09 09:06:15,275 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 09:06:15,276 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-09 09:06:15,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-09 09:06:15,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=296, Unknown=0, NotChecked=0, Total=342 [2018-12-09 09:06:15,276 INFO L87 Difference]: Start difference. First operand 81724 states and 97502 transitions. Second operand 12 states. [2018-12-09 09:06:21,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:06:21,308 INFO L93 Difference]: Finished difference Result 171641 states and 215883 transitions. [2018-12-09 09:06:21,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-12-09 09:06:21,309 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 280 [2018-12-09 09:06:21,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:06:21,592 INFO L225 Difference]: With dead ends: 171641 [2018-12-09 09:06:21,592 INFO L226 Difference]: Without dead ends: 104270 [2018-12-09 09:06:21,671 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 594 GetRequests, 560 SyntacticMatches, 4 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=179, Invalid=813, Unknown=0, NotChecked=0, Total=992 [2018-12-09 09:06:21,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104270 states. [2018-12-09 09:06:25,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104270 to 94972. [2018-12-09 09:06:25,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94972 states. [2018-12-09 09:06:25,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94972 states to 94972 states and 113683 transitions. [2018-12-09 09:06:25,665 INFO L78 Accepts]: Start accepts. Automaton has 94972 states and 113683 transitions. Word has length 280 [2018-12-09 09:06:25,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:06:25,665 INFO L480 AbstractCegarLoop]: Abstraction has 94972 states and 113683 transitions. [2018-12-09 09:06:25,665 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-09 09:06:25,665 INFO L276 IsEmpty]: Start isEmpty. Operand 94972 states and 113683 transitions. [2018-12-09 09:06:25,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2018-12-09 09:06:25,672 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:06:25,673 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-12-09 09:06:25,673 INFO L423 AbstractCegarLoop]: === Iteration 40 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:06:25,673 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:06:25,673 INFO L82 PathProgramCache]: Analyzing trace with hash -316897130, now seen corresponding path program 1 times [2018-12-09 09:06:25,673 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:06:25,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:06:25,673 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:06:25,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:06:25,674 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:06:25,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:06:25,718 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2018-12-09 09:06:25,718 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:06:25,718 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 09:06:25,718 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 09:06:25,718 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 09:06:25,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 09:06:25,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 09:06:25,718 INFO L87 Difference]: Start difference. First operand 94972 states and 113683 transitions. Second operand 4 states. [2018-12-09 09:06:28,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:06:28,750 INFO L93 Difference]: Finished difference Result 157084 states and 192060 transitions. [2018-12-09 09:06:28,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 09:06:28,750 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 286 [2018-12-09 09:06:28,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:06:28,917 INFO L225 Difference]: With dead ends: 157084 [2018-12-09 09:06:28,917 INFO L226 Difference]: Without dead ends: 64779 [2018-12-09 09:06:29,037 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 09:06:29,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64779 states. [2018-12-09 09:06:31,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64779 to 64389. [2018-12-09 09:06:31,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64389 states. [2018-12-09 09:06:31,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64389 states to 64389 states and 75869 transitions. [2018-12-09 09:06:31,782 INFO L78 Accepts]: Start accepts. Automaton has 64389 states and 75869 transitions. Word has length 286 [2018-12-09 09:06:31,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:06:31,783 INFO L480 AbstractCegarLoop]: Abstraction has 64389 states and 75869 transitions. [2018-12-09 09:06:31,783 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 09:06:31,783 INFO L276 IsEmpty]: Start isEmpty. Operand 64389 states and 75869 transitions. [2018-12-09 09:06:31,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2018-12-09 09:06:31,788 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:06:31,788 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-12-09 09:06:31,788 INFO L423 AbstractCegarLoop]: === Iteration 41 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:06:31,788 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:06:31,788 INFO L82 PathProgramCache]: Analyzing trace with hash -1169260679, now seen corresponding path program 1 times [2018-12-09 09:06:31,788 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:06:31,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:06:31,789 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:06:31,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:06:31,789 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:06:31,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 09:06:31,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 09:06:31,870 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-09 09:06:31,983 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 09:06:31 BoogieIcfgContainer [2018-12-09 09:06:31,983 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-09 09:06:31,983 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 09:06:31,983 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 09:06:31,984 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 09:06:31,984 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 09:03:07" (3/4) ... [2018-12-09 09:06:31,985 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-09 09:06:32,086 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_baa69fca-6ce1-4270-9804-ba1337b7c1a0/bin-2019/utaipan/witness.graphml [2018-12-09 09:06:32,086 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 09:06:32,087 INFO L168 Benchmark]: Toolchain (without parser) took 205394.56 ms. Allocated memory was 1.0 GB in the beginning and 6.5 GB in the end (delta: 5.5 GB). Free memory was 956.1 MB in the beginning and 2.2 GB in the end (delta: -1.2 GB). Peak memory consumption was 4.3 GB. Max. memory is 11.5 GB. [2018-12-09 09:06:32,088 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 981.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 09:06:32,088 INFO L168 Benchmark]: CACSL2BoogieTranslator took 168.41 ms. Allocated memory is still 1.0 GB. Free memory was 956.1 MB in the beginning and 940.0 MB in the end (delta: 16.2 MB). Peak memory consumption was 16.2 MB. Max. memory is 11.5 GB. [2018-12-09 09:06:32,088 INFO L168 Benchmark]: Boogie Procedure Inliner took 42.53 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 97.5 MB). Free memory was 940.0 MB in the beginning and 1.1 GB in the end (delta: -158.0 MB). Peak memory consumption was 13.3 MB. Max. memory is 11.5 GB. [2018-12-09 09:06:32,089 INFO L168 Benchmark]: Boogie Preprocessor took 28.27 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-12-09 09:06:32,089 INFO L168 Benchmark]: RCFGBuilder took 318.50 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 41.2 MB). Peak memory consumption was 41.2 MB. Max. memory is 11.5 GB. [2018-12-09 09:06:32,089 INFO L168 Benchmark]: TraceAbstraction took 204730.90 ms. Allocated memory was 1.1 GB in the beginning and 6.5 GB in the end (delta: 5.4 GB). Free memory was 1.1 GB in the beginning and 2.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 4.3 GB. Max. memory is 11.5 GB. [2018-12-09 09:06:32,089 INFO L168 Benchmark]: Witness Printer took 102.71 ms. Allocated memory is still 6.5 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 50.5 MB). Peak memory consumption was 50.5 MB. Max. memory is 11.5 GB. [2018-12-09 09:06:32,090 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 981.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 168.41 ms. Allocated memory is still 1.0 GB. Free memory was 956.1 MB in the beginning and 940.0 MB in the end (delta: 16.2 MB). Peak memory consumption was 16.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 42.53 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 97.5 MB). Free memory was 940.0 MB in the beginning and 1.1 GB in the end (delta: -158.0 MB). Peak memory consumption was 13.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 28.27 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 318.50 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 41.2 MB). Peak memory consumption was 41.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 204730.90 ms. Allocated memory was 1.1 GB in the beginning and 6.5 GB in the end (delta: 5.4 GB). Free memory was 1.1 GB in the beginning and 2.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 4.3 GB. Max. memory is 11.5 GB. * Witness Printer took 102.71 ms. Allocated memory is still 6.5 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 50.5 MB). Peak memory consumption was 50.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 9]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L15] int max_loop ; [L16] int num ; [L17] int i ; [L18] int e ; [L19] int timer ; [L20] char data_0 ; [L21] char data_1 ; [L64] int P_1_pc; [L65] int P_1_st ; [L66] int P_1_i ; [L67] int P_1_ev ; [L122] int P_2_pc ; [L123] int P_2_st ; [L124] int P_2_i ; [L125] int P_2_ev ; [L190] int C_1_pc ; [L191] int C_1_st ; [L192] int C_1_i ; [L193] int C_1_ev ; [L194] int C_1_pr ; VAL [\old(C_1_ev)=80, \old(C_1_i)=69, \old(C_1_pc)=85, \old(C_1_pr)=82, \old(C_1_st)=84, \old(data_0)=77, \old(data_1)=68, \old(e)=67, \old(i)=71, \old(max_loop)=83, \old(num)=70, \old(P_1_ev)=72, \old(P_1_i)=81, \old(P_1_pc)=74, \old(P_1_st)=78, \old(P_2_ev)=73, \old(P_2_i)=86, \old(P_2_pc)=76, \old(P_2_st)=79, \old(timer)=75, C_1_ev=0, C_1_i=0, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=0, num=0, P_1_ev=0, P_1_i=0, P_1_pc=0, P_1_st=0, P_2_ev=0, P_2_i=0, P_2_pc=0, P_2_st=0, timer=0] [L593] int count ; [L594] int __retres2 ; [L598] num = 0 [L599] i = 0 [L600] max_loop = 2 [L602] timer = 0 [L603] P_1_pc = 0 [L604] P_2_pc = 0 [L605] C_1_pc = 0 [L607] count = 0 VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=0, C_1_i=0, C_1_pc=0, C_1_pr=0, C_1_st=0, count=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=0, P_1_pc=0, P_1_st=0, P_2_ev=0, P_2_i=0, P_2_pc=0, P_2_st=0, timer=0] [L608] CALL init_model() VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=0, C_1_i=0, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=0, P_1_pc=0, P_1_st=0, P_2_ev=0, P_2_i=0, P_2_pc=0, P_2_st=0, timer=0] [L585] P_1_i = 1 [L586] P_2_i = 1 [L587] C_1_i = 1 VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, timer=0] [L608] RET init_model() VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, count=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, timer=0] [L609] CALL start_simulation() VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, timer=0] [L523] int kernel_st ; [L524] int tmp ; [L525] int tmp___0 ; [L529] kernel_st = 0 VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, kernel_st=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, timer=0] [L530] FCALL update_channels() VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, kernel_st=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, timer=0] [L531] CALL init_threads() VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, timer=0] [L294] COND TRUE (int )P_1_i == 1 [L295] P_1_st = 0 VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, timer=0] [L299] COND TRUE (int )P_2_i == 1 [L300] P_2_st = 0 VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, timer=0] [L304] COND TRUE (int )C_1_i == 1 [L305] C_1_st = 0 VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, timer=0] [L531] RET init_threads() VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, kernel_st=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, timer=0] [L532] FCALL fire_delta_events() VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, kernel_st=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, timer=0] [L533] CALL activate_threads() VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, timer=0] [L459] int tmp ; [L460] int tmp___0 ; [L461] int tmp___1 ; VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, timer=0] [L465] CALL, EXPR is_P_1_triggered() VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, timer=0] [L104] int __retres1 ; VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, timer=0] [L107] COND FALSE !((int )P_1_pc == 1) VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, timer=0] [L117] __retres1 = 0 VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, __retres1=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, timer=0] [L119] return (__retres1); VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, \result=0, __retres1=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, timer=0] [L465] RET, EXPR is_P_1_triggered() VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, is_P_1_triggered()=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, timer=0] [L465] tmp = is_P_1_triggered() [L467] COND FALSE !(\read(tmp)) VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, timer=0, tmp=0] [L473] CALL, EXPR is_P_2_triggered() VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, timer=0] [L172] int __retres1 ; VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, timer=0] [L175] COND FALSE !((int )P_2_pc == 1) VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, timer=0] [L185] __retres1 = 0 VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, __retres1=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, timer=0] [L187] return (__retres1); VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, \result=0, __retres1=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, timer=0] [L473] RET, EXPR is_P_2_triggered() VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, is_P_2_triggered()=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, timer=0, tmp=0] [L473] tmp___0 = is_P_2_triggered() [L475] COND FALSE !(\read(tmp___0)) VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, timer=0, tmp=0, tmp___0=0] [L481] CALL, EXPR is_C_1_triggered() VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, timer=0] [L254] int __retres1 ; VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, timer=0] [L257] COND FALSE !((int )C_1_pc == 1) VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, timer=0] [L267] COND FALSE !((int )C_1_pc == 2) VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, timer=0] [L277] __retres1 = 0 VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, __retres1=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, timer=0] [L279] return (__retres1); VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, \result=0, __retres1=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, timer=0] [L481] RET, EXPR is_C_1_triggered() VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, is_C_1_triggered()=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, timer=0, tmp=0, tmp___0=0] [L481] tmp___1 = is_C_1_triggered() [L483] COND FALSE !(\read(tmp___1)) VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, timer=0, tmp=0, tmp___0=0, tmp___1=0] [L533] RET activate_threads() VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, kernel_st=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, timer=0] [L534] FCALL reset_delta_events() VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, kernel_st=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, timer=0] [L537] COND TRUE 1 VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, kernel_st=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, timer=0] [L540] kernel_st = 1 VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, kernel_st=1, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, timer=0] [L541] CALL eval() VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, timer=0] [L339] int tmp ; [L340] int tmp___0 ; [L341] int tmp___1 ; [L342] int tmp___2 ; VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, timer=0] [L346] COND TRUE 1 VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, timer=0] [L349] CALL, EXPR exists_runnable_thread() VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, timer=0] [L314] int __retres1 ; VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, timer=0] [L317] COND TRUE (int )P_1_st == 0 [L318] __retres1 = 1 VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, __retres1=1, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, timer=0] [L335] return (__retres1); VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, \result=1, __retres1=1, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, timer=0] [L349] RET, EXPR exists_runnable_thread() VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, exists_runnable_thread()=1, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, timer=0] [L349] tmp___2 = exists_runnable_thread() [L351] COND TRUE \read(tmp___2) VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, timer=0, tmp___2=1] [L356] COND TRUE (int )P_1_st == 0 [L358] tmp = __VERIFIER_nondet_int() [L360] COND TRUE \read(tmp) [L362] P_1_st = 1 VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=1, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, timer=0, tmp=1, tmp___2=1] [L363] CALL P_1() VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=1, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=1, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, timer=0] [L72] COND TRUE (int )P_1_pc == 0 VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=1, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=1, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, timer=0] [L83] COND TRUE i < max_loop VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=1, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=1, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, timer=0] [L86] CALL write_data(num, 'A') VAL [\old(c)=65, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(i___0)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=1, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=1, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, timer=0] [L49] COND TRUE i___0 == 0 [L50] data_0 = c VAL [\old(c)=65, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(i___0)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=1, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, c=65, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=65, data_1=0, e=0, i=0, i___0=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=1, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, timer=0] [L86] RET write_data(num, 'A') VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=1, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=65, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=1, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, timer=0] [L87] num += 1 [L88] P_1_pc = 1 [L89] P_1_st = 2 VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=1, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=65, data_1=0, e=0, i=0, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, timer=0] [L363] RET P_1() VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=65, data_1=0, e=0, i=0, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, timer=0, tmp=1, tmp___2=1] [L371] COND TRUE (int )P_2_st == 0 [L373] tmp___0 = __VERIFIER_nondet_int() [L375] COND TRUE \read(tmp___0) [L377] P_2_st = 1 VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=65, data_1=0, e=0, i=0, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=1, timer=0, tmp=1, tmp___0=1, tmp___2=1] [L378] CALL P_2() VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=65, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=1, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=2, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=1, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=65, data_1=0, e=0, i=0, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=1, timer=0] [L130] COND TRUE (int )P_2_pc == 0 VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=65, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=1, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=2, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=1, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=65, data_1=0, e=0, i=0, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=1, timer=0] [L141] COND TRUE i < max_loop VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=65, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=1, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=2, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=1, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=65, data_1=0, e=0, i=0, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=1, timer=0] [L144] CALL write_data(num, 'B') VAL [\old(c)=66, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=65, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(i___0)=1, \old(max_loop)=0, \old(num)=1, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=2, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=1, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=65, data_1=0, e=0, i=0, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=1, timer=0] [L49] COND FALSE !(i___0 == 0) VAL [\old(c)=66, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=65, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(i___0)=1, \old(max_loop)=0, \old(num)=1, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=2, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=1, \old(timer)=0, c=66, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=65, data_1=0, e=0, i=0, i___0=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=1, timer=0] [L52] COND TRUE i___0 == 1 [L53] data_1 = c VAL [\old(c)=66, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=65, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(i___0)=1, \old(max_loop)=0, \old(num)=1, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=2, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=1, \old(timer)=0, c=66, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=65, data_1=66, e=0, i=0, i___0=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=1, timer=0] [L144] RET write_data(num, 'B') VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=65, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=1, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=2, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=1, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=65, data_1=66, e=0, i=0, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=1, timer=0] [L145] num += 1 VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=65, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=1, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=2, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=1, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=65, data_1=66, e=0, i=0, max_loop=2, num=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=1, timer=0] [L147] COND FALSE !(\read(timer)) VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=65, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=1, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=2, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=1, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=65, data_1=66, e=0, i=0, max_loop=2, num=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=1, timer=0] [L157] P_2_pc = 1 [L158] P_2_st = 2 VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=65, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=1, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=2, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=1, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=65, data_1=66, e=0, i=0, max_loop=2, num=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L378] RET P_2() VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=65, data_1=66, e=0, i=0, max_loop=2, num=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0, tmp=1, tmp___0=1, tmp___2=1] [L386] COND TRUE (int )C_1_st == 0 [L388] tmp___1 = __VERIFIER_nondet_int() [L390] COND TRUE \read(tmp___1) [L392] C_1_st = 1 VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=1, data_0=65, data_1=66, e=0, i=0, max_loop=2, num=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0, tmp=1, tmp___0=1, tmp___1=1, tmp___2=1] [L393] CALL C_1() VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=1, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=2, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=1, data_0=65, data_1=66, e=0, i=0, max_loop=2, num=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L196] char c ; VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=1, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=2, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=1, data_0=65, data_1=66, e=0, i=0, max_loop=2, num=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L199] COND TRUE (int )C_1_pc == 0 VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=1, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=2, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=1, data_0=65, data_1=66, e=0, i=0, max_loop=2, num=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L214] COND TRUE i < max_loop VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=1, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=2, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=1, data_0=65, data_1=66, e=0, i=0, max_loop=2, num=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L216] COND FALSE !(num == 0) VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=1, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=2, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=1, data_0=65, data_1=66, e=0, i=0, max_loop=2, num=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L227] num -= 1 VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=1, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=2, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=1, data_0=65, data_1=66, e=0, i=0, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L228] COND FALSE !(! (num >= 0)) VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=1, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=2, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=1, data_0=65, data_1=66, e=0, i=0, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L236] CALL, EXPR read_data(num) VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=1, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(i___0)=1, \old(max_loop)=0, \old(num)=2, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=1, data_0=65, data_1=66, e=0, i=0, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L23] char c ; [L24] char __retres3 ; VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=1, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(i___0)=1, \old(max_loop)=0, \old(num)=2, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=1, data_0=65, data_1=66, e=0, i=0, i___0=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L27] COND FALSE !(i___0 == 0) VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=1, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(i___0)=1, \old(max_loop)=0, \old(num)=2, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=1, data_0=65, data_1=66, e=0, i=0, i___0=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L31] COND TRUE i___0 == 1 [L32] __retres3 = data_1 VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=1, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(i___0)=1, \old(max_loop)=0, \old(num)=2, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, __retres3=66, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=1, data_0=65, data_1=66, e=0, i=0, i___0=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L42] return (__retres3); VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=1, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(i___0)=1, \old(max_loop)=0, \old(num)=2, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, \result=66, __retres3=66, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=1, data_0=65, data_1=66, e=0, i=0, i___0=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L236] RET, EXPR read_data(num) VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=1, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=2, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=1, data_0=65, data_1=66, e=0, i=0, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, read_data(num)=66, timer=0] [L236] c = read_data(num) [L237] i += 1 [L238] C_1_pc = 2 [L239] C_1_st = 2 VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=1, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=2, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, c=66, C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L393] RET C_1() VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0, tmp=1, tmp___0=1, tmp___1=1, tmp___2=1] [L346] COND TRUE 1 VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0, tmp=1, tmp___0=1, tmp___1=1, tmp___2=1] [L349] CALL, EXPR exists_runnable_thread() VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L314] int __retres1 ; VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L317] COND FALSE !((int )P_1_st == 0) VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L321] COND FALSE !((int )P_2_st == 0) VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L325] COND FALSE !((int )C_1_st == 0) [L333] __retres1 = 0 VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, __retres1=0, C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L335] return (__retres1); VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, \result=0, __retres1=0, C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L349] RET, EXPR exists_runnable_thread() VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, exists_runnable_thread()=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0, tmp=1, tmp___0=1, tmp___1=1, tmp___2=1] [L349] tmp___2 = exists_runnable_thread() [L351] COND FALSE !(\read(tmp___2)) VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0, tmp=1, tmp___0=1, tmp___1=1, tmp___2=0] [L541] RET eval() VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, kernel_st=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L544] kernel_st = 2 VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, kernel_st=2, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L545] FCALL update_channels() VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, kernel_st=2, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L548] kernel_st = 3 VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, kernel_st=3, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L549] FCALL fire_delta_events() VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, kernel_st=3, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L550] CALL activate_threads() VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=2, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=2, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=2, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L459] int tmp ; [L460] int tmp___0 ; [L461] int tmp___1 ; VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=2, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=2, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=2, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L465] CALL, EXPR is_P_1_triggered() VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=2, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=2, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=2, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L104] int __retres1 ; VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=2, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=2, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=2, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L107] COND TRUE (int )P_1_pc == 1 VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=2, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=2, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=2, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L108] COND FALSE !((int )P_1_ev == 1) VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=2, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=2, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=2, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L117] __retres1 = 0 VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=2, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=2, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=2, \old(timer)=0, __retres1=0, C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L119] return (__retres1); VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=2, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=2, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=2, \old(timer)=0, \result=0, __retres1=0, C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L465] RET, EXPR is_P_1_triggered() VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=2, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=2, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=2, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, is_P_1_triggered()=0, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L465] tmp = is_P_1_triggered() [L467] COND FALSE !(\read(tmp)) VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=2, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=2, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=2, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0, tmp=0] [L473] CALL, EXPR is_P_2_triggered() VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=2, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=2, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=2, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L172] int __retres1 ; VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=2, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=2, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=2, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L175] COND TRUE (int )P_2_pc == 1 VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=2, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=2, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=2, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L176] COND FALSE !((int )P_2_ev == 1) VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=2, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=2, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=2, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L185] __retres1 = 0 VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=2, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=2, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=2, \old(timer)=0, __retres1=0, C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L187] return (__retres1); VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=2, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=2, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=2, \old(timer)=0, \result=0, __retres1=0, C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L473] RET, EXPR is_P_2_triggered() VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=2, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=2, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=2, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, is_P_2_triggered()=0, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0, tmp=0] [L473] tmp___0 = is_P_2_triggered() [L475] COND FALSE !(\read(tmp___0)) VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=2, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=2, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=2, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0, tmp=0, tmp___0=0] [L481] CALL, EXPR is_C_1_triggered() VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=2, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=2, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=2, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L254] int __retres1 ; VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=2, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=2, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=2, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L257] COND FALSE !((int )C_1_pc == 1) VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=2, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=2, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=2, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L267] COND TRUE (int )C_1_pc == 2 VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=2, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=2, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=2, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L268] COND FALSE !((int )C_1_ev == 1) VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=2, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=2, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=2, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L277] __retres1 = 0 VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=2, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=2, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=2, \old(timer)=0, __retres1=0, C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L279] return (__retres1); VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=2, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=2, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=2, \old(timer)=0, \result=0, __retres1=0, C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L481] RET, EXPR is_C_1_triggered() VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=2, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=2, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=2, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, is_C_1_triggered()=0, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0, tmp=0, tmp___0=0] [L481] tmp___1 = is_C_1_triggered() [L483] COND FALSE !(\read(tmp___1)) VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=2, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=2, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=2, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0, tmp=0, tmp___0=0, tmp___1=0] [L550] RET activate_threads() VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, kernel_st=3, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L551] FCALL reset_delta_events() VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, kernel_st=3, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L554] CALL, EXPR exists_runnable_thread() VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L314] int __retres1 ; VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L317] COND FALSE !((int )P_1_st == 0) VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L321] COND FALSE !((int )P_2_st == 0) VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L325] COND FALSE !((int )C_1_st == 0) [L333] __retres1 = 0 VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, __retres1=0, C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L335] return (__retres1); VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, \result=0, __retres1=0, C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L554] RET, EXPR exists_runnable_thread() VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, exists_runnable_thread()=0, i=1, kernel_st=3, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L554] tmp = exists_runnable_thread() [L556] COND TRUE tmp == 0 [L558] kernel_st = 4 VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, kernel_st=4, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0, tmp=0] [L559] CALL fire_time_events() VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L428] C_1_ev = 1 [L429] P_1_ev = 1 [L430] P_2_ev = 1 VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=1, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=1, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L559] RET fire_time_events() VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=1, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, kernel_st=4, max_loop=2, num=1, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=1, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0, tmp=0] [L560] CALL activate_threads() VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=2, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=2, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=2, \old(timer)=0, C_1_ev=1, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=1, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L459] int tmp ; [L460] int tmp___0 ; [L461] int tmp___1 ; VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=2, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=2, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=2, \old(timer)=0, C_1_ev=1, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=1, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L465] CALL, EXPR is_P_1_triggered() VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=2, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=2, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=2, \old(timer)=0, C_1_ev=1, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=1, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L104] int __retres1 ; VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=2, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=2, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=2, \old(timer)=0, C_1_ev=1, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=1, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L107] COND TRUE (int )P_1_pc == 1 VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=2, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=2, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=2, \old(timer)=0, C_1_ev=1, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=1, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L108] COND TRUE (int )P_1_ev == 1 [L109] __retres1 = 1 VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=2, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=2, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=2, \old(timer)=0, __retres1=1, C_1_ev=1, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=1, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L119] return (__retres1); VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=2, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=2, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=2, \old(timer)=0, \result=1, __retres1=1, C_1_ev=1, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=1, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L465] RET, EXPR is_P_1_triggered() VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=2, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=2, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=2, \old(timer)=0, C_1_ev=1, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, is_P_1_triggered()=1, max_loop=2, num=1, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=1, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L465] tmp = is_P_1_triggered() [L467] COND TRUE \read(tmp) [L468] P_1_st = 0 VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=2, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=2, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=2, \old(timer)=0, C_1_ev=1, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, P_2_ev=1, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0, tmp=1] [L473] CALL, EXPR is_P_2_triggered() VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=2, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=2, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=2, \old(timer)=0, C_1_ev=1, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, P_2_ev=1, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L172] int __retres1 ; VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=2, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=2, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=2, \old(timer)=0, C_1_ev=1, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, P_2_ev=1, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L175] COND TRUE (int )P_2_pc == 1 VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=2, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=2, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=2, \old(timer)=0, C_1_ev=1, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, P_2_ev=1, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L176] COND TRUE (int )P_2_ev == 1 [L177] __retres1 = 1 VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=2, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=2, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=2, \old(timer)=0, __retres1=1, C_1_ev=1, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, P_2_ev=1, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L187] return (__retres1); VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=2, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=2, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=2, \old(timer)=0, \result=1, __retres1=1, C_1_ev=1, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, P_2_ev=1, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L473] RET, EXPR is_P_2_triggered() VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=2, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=2, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=2, \old(timer)=0, C_1_ev=1, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, is_P_2_triggered()=1, max_loop=2, num=1, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, P_2_ev=1, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0, tmp=1] [L473] tmp___0 = is_P_2_triggered() [L475] COND TRUE \read(tmp___0) [L476] P_2_st = 0 VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=2, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=2, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=2, \old(timer)=0, C_1_ev=1, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, P_2_ev=1, P_2_i=1, P_2_pc=1, P_2_st=0, timer=0, tmp=1, tmp___0=1] [L481] CALL, EXPR is_C_1_triggered() VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=2, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=2, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=2, \old(timer)=0, C_1_ev=1, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, P_2_ev=1, P_2_i=1, P_2_pc=1, P_2_st=0, timer=0] [L254] int __retres1 ; VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=2, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=2, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=2, \old(timer)=0, C_1_ev=1, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, P_2_ev=1, P_2_i=1, P_2_pc=1, P_2_st=0, timer=0] [L257] COND FALSE !((int )C_1_pc == 1) VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=2, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=2, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=2, \old(timer)=0, C_1_ev=1, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, P_2_ev=1, P_2_i=1, P_2_pc=1, P_2_st=0, timer=0] [L267] COND TRUE (int )C_1_pc == 2 VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=2, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=2, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=2, \old(timer)=0, C_1_ev=1, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, P_2_ev=1, P_2_i=1, P_2_pc=1, P_2_st=0, timer=0] [L268] COND TRUE (int )C_1_ev == 1 [L269] __retres1 = 1 VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=2, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=2, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=2, \old(timer)=0, __retres1=1, C_1_ev=1, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, P_2_ev=1, P_2_i=1, P_2_pc=1, P_2_st=0, timer=0] [L279] return (__retres1); VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=2, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=2, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=2, \old(timer)=0, \result=1, __retres1=1, C_1_ev=1, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, P_2_ev=1, P_2_i=1, P_2_pc=1, P_2_st=0, timer=0] [L481] RET, EXPR is_C_1_triggered() VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=2, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=2, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=2, \old(timer)=0, C_1_ev=1, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, is_C_1_triggered()=1, max_loop=2, num=1, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, P_2_ev=1, P_2_i=1, P_2_pc=1, P_2_st=0, timer=0, tmp=1, tmp___0=1] [L481] tmp___1 = is_C_1_triggered() [L483] COND TRUE \read(tmp___1) [L484] C_1_st = 0 VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=2, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=2, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=2, \old(timer)=0, C_1_ev=1, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=0, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, P_2_ev=1, P_2_i=1, P_2_pc=1, P_2_st=0, timer=0, tmp=1, tmp___0=1, tmp___1=1] [L560] RET activate_threads() VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=1, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=0, data_0=65, data_1=66, e=0, i=1, kernel_st=4, max_loop=2, num=1, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, P_2_ev=1, P_2_i=1, P_2_pc=1, P_2_st=0, timer=0, tmp=0] [L561] CALL reset_time_events() VAL [\old(C_1_ev)=1, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=1, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=1, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=1, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=0, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, P_2_ev=1, P_2_i=1, P_2_pc=1, P_2_st=0, timer=0] [L439] COND TRUE (int )P_1_ev == 1 [L440] P_1_ev = 2 VAL [\old(C_1_ev)=1, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=1, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=1, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=1, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=0, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, P_2_ev=1, P_2_i=1, P_2_pc=1, P_2_st=0, timer=0] [L444] COND TRUE (int )P_2_ev == 1 [L445] P_2_ev = 2 VAL [\old(C_1_ev)=1, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=1, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=1, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=1, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=0, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, P_2_ev=2, P_2_i=1, P_2_pc=1, P_2_st=0, timer=0] [L449] COND TRUE (int )C_1_ev == 1 [L450] C_1_ev = 2 VAL [\old(C_1_ev)=1, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=1, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=1, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=2, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=0, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, P_2_ev=2, P_2_i=1, P_2_pc=1, P_2_st=0, timer=0] [L561] RET reset_time_events() VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=2, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=0, data_0=65, data_1=66, e=0, i=1, kernel_st=4, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, P_2_ev=2, P_2_i=1, P_2_pc=1, P_2_st=0, timer=0, tmp=0] [L567] CALL, EXPR stop_simulation() VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=2, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=0, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, P_2_ev=2, P_2_i=1, P_2_pc=1, P_2_st=0, timer=0] [L504] int tmp ; [L505] int __retres2 ; VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=2, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=0, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, P_2_ev=2, P_2_i=1, P_2_pc=1, P_2_st=0, timer=0] [L509] CALL, EXPR exists_runnable_thread() VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=2, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=0, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, P_2_ev=2, P_2_i=1, P_2_pc=1, P_2_st=0, timer=0] [L314] int __retres1 ; VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=2, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=0, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, P_2_ev=2, P_2_i=1, P_2_pc=1, P_2_st=0, timer=0] [L317] COND TRUE (int )P_1_st == 0 [L318] __retres1 = 1 VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, __retres1=1, C_1_ev=2, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=0, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, P_2_ev=2, P_2_i=1, P_2_pc=1, P_2_st=0, timer=0] [L335] return (__retres1); VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, \result=1, __retres1=1, C_1_ev=2, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=0, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, P_2_ev=2, P_2_i=1, P_2_pc=1, P_2_st=0, timer=0] [L509] RET, EXPR exists_runnable_thread() VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=2, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=0, data_0=65, data_1=66, e=0, exists_runnable_thread()=1, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, P_2_ev=2, P_2_i=1, P_2_pc=1, P_2_st=0, timer=0] [L509] tmp = exists_runnable_thread() [L511] COND TRUE \read(tmp) [L512] __retres2 = 0 VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, __retres2=0, C_1_ev=2, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=0, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, P_2_ev=2, P_2_i=1, P_2_pc=1, P_2_st=0, timer=0, tmp=1] [L519] return (__retres2); VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, \result=0, __retres2=0, C_1_ev=2, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=0, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, P_2_ev=2, P_2_i=1, P_2_pc=1, P_2_st=0, timer=0, tmp=1] [L567] RET, EXPR stop_simulation() VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=2, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=0, data_0=65, data_1=66, e=0, i=1, kernel_st=4, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, P_2_ev=2, P_2_i=1, P_2_pc=1, P_2_st=0, stop_simulation()=0, timer=0, tmp=0] [L567] tmp___0 = stop_simulation() [L569] COND FALSE !(\read(tmp___0)) VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=2, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=0, data_0=65, data_1=66, e=0, i=1, kernel_st=4, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, P_2_ev=2, P_2_i=1, P_2_pc=1, P_2_st=0, timer=0, tmp=0, tmp___0=0] [L537] COND TRUE 1 VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=2, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=0, data_0=65, data_1=66, e=0, i=1, kernel_st=4, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, P_2_ev=2, P_2_i=1, P_2_pc=1, P_2_st=0, timer=0, tmp=0, tmp___0=0] [L540] kernel_st = 1 VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=2, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=0, data_0=65, data_1=66, e=0, i=1, kernel_st=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, P_2_ev=2, P_2_i=1, P_2_pc=1, P_2_st=0, timer=0, tmp=0, tmp___0=0] [L541] CALL eval() VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=2, \old(C_1_st)=0, \old(data_0)=65, \old(data_1)=66, \old(e)=0, \old(i)=1, \old(max_loop)=0, \old(num)=1, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=1, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=1, \old(P_2_st)=0, \old(timer)=0, C_1_ev=2, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=0, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, P_2_ev=2, P_2_i=1, P_2_pc=1, P_2_st=0, timer=0] [L339] int tmp ; [L340] int tmp___0 ; [L341] int tmp___1 ; [L342] int tmp___2 ; VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=2, \old(C_1_st)=0, \old(data_0)=65, \old(data_1)=66, \old(e)=0, \old(i)=1, \old(max_loop)=0, \old(num)=1, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=1, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=1, \old(P_2_st)=0, \old(timer)=0, C_1_ev=2, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=0, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, P_2_ev=2, P_2_i=1, P_2_pc=1, P_2_st=0, timer=0] [L346] COND TRUE 1 VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=2, \old(C_1_st)=0, \old(data_0)=65, \old(data_1)=66, \old(e)=0, \old(i)=1, \old(max_loop)=0, \old(num)=1, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=1, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=1, \old(P_2_st)=0, \old(timer)=0, C_1_ev=2, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=0, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, P_2_ev=2, P_2_i=1, P_2_pc=1, P_2_st=0, timer=0] [L349] CALL, EXPR exists_runnable_thread() VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=2, \old(C_1_st)=0, \old(data_0)=65, \old(data_1)=66, \old(e)=0, \old(i)=1, \old(max_loop)=0, \old(num)=1, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=1, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=1, \old(P_2_st)=0, \old(timer)=0, C_1_ev=2, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=0, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, P_2_ev=2, P_2_i=1, P_2_pc=1, P_2_st=0, timer=0] [L314] int __retres1 ; VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=2, \old(C_1_st)=0, \old(data_0)=65, \old(data_1)=66, \old(e)=0, \old(i)=1, \old(max_loop)=0, \old(num)=1, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=1, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=1, \old(P_2_st)=0, \old(timer)=0, C_1_ev=2, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=0, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, P_2_ev=2, P_2_i=1, P_2_pc=1, P_2_st=0, timer=0] [L317] COND TRUE (int )P_1_st == 0 [L318] __retres1 = 1 VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=2, \old(C_1_st)=0, \old(data_0)=65, \old(data_1)=66, \old(e)=0, \old(i)=1, \old(max_loop)=0, \old(num)=1, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=1, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=1, \old(P_2_st)=0, \old(timer)=0, __retres1=1, C_1_ev=2, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=0, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, P_2_ev=2, P_2_i=1, P_2_pc=1, P_2_st=0, timer=0] [L335] return (__retres1); VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=2, \old(C_1_st)=0, \old(data_0)=65, \old(data_1)=66, \old(e)=0, \old(i)=1, \old(max_loop)=0, \old(num)=1, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=1, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=1, \old(P_2_st)=0, \old(timer)=0, \result=1, __retres1=1, C_1_ev=2, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=0, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, P_2_ev=2, P_2_i=1, P_2_pc=1, P_2_st=0, timer=0] [L349] RET, EXPR exists_runnable_thread() VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=2, \old(C_1_st)=0, \old(data_0)=65, \old(data_1)=66, \old(e)=0, \old(i)=1, \old(max_loop)=0, \old(num)=1, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=1, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=1, \old(P_2_st)=0, \old(timer)=0, C_1_ev=2, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=0, data_0=65, data_1=66, e=0, exists_runnable_thread()=1, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, P_2_ev=2, P_2_i=1, P_2_pc=1, P_2_st=0, timer=0] [L349] tmp___2 = exists_runnable_thread() [L351] COND TRUE \read(tmp___2) VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=2, \old(C_1_st)=0, \old(data_0)=65, \old(data_1)=66, \old(e)=0, \old(i)=1, \old(max_loop)=0, \old(num)=1, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=1, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=1, \old(P_2_st)=0, \old(timer)=0, C_1_ev=2, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=0, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, P_2_ev=2, P_2_i=1, P_2_pc=1, P_2_st=0, timer=0, tmp___2=1] [L356] COND TRUE (int )P_1_st == 0 [L358] tmp = __VERIFIER_nondet_int() [L360] COND TRUE \read(tmp) [L362] P_1_st = 1 VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=2, \old(C_1_st)=0, \old(data_0)=65, \old(data_1)=66, \old(e)=0, \old(i)=1, \old(max_loop)=0, \old(num)=1, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=1, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=1, \old(P_2_st)=0, \old(timer)=0, C_1_ev=2, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=0, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=1, P_2_ev=2, P_2_i=1, P_2_pc=1, P_2_st=0, timer=0, tmp=1, tmp___2=1] [L363] CALL P_1() VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=2, \old(C_1_st)=0, \old(data_0)=65, \old(data_1)=66, \old(e)=0, \old(i)=1, \old(max_loop)=0, \old(num)=1, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=1, \old(P_1_st)=1, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=1, \old(P_2_st)=0, \old(timer)=0, C_1_ev=2, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=0, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=1, P_2_ev=2, P_2_i=1, P_2_pc=1, P_2_st=0, timer=0] [L72] COND FALSE !((int )P_1_pc == 0) VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=2, \old(C_1_st)=0, \old(data_0)=65, \old(data_1)=66, \old(e)=0, \old(i)=1, \old(max_loop)=0, \old(num)=1, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=1, \old(P_1_st)=1, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=1, \old(P_2_st)=0, \old(timer)=0, C_1_ev=2, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=0, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=1, P_2_ev=2, P_2_i=1, P_2_pc=1, P_2_st=0, timer=0] [L75] COND TRUE (int )P_1_pc == 1 VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=2, \old(C_1_st)=0, \old(data_0)=65, \old(data_1)=66, \old(e)=0, \old(i)=1, \old(max_loop)=0, \old(num)=1, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=1, \old(P_1_st)=1, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=1, \old(P_2_st)=0, \old(timer)=0, C_1_ev=2, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=0, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=1, P_2_ev=2, P_2_i=1, P_2_pc=1, P_2_st=0, timer=0] [L83] COND TRUE i < max_loop VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=2, \old(C_1_st)=0, \old(data_0)=65, \old(data_1)=66, \old(e)=0, \old(i)=1, \old(max_loop)=0, \old(num)=1, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=1, \old(P_1_st)=1, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=1, \old(P_2_st)=0, \old(timer)=0, C_1_ev=2, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=0, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=1, P_2_ev=2, P_2_i=1, P_2_pc=1, P_2_st=0, timer=0] [L86] CALL write_data(num, 'A') VAL [\old(c)=65, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=2, \old(C_1_st)=0, \old(data_0)=65, \old(data_1)=66, \old(e)=0, \old(i)=1, \old(i___0)=1, \old(max_loop)=0, \old(num)=1, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=1, \old(P_1_st)=1, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=1, \old(P_2_st)=0, \old(timer)=0, C_1_ev=2, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=0, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=1, P_2_ev=2, P_2_i=1, P_2_pc=1, P_2_st=0, timer=0] [L49] COND FALSE !(i___0 == 0) VAL [\old(c)=65, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=2, \old(C_1_st)=0, \old(data_0)=65, \old(data_1)=66, \old(e)=0, \old(i)=1, \old(i___0)=1, \old(max_loop)=0, \old(num)=1, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=1, \old(P_1_st)=1, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=1, \old(P_2_st)=0, \old(timer)=0, c=65, C_1_ev=2, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=0, data_0=65, data_1=66, e=0, i=1, i___0=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=1, P_2_ev=2, P_2_i=1, P_2_pc=1, P_2_st=0, timer=0] [L52] COND TRUE i___0 == 1 [L53] data_1 = c VAL [\old(c)=65, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=2, \old(C_1_st)=0, \old(data_0)=65, \old(data_1)=66, \old(e)=0, \old(i)=1, \old(i___0)=1, \old(max_loop)=0, \old(num)=1, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=1, \old(P_1_st)=1, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=1, \old(P_2_st)=0, \old(timer)=0, c=65, C_1_ev=2, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=0, data_0=65, data_1=65, e=0, i=1, i___0=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=1, P_2_ev=2, P_2_i=1, P_2_pc=1, P_2_st=0, timer=0] [L86] RET write_data(num, 'A') VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=2, \old(C_1_st)=0, \old(data_0)=65, \old(data_1)=66, \old(e)=0, \old(i)=1, \old(max_loop)=0, \old(num)=1, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=1, \old(P_1_st)=1, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=1, \old(P_2_st)=0, \old(timer)=0, C_1_ev=2, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=0, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=1, P_2_ev=2, P_2_i=1, P_2_pc=1, P_2_st=0, timer=0] [L87] num += 1 [L88] P_1_pc = 1 [L89] P_1_st = 2 VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=2, \old(C_1_st)=0, \old(data_0)=65, \old(data_1)=66, \old(e)=0, \old(i)=1, \old(max_loop)=0, \old(num)=1, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=1, \old(P_1_st)=1, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=1, \old(P_2_st)=0, \old(timer)=0, C_1_ev=2, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=0, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=2, P_2_i=1, P_2_pc=1, P_2_st=0, timer=0] [L363] RET P_1() VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=2, \old(C_1_st)=0, \old(data_0)=65, \old(data_1)=66, \old(e)=0, \old(i)=1, \old(max_loop)=0, \old(num)=1, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=1, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=1, \old(P_2_st)=0, \old(timer)=0, C_1_ev=2, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=0, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=2, P_2_i=1, P_2_pc=1, P_2_st=0, timer=0, tmp=1, tmp___2=1] [L371] COND TRUE (int )P_2_st == 0 [L373] tmp___0 = __VERIFIER_nondet_int() [L375] COND TRUE \read(tmp___0) [L377] P_2_st = 1 VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=2, \old(C_1_st)=0, \old(data_0)=65, \old(data_1)=66, \old(e)=0, \old(i)=1, \old(max_loop)=0, \old(num)=1, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=1, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=1, \old(P_2_st)=0, \old(timer)=0, C_1_ev=2, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=0, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=2, P_2_i=1, P_2_pc=1, P_2_st=1, timer=0, tmp=1, tmp___0=1, tmp___2=1] [L378] CALL P_2() VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=2, \old(C_1_st)=0, \old(data_0)=65, \old(data_1)=65, \old(e)=0, \old(i)=1, \old(max_loop)=0, \old(num)=2, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=1, \old(P_1_st)=2, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=1, \old(P_2_st)=1, \old(timer)=0, C_1_ev=2, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=0, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=2, P_2_i=1, P_2_pc=1, P_2_st=1, timer=0] [L130] COND FALSE !((int )P_2_pc == 0) VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=2, \old(C_1_st)=0, \old(data_0)=65, \old(data_1)=65, \old(e)=0, \old(i)=1, \old(max_loop)=0, \old(num)=2, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=1, \old(P_1_st)=2, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=1, \old(P_2_st)=1, \old(timer)=0, C_1_ev=2, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=0, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=2, P_2_i=1, P_2_pc=1, P_2_st=1, timer=0] [L133] COND TRUE (int )P_2_pc == 1 VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=2, \old(C_1_st)=0, \old(data_0)=65, \old(data_1)=65, \old(e)=0, \old(i)=1, \old(max_loop)=0, \old(num)=2, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=1, \old(P_1_st)=2, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=1, \old(P_2_st)=1, \old(timer)=0, C_1_ev=2, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=0, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=2, P_2_i=1, P_2_pc=1, P_2_st=1, timer=0] [L141] COND TRUE i < max_loop VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=2, \old(C_1_st)=0, \old(data_0)=65, \old(data_1)=65, \old(e)=0, \old(i)=1, \old(max_loop)=0, \old(num)=2, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=1, \old(P_1_st)=2, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=1, \old(P_2_st)=1, \old(timer)=0, C_1_ev=2, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=0, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=2, P_2_i=1, P_2_pc=1, P_2_st=1, timer=0] [L144] CALL write_data(num, 'B') VAL [\old(c)=66, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=2, \old(C_1_st)=0, \old(data_0)=65, \old(data_1)=65, \old(e)=0, \old(i)=1, \old(i___0)=2, \old(max_loop)=0, \old(num)=2, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=1, \old(P_1_st)=2, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=1, \old(P_2_st)=1, \old(timer)=0, C_1_ev=2, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=0, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=2, P_2_i=1, P_2_pc=1, P_2_st=1, timer=0] [L49] COND FALSE !(i___0 == 0) VAL [\old(c)=66, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=2, \old(C_1_st)=0, \old(data_0)=65, \old(data_1)=65, \old(e)=0, \old(i)=1, \old(i___0)=2, \old(max_loop)=0, \old(num)=2, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=1, \old(P_1_st)=2, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=1, \old(P_2_st)=1, \old(timer)=0, c=66, C_1_ev=2, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=0, data_0=65, data_1=65, e=0, i=1, i___0=2, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=2, P_2_i=1, P_2_pc=1, P_2_st=1, timer=0] [L52] COND FALSE !(i___0 == 1) VAL [\old(c)=66, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=2, \old(C_1_st)=0, \old(data_0)=65, \old(data_1)=65, \old(e)=0, \old(i)=1, \old(i___0)=2, \old(max_loop)=0, \old(num)=2, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=1, \old(P_1_st)=2, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=1, \old(P_2_st)=1, \old(timer)=0, c=66, C_1_ev=2, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=0, data_0=65, data_1=65, e=0, i=1, i___0=2, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=2, P_2_i=1, P_2_pc=1, P_2_st=1, timer=0] [L56] CALL error() VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=2, \old(C_1_st)=0, \old(data_0)=65, \old(data_1)=65, \old(e)=0, \old(i)=1, \old(max_loop)=0, \old(num)=2, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=1, \old(P_1_st)=2, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=1, \old(P_2_st)=1, \old(timer)=0, C_1_ev=2, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=0, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=2, P_2_i=1, P_2_pc=1, P_2_st=1, timer=0] [L9] __VERIFIER_error() VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=2, \old(C_1_st)=0, \old(data_0)=65, \old(data_1)=65, \old(e)=0, \old(i)=1, \old(max_loop)=0, \old(num)=2, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=1, \old(P_1_st)=2, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=1, \old(P_2_st)=1, \old(timer)=0, C_1_ev=2, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=0, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=2, P_2_i=1, P_2_pc=1, P_2_st=1, timer=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 25 procedures, 181 locations, 1 error locations. UNSAFE Result, 204.6s OverallTime, 41 OverallIterations, 6 TraceHistogramMax, 123.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 14521 SDtfs, 15997 SDslu, 62063 SDs, 0 SdLazy, 27773 SolverSat, 3716 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 14.5s Time, PredicateUnifierStatistics: 16 DeclaredPredicates, 7300 GetRequests, 6399 SyntacticMatches, 59 SemanticMatches, 842 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14227 ImplicationChecksByTransitivity, 9.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=245859occurred in iteration=28, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 7.0s AbstIntTime, 20 AbstIntIterations, 8 AbstIntStrong, 0.9863033167752431 AbsIntWeakeningRatio, 0.7561904761904762 AbsIntAvgWeakeningVarsNumRemoved, 25.622857142857143 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 63.8s AutomataMinimizationTime, 40 MinimizatonAttempts, 46591 StatesRemovedByMinimization, 38 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 3.7s InterpolantComputationTime, 10210 NumberOfCodeBlocks, 10210 NumberOfCodeBlocksAsserted, 53 NumberOfCheckSat, 12678 ConstructedInterpolants, 0 QuantifiedInterpolants, 4607602 SizeOfPredicates, 20 NumberOfNonLiveVariables, 12311 ConjunctsInSsa, 99 ConjunctsInUnsatCore, 64 InterpolantComputations, 37 PerfectInterpolantSequences, 7083/7521 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...