./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_2.ufo.BOUNDED-10.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 38b53e6a Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b050e35a-0ebd-4c9f-90ce-59bf7556af81/bin/uautomizer-ZsLfNo2U6R/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b050e35a-0ebd-4c9f-90ce-59bf7556af81/bin/uautomizer-ZsLfNo2U6R/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b050e35a-0ebd-4c9f-90ce-59bf7556af81/bin/uautomizer-ZsLfNo2U6R/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b050e35a-0ebd-4c9f-90ce-59bf7556af81/bin/uautomizer-ZsLfNo2U6R/config/AutomizerReach.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_2.ufo.BOUNDED-10.pals.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b050e35a-0ebd-4c9f-90ce-59bf7556af81/bin/uautomizer-ZsLfNo2U6R/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b050e35a-0ebd-4c9f-90ce-59bf7556af81/bin/uautomizer-ZsLfNo2U6R --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash cdd691469d2e12c2dd1871c48be4dd2db0b9d27541ac5dee5ff25a04db0d98eb --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-38b53e6 [2022-11-25 15:27:03,465 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 15:27:03,468 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 15:27:03,508 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 15:27:03,509 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 15:27:03,513 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 15:27:03,515 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 15:27:03,520 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 15:27:03,522 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 15:27:03,525 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 15:27:03,527 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 15:27:03,530 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 15:27:03,530 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 15:27:03,535 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 15:27:03,537 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 15:27:03,538 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 15:27:03,540 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 15:27:03,542 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 15:27:03,543 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 15:27:03,548 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 15:27:03,549 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 15:27:03,552 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 15:27:03,553 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 15:27:03,554 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 15:27:03,563 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 15:27:03,566 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 15:27:03,566 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 15:27:03,567 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 15:27:03,569 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 15:27:03,570 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 15:27:03,570 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 15:27:03,571 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 15:27:03,572 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 15:27:03,574 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 15:27:03,575 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 15:27:03,575 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 15:27:03,576 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 15:27:03,576 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 15:27:03,576 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 15:27:03,577 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 15:27:03,578 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 15:27:03,578 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b050e35a-0ebd-4c9f-90ce-59bf7556af81/bin/uautomizer-ZsLfNo2U6R/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-25 15:27:03,615 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 15:27:03,615 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 15:27:03,615 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 15:27:03,616 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 15:27:03,617 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 15:27:03,617 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 15:27:03,617 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-25 15:27:03,618 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-25 15:27:03,618 INFO L138 SettingsManager]: * Use SBE=true [2022-11-25 15:27:03,618 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 15:27:03,619 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-25 15:27:03,619 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 15:27:03,635 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-25 15:27:03,636 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 15:27:03,636 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-25 15:27:03,636 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 15:27:03,636 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-25 15:27:03,636 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-25 15:27:03,637 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-25 15:27:03,637 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 15:27:03,637 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-25 15:27:03,637 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 15:27:03,637 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-25 15:27:03,638 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 15:27:03,638 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 15:27:03,638 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 15:27:03,638 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 15:27:03,638 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-25 15:27:03,639 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-25 15:27:03,639 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-25 15:27:03,640 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-25 15:27:03,640 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-25 15:27:03,640 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-11-25 15:27:03,640 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-25 15:27:03,641 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b050e35a-0ebd-4c9f-90ce-59bf7556af81/bin/uautomizer-ZsLfNo2U6R/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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_worker_vcloud-master_on_vcloud-master/run_dir_b050e35a-0ebd-4c9f-90ce-59bf7556af81/bin/uautomizer-ZsLfNo2U6R Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> cdd691469d2e12c2dd1871c48be4dd2db0b9d27541ac5dee5ff25a04db0d98eb [2022-11-25 15:27:03,904 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 15:27:03,933 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 15:27:03,935 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 15:27:03,936 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 15:27:03,937 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 15:27:03,938 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b050e35a-0ebd-4c9f-90ce-59bf7556af81/bin/uautomizer-ZsLfNo2U6R/../../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_2.ufo.BOUNDED-10.pals.c [2022-11-25 15:27:06,935 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 15:27:07,249 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 15:27:07,250 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b050e35a-0ebd-4c9f-90ce-59bf7556af81/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_2.ufo.BOUNDED-10.pals.c [2022-11-25 15:27:07,264 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b050e35a-0ebd-4c9f-90ce-59bf7556af81/bin/uautomizer-ZsLfNo2U6R/data/0020340d0/6f651433206b46b6b8ce072384ad2c17/FLAG6c9b16263 [2022-11-25 15:27:07,286 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b050e35a-0ebd-4c9f-90ce-59bf7556af81/bin/uautomizer-ZsLfNo2U6R/data/0020340d0/6f651433206b46b6b8ce072384ad2c17 [2022-11-25 15:27:07,288 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 15:27:07,291 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 15:27:07,296 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 15:27:07,296 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 15:27:07,300 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 15:27:07,301 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 03:27:07" (1/1) ... [2022-11-25 15:27:07,302 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a2dbf74 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:27:07, skipping insertion in model container [2022-11-25 15:27:07,303 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 03:27:07" (1/1) ... [2022-11-25 15:27:07,311 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 15:27:07,373 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 15:27:07,724 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b050e35a-0ebd-4c9f-90ce-59bf7556af81/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_2.ufo.BOUNDED-10.pals.c[14702,14715] [2022-11-25 15:27:07,729 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 15:27:07,740 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 15:27:07,840 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b050e35a-0ebd-4c9f-90ce-59bf7556af81/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_2.ufo.BOUNDED-10.pals.c[14702,14715] [2022-11-25 15:27:07,849 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 15:27:07,871 INFO L208 MainTranslator]: Completed translation [2022-11-25 15:27:07,872 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:27:07 WrapperNode [2022-11-25 15:27:07,872 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 15:27:07,874 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 15:27:07,874 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 15:27:07,874 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 15:27:07,882 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:27:07" (1/1) ... [2022-11-25 15:27:07,908 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:27:07" (1/1) ... [2022-11-25 15:27:07,957 INFO L138 Inliner]: procedures = 32, calls = 48, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 482 [2022-11-25 15:27:07,966 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 15:27:07,967 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 15:27:07,967 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 15:27:07,967 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 15:27:07,977 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:27:07" (1/1) ... [2022-11-25 15:27:07,978 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:27:07" (1/1) ... [2022-11-25 15:27:07,999 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:27:07" (1/1) ... [2022-11-25 15:27:07,999 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:27:07" (1/1) ... [2022-11-25 15:27:08,008 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:27:07" (1/1) ... [2022-11-25 15:27:08,028 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:27:07" (1/1) ... [2022-11-25 15:27:08,035 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:27:07" (1/1) ... [2022-11-25 15:27:08,038 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:27:07" (1/1) ... [2022-11-25 15:27:08,043 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 15:27:08,047 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 15:27:08,047 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 15:27:08,047 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 15:27:08,048 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:27:07" (1/1) ... [2022-11-25 15:27:08,057 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 15:27:08,069 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b050e35a-0ebd-4c9f-90ce-59bf7556af81/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 15:27:08,085 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b050e35a-0ebd-4c9f-90ce-59bf7556af81/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-25 15:27:08,110 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b050e35a-0ebd-4c9f-90ce-59bf7556af81/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-25 15:27:08,138 INFO L130 BoogieDeclarations]: Found specification of procedure read_manual_selection_history [2022-11-25 15:27:08,138 INFO L138 BoogieDeclarations]: Found implementation of procedure read_manual_selection_history [2022-11-25 15:27:08,139 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-25 15:27:08,139 INFO L130 BoogieDeclarations]: Found specification of procedure read_side2_failed_history [2022-11-25 15:27:08,140 INFO L138 BoogieDeclarations]: Found implementation of procedure read_side2_failed_history [2022-11-25 15:27:08,140 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2022-11-25 15:27:08,141 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2022-11-25 15:27:08,141 INFO L130 BoogieDeclarations]: Found specification of procedure flip_the_side [2022-11-25 15:27:08,141 INFO L138 BoogieDeclarations]: Found implementation of procedure flip_the_side [2022-11-25 15:27:08,141 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-11-25 15:27:08,142 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-11-25 15:27:08,142 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-25 15:27:08,142 INFO L130 BoogieDeclarations]: Found specification of procedure read_side1_failed_history [2022-11-25 15:27:08,142 INFO L138 BoogieDeclarations]: Found implementation of procedure read_side1_failed_history [2022-11-25 15:27:08,143 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 15:27:08,143 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 15:27:08,143 INFO L130 BoogieDeclarations]: Found specification of procedure read_active_side_history [2022-11-25 15:27:08,143 INFO L138 BoogieDeclarations]: Found implementation of procedure read_active_side_history [2022-11-25 15:27:08,265 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 15:27:08,267 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 15:27:09,011 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 15:27:09,032 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 15:27:09,033 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-25 15:27:09,035 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 03:27:09 BoogieIcfgContainer [2022-11-25 15:27:09,036 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 15:27:09,038 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-25 15:27:09,038 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-25 15:27:09,042 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-25 15:27:09,042 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 03:27:07" (1/3) ... [2022-11-25 15:27:09,043 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@773c13c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 03:27:09, skipping insertion in model container [2022-11-25 15:27:09,044 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:27:07" (2/3) ... [2022-11-25 15:27:09,044 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@773c13c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 03:27:09, skipping insertion in model container [2022-11-25 15:27:09,044 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 03:27:09" (3/3) ... [2022-11-25 15:27:09,046 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_STARTPALS_ActiveStandby.4_2.ufo.BOUNDED-10.pals.c [2022-11-25 15:27:09,068 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-25 15:27:09,068 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-25 15:27:09,154 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 15:27:09,161 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@76c20cd7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 15:27:09,162 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-25 15:27:09,169 INFO L276 IsEmpty]: Start isEmpty. Operand has 181 states, 141 states have (on average 1.553191489361702) internal successors, (219), 142 states have internal predecessors, (219), 31 states have call successors, (31), 7 states have call predecessors, (31), 7 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2022-11-25 15:27:09,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-25 15:27:09,181 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:27:09,182 INFO L195 NwaCegarLoop]: 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] [2022-11-25 15:27:09,183 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 15:27:09,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:27:09,191 INFO L85 PathProgramCache]: Analyzing trace with hash 1494571229, now seen corresponding path program 1 times [2022-11-25 15:27:09,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:27:09,202 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096222578] [2022-11-25 15:27:09,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:27:09,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:27:09,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:27:09,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-25 15:27:09,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:27:09,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:27:09,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:27:09,501 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096222578] [2022-11-25 15:27:09,502 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1096222578] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:27:09,502 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:27:09,502 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 15:27:09,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506341086] [2022-11-25 15:27:09,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:27:09,509 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-25 15:27:09,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:27:09,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-25 15:27:09,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-25 15:27:09,544 INFO L87 Difference]: Start difference. First operand has 181 states, 141 states have (on average 1.553191489361702) internal successors, (219), 142 states have internal predecessors, (219), 31 states have call successors, (31), 7 states have call predecessors, (31), 7 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) Second operand has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-25 15:27:09,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:27:09,598 INFO L93 Difference]: Finished difference Result 346 states and 562 transitions. [2022-11-25 15:27:09,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 15:27:09,600 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2022-11-25 15:27:09,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:27:09,610 INFO L225 Difference]: With dead ends: 346 [2022-11-25 15:27:09,611 INFO L226 Difference]: Without dead ends: 177 [2022-11-25 15:27:09,616 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-25 15:27:09,619 INFO L413 NwaCegarLoop]: 278 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 15:27:09,621 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 278 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 15:27:09,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2022-11-25 15:27:09,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 177. [2022-11-25 15:27:09,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 138 states have (on average 1.536231884057971) internal successors, (212), 138 states have internal predecessors, (212), 31 states have call successors, (31), 7 states have call predecessors, (31), 7 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2022-11-25 15:27:09,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 274 transitions. [2022-11-25 15:27:09,684 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 274 transitions. Word has length 28 [2022-11-25 15:27:09,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:27:09,684 INFO L495 AbstractCegarLoop]: Abstraction has 177 states and 274 transitions. [2022-11-25 15:27:09,685 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-25 15:27:09,685 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 274 transitions. [2022-11-25 15:27:09,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-25 15:27:09,687 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:27:09,687 INFO L195 NwaCegarLoop]: 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] [2022-11-25 15:27:09,687 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-25 15:27:09,687 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 15:27:09,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:27:09,688 INFO L85 PathProgramCache]: Analyzing trace with hash 1713425947, now seen corresponding path program 1 times [2022-11-25 15:27:09,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:27:09,689 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437901486] [2022-11-25 15:27:09,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:27:09,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:27:09,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:27:09,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-25 15:27:09,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:27:10,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:27:10,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:27:10,005 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437901486] [2022-11-25 15:27:10,005 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [437901486] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:27:10,005 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:27:10,005 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-25 15:27:10,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935982738] [2022-11-25 15:27:10,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:27:10,007 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 15:27:10,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:27:10,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 15:27:10,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-25 15:27:10,009 INFO L87 Difference]: Start difference. First operand 177 states and 274 transitions. Second operand has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-25 15:27:10,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:27:10,147 INFO L93 Difference]: Finished difference Result 453 states and 709 transitions. [2022-11-25 15:27:10,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 15:27:10,148 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2022-11-25 15:27:10,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:27:10,151 INFO L225 Difference]: With dead ends: 453 [2022-11-25 15:27:10,151 INFO L226 Difference]: Without dead ends: 290 [2022-11-25 15:27:10,152 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-11-25 15:27:10,154 INFO L413 NwaCegarLoop]: 293 mSDtfsCounter, 137 mSDsluCounter, 1121 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 1414 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 15:27:10,154 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 1414 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 15:27:10,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2022-11-25 15:27:10,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 177. [2022-11-25 15:27:10,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 138 states have (on average 1.4492753623188406) internal successors, (200), 138 states have internal predecessors, (200), 31 states have call successors, (31), 7 states have call predecessors, (31), 7 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2022-11-25 15:27:10,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 262 transitions. [2022-11-25 15:27:10,192 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 262 transitions. Word has length 28 [2022-11-25 15:27:10,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:27:10,196 INFO L495 AbstractCegarLoop]: Abstraction has 177 states and 262 transitions. [2022-11-25 15:27:10,196 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-25 15:27:10,197 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 262 transitions. [2022-11-25 15:27:10,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-11-25 15:27:10,199 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:27:10,199 INFO L195 NwaCegarLoop]: 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] [2022-11-25 15:27:10,199 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-25 15:27:10,200 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 15:27:10,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:27:10,201 INFO L85 PathProgramCache]: Analyzing trace with hash 1150379712, now seen corresponding path program 1 times [2022-11-25 15:27:10,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:27:10,202 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858326153] [2022-11-25 15:27:10,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:27:10,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:27:10,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:27:10,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-25 15:27:10,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:27:10,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:27:10,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:27:10,483 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858326153] [2022-11-25 15:27:10,483 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1858326153] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:27:10,483 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:27:10,484 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 15:27:10,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338954177] [2022-11-25 15:27:10,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:27:10,485 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 15:27:10,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:27:10,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 15:27:10,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 15:27:10,486 INFO L87 Difference]: Start difference. First operand 177 states and 262 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 3 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-25 15:27:10,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:27:10,542 INFO L93 Difference]: Finished difference Result 341 states and 514 transitions. [2022-11-25 15:27:10,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 15:27:10,543 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 3 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 39 [2022-11-25 15:27:10,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:27:10,545 INFO L225 Difference]: With dead ends: 341 [2022-11-25 15:27:10,545 INFO L226 Difference]: Without dead ends: 181 [2022-11-25 15:27:10,547 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-25 15:27:10,548 INFO L413 NwaCegarLoop]: 256 mSDtfsCounter, 5 mSDsluCounter, 502 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 758 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 15:27:10,549 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 758 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 15:27:10,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2022-11-25 15:27:10,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 181. [2022-11-25 15:27:10,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 141 states have (on average 1.4397163120567376) internal successors, (203), 141 states have internal predecessors, (203), 31 states have call successors, (31), 8 states have call predecessors, (31), 8 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2022-11-25 15:27:10,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 265 transitions. [2022-11-25 15:27:10,564 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 265 transitions. Word has length 39 [2022-11-25 15:27:10,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:27:10,565 INFO L495 AbstractCegarLoop]: Abstraction has 181 states and 265 transitions. [2022-11-25 15:27:10,565 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 3 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-25 15:27:10,565 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 265 transitions. [2022-11-25 15:27:10,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-11-25 15:27:10,567 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:27:10,567 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-25 15:27:10,567 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-25 15:27:10,568 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 15:27:10,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:27:10,568 INFO L85 PathProgramCache]: Analyzing trace with hash -536779374, now seen corresponding path program 1 times [2022-11-25 15:27:10,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:27:10,569 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046605910] [2022-11-25 15:27:10,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:27:10,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:27:10,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:27:10,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-25 15:27:10,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:27:10,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-25 15:27:10,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:27:10,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-11-25 15:27:10,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:27:10,675 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-25 15:27:10,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:27:10,676 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046605910] [2022-11-25 15:27:10,676 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2046605910] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:27:10,676 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:27:10,676 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 15:27:10,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745946107] [2022-11-25 15:27:10,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:27:10,677 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 15:27:10,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:27:10,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 15:27:10,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 15:27:10,678 INFO L87 Difference]: Start difference. First operand 181 states and 265 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-25 15:27:10,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:27:10,723 INFO L93 Difference]: Finished difference Result 497 states and 738 transitions. [2022-11-25 15:27:10,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 15:27:10,724 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 55 [2022-11-25 15:27:10,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:27:10,727 INFO L225 Difference]: With dead ends: 497 [2022-11-25 15:27:10,727 INFO L226 Difference]: Without dead ends: 333 [2022-11-25 15:27:10,728 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 15:27:10,729 INFO L413 NwaCegarLoop]: 301 mSDtfsCounter, 213 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 554 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 15:27:10,729 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 554 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 15:27:10,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2022-11-25 15:27:10,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 327. [2022-11-25 15:27:10,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 327 states, 250 states have (on average 1.46) internal successors, (365), 251 states have internal predecessors, (365), 60 states have call successors, (60), 16 states have call predecessors, (60), 16 states have return successors, (60), 59 states have call predecessors, (60), 60 states have call successors, (60) [2022-11-25 15:27:10,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 485 transitions. [2022-11-25 15:27:10,773 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 485 transitions. Word has length 55 [2022-11-25 15:27:10,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:27:10,773 INFO L495 AbstractCegarLoop]: Abstraction has 327 states and 485 transitions. [2022-11-25 15:27:10,774 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-25 15:27:10,774 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 485 transitions. [2022-11-25 15:27:10,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-11-25 15:27:10,782 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:27:10,783 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-25 15:27:10,783 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-25 15:27:10,783 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 15:27:10,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:27:10,784 INFO L85 PathProgramCache]: Analyzing trace with hash -1864543556, now seen corresponding path program 1 times [2022-11-25 15:27:10,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:27:10,784 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526343955] [2022-11-25 15:27:10,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:27:10,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:27:10,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:27:10,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-25 15:27:10,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:27:10,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-25 15:27:10,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:27:10,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-25 15:27:10,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:27:10,892 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-25 15:27:10,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:27:10,892 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526343955] [2022-11-25 15:27:10,892 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1526343955] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:27:10,893 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:27:10,893 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 15:27:10,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569024503] [2022-11-25 15:27:10,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:27:10,894 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 15:27:10,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:27:10,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 15:27:10,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 15:27:10,895 INFO L87 Difference]: Start difference. First operand 327 states and 485 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-25 15:27:10,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:27:10,961 INFO L93 Difference]: Finished difference Result 920 states and 1376 transitions. [2022-11-25 15:27:10,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 15:27:10,962 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 56 [2022-11-25 15:27:10,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:27:10,967 INFO L225 Difference]: With dead ends: 920 [2022-11-25 15:27:10,967 INFO L226 Difference]: Without dead ends: 610 [2022-11-25 15:27:10,968 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 15:27:10,970 INFO L413 NwaCegarLoop]: 320 mSDtfsCounter, 215 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 575 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 15:27:10,970 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [215 Valid, 575 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 15:27:10,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2022-11-25 15:27:11,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 604. [2022-11-25 15:27:11,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 604 states, 455 states have (on average 1.4703296703296704) internal successors, (669), 458 states have internal predecessors, (669), 117 states have call successors, (117), 31 states have call predecessors, (117), 31 states have return successors, (117), 114 states have call predecessors, (117), 117 states have call successors, (117) [2022-11-25 15:27:11,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 604 states and 903 transitions. [2022-11-25 15:27:11,058 INFO L78 Accepts]: Start accepts. Automaton has 604 states and 903 transitions. Word has length 56 [2022-11-25 15:27:11,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:27:11,058 INFO L495 AbstractCegarLoop]: Abstraction has 604 states and 903 transitions. [2022-11-25 15:27:11,059 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-25 15:27:11,059 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 903 transitions. [2022-11-25 15:27:11,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-11-25 15:27:11,063 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:27:11,063 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-25 15:27:11,063 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-25 15:27:11,064 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 15:27:11,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:27:11,064 INFO L85 PathProgramCache]: Analyzing trace with hash 1150560062, now seen corresponding path program 1 times [2022-11-25 15:27:11,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:27:11,065 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578882465] [2022-11-25 15:27:11,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:27:11,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:27:11,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:27:11,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-25 15:27:11,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:27:11,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-25 15:27:11,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:27:11,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-25 15:27:11,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:27:11,215 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-25 15:27:11,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:27:11,216 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578882465] [2022-11-25 15:27:11,216 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [578882465] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:27:11,216 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:27:11,216 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 15:27:11,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042289522] [2022-11-25 15:27:11,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:27:11,218 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 15:27:11,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:27:11,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 15:27:11,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 15:27:11,220 INFO L87 Difference]: Start difference. First operand 604 states and 903 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-25 15:27:11,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:27:11,615 INFO L93 Difference]: Finished difference Result 1645 states and 2513 transitions. [2022-11-25 15:27:11,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 15:27:11,616 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 56 [2022-11-25 15:27:11,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:27:11,626 INFO L225 Difference]: With dead ends: 1645 [2022-11-25 15:27:11,626 INFO L226 Difference]: Without dead ends: 1058 [2022-11-25 15:27:11,628 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-11-25 15:27:11,629 INFO L413 NwaCegarLoop]: 247 mSDtfsCounter, 636 mSDsluCounter, 447 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 636 SdHoareTripleChecker+Valid, 694 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 15:27:11,630 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [636 Valid, 694 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 15:27:11,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1058 states. [2022-11-25 15:27:11,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1058 to 692. [2022-11-25 15:27:11,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 692 states, 530 states have (on average 1.4547169811320755) internal successors, (771), 533 states have internal predecessors, (771), 124 states have call successors, (124), 37 states have call predecessors, (124), 37 states have return successors, (124), 121 states have call predecessors, (124), 124 states have call successors, (124) [2022-11-25 15:27:11,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 692 states to 692 states and 1019 transitions. [2022-11-25 15:27:11,759 INFO L78 Accepts]: Start accepts. Automaton has 692 states and 1019 transitions. Word has length 56 [2022-11-25 15:27:11,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:27:11,761 INFO L495 AbstractCegarLoop]: Abstraction has 692 states and 1019 transitions. [2022-11-25 15:27:11,761 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-25 15:27:11,762 INFO L276 IsEmpty]: Start isEmpty. Operand 692 states and 1019 transitions. [2022-11-25 15:27:11,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-11-25 15:27:11,763 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:27:11,763 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-25 15:27:11,764 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-25 15:27:11,764 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 15:27:11,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:27:11,764 INFO L85 PathProgramCache]: Analyzing trace with hash 984808241, now seen corresponding path program 1 times [2022-11-25 15:27:11,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:27:11,766 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77431821] [2022-11-25 15:27:11,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:27:11,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:27:11,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:27:11,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-25 15:27:11,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:27:11,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-25 15:27:11,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:27:11,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-25 15:27:11,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:27:11,958 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-25 15:27:11,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:27:11,959 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77431821] [2022-11-25 15:27:11,959 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [77431821] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:27:11,959 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:27:11,959 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 15:27:11,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294891601] [2022-11-25 15:27:11,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:27:11,960 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 15:27:11,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:27:11,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 15:27:11,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 15:27:11,961 INFO L87 Difference]: Start difference. First operand 692 states and 1019 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-25 15:27:12,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:27:12,337 INFO L93 Difference]: Finished difference Result 1649 states and 2513 transitions. [2022-11-25 15:27:12,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 15:27:12,338 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 57 [2022-11-25 15:27:12,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:27:12,344 INFO L225 Difference]: With dead ends: 1649 [2022-11-25 15:27:12,344 INFO L226 Difference]: Without dead ends: 1062 [2022-11-25 15:27:12,346 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-11-25 15:27:12,347 INFO L413 NwaCegarLoop]: 247 mSDtfsCounter, 633 mSDsluCounter, 449 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 633 SdHoareTripleChecker+Valid, 696 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 15:27:12,348 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [633 Valid, 696 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 15:27:12,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1062 states. [2022-11-25 15:27:12,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1062 to 700. [2022-11-25 15:27:12,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 700 states, 538 states have (on average 1.4479553903345725) internal successors, (779), 541 states have internal predecessors, (779), 124 states have call successors, (124), 37 states have call predecessors, (124), 37 states have return successors, (124), 121 states have call predecessors, (124), 124 states have call successors, (124) [2022-11-25 15:27:12,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 700 states to 700 states and 1027 transitions. [2022-11-25 15:27:12,458 INFO L78 Accepts]: Start accepts. Automaton has 700 states and 1027 transitions. Word has length 57 [2022-11-25 15:27:12,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:27:12,459 INFO L495 AbstractCegarLoop]: Abstraction has 700 states and 1027 transitions. [2022-11-25 15:27:12,459 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-25 15:27:12,459 INFO L276 IsEmpty]: Start isEmpty. Operand 700 states and 1027 transitions. [2022-11-25 15:27:12,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-11-25 15:27:12,460 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:27:12,460 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-25 15:27:12,464 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-25 15:27:12,464 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 15:27:12,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:27:12,464 INFO L85 PathProgramCache]: Analyzing trace with hash 461948067, now seen corresponding path program 1 times [2022-11-25 15:27:12,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:27:12,465 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432480718] [2022-11-25 15:27:12,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:27:12,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:27:12,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:27:12,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-25 15:27:12,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:27:12,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-25 15:27:12,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:27:12,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-25 15:27:12,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:27:12,677 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-25 15:27:12,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:27:12,678 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432480718] [2022-11-25 15:27:12,678 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [432480718] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:27:12,678 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:27:12,678 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 15:27:12,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316079308] [2022-11-25 15:27:12,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:27:12,679 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 15:27:12,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:27:12,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 15:27:12,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 15:27:12,680 INFO L87 Difference]: Start difference. First operand 700 states and 1027 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-25 15:27:13,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:27:13,104 INFO L93 Difference]: Finished difference Result 1649 states and 2505 transitions. [2022-11-25 15:27:13,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 15:27:13,109 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 59 [2022-11-25 15:27:13,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:27:13,116 INFO L225 Difference]: With dead ends: 1649 [2022-11-25 15:27:13,117 INFO L226 Difference]: Without dead ends: 1062 [2022-11-25 15:27:13,119 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-25 15:27:13,120 INFO L413 NwaCegarLoop]: 273 mSDtfsCounter, 187 mSDsluCounter, 390 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 663 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 15:27:13,123 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [212 Valid, 663 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 15:27:13,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1062 states. [2022-11-25 15:27:13,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1062 to 700. [2022-11-25 15:27:13,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 700 states, 538 states have (on average 1.4405204460966543) internal successors, (775), 541 states have internal predecessors, (775), 124 states have call successors, (124), 37 states have call predecessors, (124), 37 states have return successors, (124), 121 states have call predecessors, (124), 124 states have call successors, (124) [2022-11-25 15:27:13,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 700 states to 700 states and 1023 transitions. [2022-11-25 15:27:13,236 INFO L78 Accepts]: Start accepts. Automaton has 700 states and 1023 transitions. Word has length 59 [2022-11-25 15:27:13,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:27:13,236 INFO L495 AbstractCegarLoop]: Abstraction has 700 states and 1023 transitions. [2022-11-25 15:27:13,237 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-25 15:27:13,237 INFO L276 IsEmpty]: Start isEmpty. Operand 700 states and 1023 transitions. [2022-11-25 15:27:13,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-11-25 15:27:13,238 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:27:13,238 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-25 15:27:13,238 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-25 15:27:13,238 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 15:27:13,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:27:13,239 INFO L85 PathProgramCache]: Analyzing trace with hash -1405034612, now seen corresponding path program 1 times [2022-11-25 15:27:13,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:27:13,239 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494021636] [2022-11-25 15:27:13,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:27:13,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:27:13,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:27:13,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-25 15:27:13,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:27:13,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-25 15:27:13,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:27:13,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-11-25 15:27:13,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:27:13,452 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-25 15:27:13,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:27:13,453 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494021636] [2022-11-25 15:27:13,453 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1494021636] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:27:13,453 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:27:13,453 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 15:27:13,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924093988] [2022-11-25 15:27:13,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:27:13,455 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 15:27:13,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:27:13,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 15:27:13,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 15:27:13,456 INFO L87 Difference]: Start difference. First operand 700 states and 1023 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 3 states have internal predecessors, (49), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-25 15:27:13,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:27:13,568 INFO L93 Difference]: Finished difference Result 1307 states and 1936 transitions. [2022-11-25 15:27:13,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 15:27:13,568 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 3 states have internal predecessors, (49), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 60 [2022-11-25 15:27:13,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:27:13,573 INFO L225 Difference]: With dead ends: 1307 [2022-11-25 15:27:13,573 INFO L226 Difference]: Without dead ends: 720 [2022-11-25 15:27:13,578 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-25 15:27:13,580 INFO L413 NwaCegarLoop]: 258 mSDtfsCounter, 6 mSDsluCounter, 512 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 770 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 15:27:13,581 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 770 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 15:27:13,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 720 states. [2022-11-25 15:27:13,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 720 to 720. [2022-11-25 15:27:13,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 720 states, 554 states have (on average 1.4277978339350181) internal successors, (791), 557 states have internal predecessors, (791), 124 states have call successors, (124), 41 states have call predecessors, (124), 41 states have return successors, (124), 121 states have call predecessors, (124), 124 states have call successors, (124) [2022-11-25 15:27:13,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 720 states to 720 states and 1039 transitions. [2022-11-25 15:27:13,701 INFO L78 Accepts]: Start accepts. Automaton has 720 states and 1039 transitions. Word has length 60 [2022-11-25 15:27:13,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:27:13,702 INFO L495 AbstractCegarLoop]: Abstraction has 720 states and 1039 transitions. [2022-11-25 15:27:13,702 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 3 states have internal predecessors, (49), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-25 15:27:13,702 INFO L276 IsEmpty]: Start isEmpty. Operand 720 states and 1039 transitions. [2022-11-25 15:27:13,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-11-25 15:27:13,704 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:27:13,704 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-25 15:27:13,704 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-25 15:27:13,705 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 15:27:13,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:27:13,705 INFO L85 PathProgramCache]: Analyzing trace with hash -829990638, now seen corresponding path program 1 times [2022-11-25 15:27:13,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:27:13,706 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230430834] [2022-11-25 15:27:13,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:27:13,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:27:13,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:27:13,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-25 15:27:13,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:27:13,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-25 15:27:13,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:27:13,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-11-25 15:27:13,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:27:13,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-25 15:27:13,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:27:13,924 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-25 15:27:13,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:27:13,927 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230430834] [2022-11-25 15:27:13,927 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [230430834] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:27:13,927 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:27:13,927 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 15:27:13,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939993618] [2022-11-25 15:27:13,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:27:13,928 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 15:27:13,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:27:13,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 15:27:13,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 15:27:13,931 INFO L87 Difference]: Start difference. First operand 720 states and 1039 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 3 states have internal predecessors, (55), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-25 15:27:14,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:27:14,059 INFO L93 Difference]: Finished difference Result 1347 states and 1980 transitions. [2022-11-25 15:27:14,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 15:27:14,060 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 3 states have internal predecessors, (55), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 68 [2022-11-25 15:27:14,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:27:14,064 INFO L225 Difference]: With dead ends: 1347 [2022-11-25 15:27:14,064 INFO L226 Difference]: Without dead ends: 740 [2022-11-25 15:27:14,067 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-25 15:27:14,067 INFO L413 NwaCegarLoop]: 255 mSDtfsCounter, 6 mSDsluCounter, 501 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 756 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 15:27:14,069 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 756 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 15:27:14,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 740 states. [2022-11-25 15:27:14,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 740 to 740. [2022-11-25 15:27:14,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 740 states, 570 states have (on average 1.4157894736842105) internal successors, (807), 573 states have internal predecessors, (807), 124 states have call successors, (124), 45 states have call predecessors, (124), 45 states have return successors, (124), 121 states have call predecessors, (124), 124 states have call successors, (124) [2022-11-25 15:27:14,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 740 states to 740 states and 1055 transitions. [2022-11-25 15:27:14,175 INFO L78 Accepts]: Start accepts. Automaton has 740 states and 1055 transitions. Word has length 68 [2022-11-25 15:27:14,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:27:14,175 INFO L495 AbstractCegarLoop]: Abstraction has 740 states and 1055 transitions. [2022-11-25 15:27:14,175 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 3 states have internal predecessors, (55), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-25 15:27:14,176 INFO L276 IsEmpty]: Start isEmpty. Operand 740 states and 1055 transitions. [2022-11-25 15:27:14,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-11-25 15:27:14,177 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:27:14,178 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-25 15:27:14,178 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-25 15:27:14,178 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 15:27:14,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:27:14,179 INFO L85 PathProgramCache]: Analyzing trace with hash 102970172, now seen corresponding path program 1 times [2022-11-25 15:27:14,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:27:14,179 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127754115] [2022-11-25 15:27:14,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:27:14,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:27:14,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:27:14,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-25 15:27:14,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:27:14,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-25 15:27:14,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:27:14,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-11-25 15:27:14,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:27:14,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-25 15:27:14,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:27:14,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-11-25 15:27:14,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:27:14,342 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-25 15:27:14,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:27:14,343 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127754115] [2022-11-25 15:27:14,343 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [127754115] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:27:14,343 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:27:14,343 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 15:27:14,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322216080] [2022-11-25 15:27:14,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:27:14,344 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 15:27:14,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:27:14,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 15:27:14,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 15:27:14,345 INFO L87 Difference]: Start difference. First operand 740 states and 1055 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 3 states have internal predecessors, (61), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-11-25 15:27:14,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:27:14,455 INFO L93 Difference]: Finished difference Result 1383 states and 1996 transitions. [2022-11-25 15:27:14,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 15:27:14,456 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 3 states have internal predecessors, (61), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 76 [2022-11-25 15:27:14,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:27:14,460 INFO L225 Difference]: With dead ends: 1383 [2022-11-25 15:27:14,460 INFO L226 Difference]: Without dead ends: 756 [2022-11-25 15:27:14,462 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-25 15:27:14,463 INFO L413 NwaCegarLoop]: 260 mSDtfsCounter, 5 mSDsluCounter, 505 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 765 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 15:27:14,464 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 765 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 15:27:14,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 756 states. [2022-11-25 15:27:14,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 756 to 756. [2022-11-25 15:27:14,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 756 states, 582 states have (on average 1.407216494845361) internal successors, (819), 585 states have internal predecessors, (819), 124 states have call successors, (124), 49 states have call predecessors, (124), 49 states have return successors, (124), 121 states have call predecessors, (124), 124 states have call successors, (124) [2022-11-25 15:27:14,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 756 states to 756 states and 1067 transitions. [2022-11-25 15:27:14,538 INFO L78 Accepts]: Start accepts. Automaton has 756 states and 1067 transitions. Word has length 76 [2022-11-25 15:27:14,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:27:14,538 INFO L495 AbstractCegarLoop]: Abstraction has 756 states and 1067 transitions. [2022-11-25 15:27:14,539 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 3 states have internal predecessors, (61), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-11-25 15:27:14,539 INFO L276 IsEmpty]: Start isEmpty. Operand 756 states and 1067 transitions. [2022-11-25 15:27:14,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-11-25 15:27:14,541 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:27:14,541 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-25 15:27:14,541 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-25 15:27:14,541 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 15:27:14,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:27:14,542 INFO L85 PathProgramCache]: Analyzing trace with hash -1795537821, now seen corresponding path program 1 times [2022-11-25 15:27:14,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:27:14,542 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048295801] [2022-11-25 15:27:14,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:27:14,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:27:14,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:27:14,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-25 15:27:14,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:27:14,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-25 15:27:14,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:27:14,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-11-25 15:27:14,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:27:14,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-25 15:27:14,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:27:14,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-11-25 15:27:14,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:27:14,775 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-25 15:27:14,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:27:14,775 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048295801] [2022-11-25 15:27:14,775 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2048295801] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:27:14,776 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:27:14,776 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 15:27:14,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212526134] [2022-11-25 15:27:14,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:27:14,777 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 15:27:14,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:27:14,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 15:27:14,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 15:27:14,778 INFO L87 Difference]: Start difference. First operand 756 states and 1067 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 3 states have internal predecessors, (61), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-11-25 15:27:14,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:27:14,919 INFO L93 Difference]: Finished difference Result 1419 states and 2036 transitions. [2022-11-25 15:27:14,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 15:27:14,920 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 3 states have internal predecessors, (61), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 76 [2022-11-25 15:27:14,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:27:14,924 INFO L225 Difference]: With dead ends: 1419 [2022-11-25 15:27:14,925 INFO L226 Difference]: Without dead ends: 776 [2022-11-25 15:27:14,927 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-25 15:27:14,927 INFO L413 NwaCegarLoop]: 255 mSDtfsCounter, 6 mSDsluCounter, 501 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 756 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 15:27:14,928 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 756 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 15:27:14,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 776 states. [2022-11-25 15:27:15,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 776 to 776. [2022-11-25 15:27:15,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 776 states, 598 states have (on average 1.3963210702341138) internal successors, (835), 601 states have internal predecessors, (835), 124 states have call successors, (124), 53 states have call predecessors, (124), 53 states have return successors, (124), 121 states have call predecessors, (124), 124 states have call successors, (124) [2022-11-25 15:27:15,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 1083 transitions. [2022-11-25 15:27:15,009 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 1083 transitions. Word has length 76 [2022-11-25 15:27:15,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:27:15,010 INFO L495 AbstractCegarLoop]: Abstraction has 776 states and 1083 transitions. [2022-11-25 15:27:15,010 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 3 states have internal predecessors, (61), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-11-25 15:27:15,010 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 1083 transitions. [2022-11-25 15:27:15,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-11-25 15:27:15,013 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:27:15,013 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:27:15,013 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-25 15:27:15,013 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 15:27:15,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:27:15,015 INFO L85 PathProgramCache]: Analyzing trace with hash 1351818595, now seen corresponding path program 1 times [2022-11-25 15:27:15,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:27:15,015 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695722232] [2022-11-25 15:27:15,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:27:15,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:27:15,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:27:15,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-25 15:27:15,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:27:15,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-25 15:27:15,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:27:15,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-11-25 15:27:15,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:27:15,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-25 15:27:15,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:27:15,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-11-25 15:27:15,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:27:15,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-11-25 15:27:15,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:27:15,272 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-25 15:27:15,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:27:15,273 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695722232] [2022-11-25 15:27:15,273 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [695722232] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:27:15,273 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:27:15,273 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 15:27:15,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567090106] [2022-11-25 15:27:15,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:27:15,274 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 15:27:15,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:27:15,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 15:27:15,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 15:27:15,276 INFO L87 Difference]: Start difference. First operand 776 states and 1083 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 2 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-11-25 15:27:15,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:27:15,393 INFO L93 Difference]: Finished difference Result 1463 states and 2064 transitions. [2022-11-25 15:27:15,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 15:27:15,394 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 2 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 84 [2022-11-25 15:27:15,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:27:15,400 INFO L225 Difference]: With dead ends: 1463 [2022-11-25 15:27:15,400 INFO L226 Difference]: Without dead ends: 800 [2022-11-25 15:27:15,402 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-25 15:27:15,403 INFO L413 NwaCegarLoop]: 259 mSDtfsCounter, 7 mSDsluCounter, 508 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 767 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 15:27:15,403 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 767 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 15:27:15,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 800 states. [2022-11-25 15:27:15,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 800 to 800. [2022-11-25 15:27:15,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 800 states, 618 states have (on average 1.383495145631068) internal successors, (855), 621 states have internal predecessors, (855), 124 states have call successors, (124), 57 states have call predecessors, (124), 57 states have return successors, (124), 121 states have call predecessors, (124), 124 states have call successors, (124) [2022-11-25 15:27:15,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 800 states to 800 states and 1103 transitions. [2022-11-25 15:27:15,497 INFO L78 Accepts]: Start accepts. Automaton has 800 states and 1103 transitions. Word has length 84 [2022-11-25 15:27:15,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:27:15,497 INFO L495 AbstractCegarLoop]: Abstraction has 800 states and 1103 transitions. [2022-11-25 15:27:15,497 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 2 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-11-25 15:27:15,497 INFO L276 IsEmpty]: Start isEmpty. Operand 800 states and 1103 transitions. [2022-11-25 15:27:15,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-11-25 15:27:15,500 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:27:15,501 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-25 15:27:15,501 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-25 15:27:15,501 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 15:27:15,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:27:15,502 INFO L85 PathProgramCache]: Analyzing trace with hash 938140804, now seen corresponding path program 1 times [2022-11-25 15:27:15,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:27:15,502 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822556571] [2022-11-25 15:27:15,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:27:15,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:27:15,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:27:15,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-25 15:27:15,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:27:15,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-25 15:27:15,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:27:15,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-11-25 15:27:15,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:27:15,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-25 15:27:15,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:27:15,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-11-25 15:27:15,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:27:15,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-11-25 15:27:15,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:27:15,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-11-25 15:27:15,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:27:15,834 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-25 15:27:15,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:27:15,835 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822556571] [2022-11-25 15:27:15,835 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1822556571] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:27:15,835 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:27:15,835 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-25 15:27:15,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746162338] [2022-11-25 15:27:15,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:27:15,836 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 15:27:15,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:27:15,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 15:27:15,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-25 15:27:15,837 INFO L87 Difference]: Start difference. First operand 800 states and 1103 transitions. Second operand has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 6 states have internal predecessors, (66), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2022-11-25 15:27:16,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:27:16,254 INFO L93 Difference]: Finished difference Result 2323 states and 3253 transitions. [2022-11-25 15:27:16,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-25 15:27:16,255 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 6 states have internal predecessors, (66), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) Word has length 87 [2022-11-25 15:27:16,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:27:16,262 INFO L225 Difference]: With dead ends: 2323 [2022-11-25 15:27:16,263 INFO L226 Difference]: Without dead ends: 1636 [2022-11-25 15:27:16,265 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-11-25 15:27:16,266 INFO L413 NwaCegarLoop]: 351 mSDtfsCounter, 327 mSDsluCounter, 1580 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 345 SdHoareTripleChecker+Valid, 1931 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 15:27:16,266 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [345 Valid, 1931 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 15:27:16,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1636 states. [2022-11-25 15:27:16,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1636 to 1084. [2022-11-25 15:27:16,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1084 states, 829 states have (on average 1.3715319662243668) internal successors, (1137), 834 states have internal predecessors, (1137), 172 states have call successors, (172), 82 states have call predecessors, (172), 82 states have return successors, (172), 167 states have call predecessors, (172), 172 states have call successors, (172) [2022-11-25 15:27:16,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1084 states to 1084 states and 1481 transitions. [2022-11-25 15:27:16,427 INFO L78 Accepts]: Start accepts. Automaton has 1084 states and 1481 transitions. Word has length 87 [2022-11-25 15:27:16,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:27:16,427 INFO L495 AbstractCegarLoop]: Abstraction has 1084 states and 1481 transitions. [2022-11-25 15:27:16,427 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 6 states have internal predecessors, (66), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2022-11-25 15:27:16,428 INFO L276 IsEmpty]: Start isEmpty. Operand 1084 states and 1481 transitions. [2022-11-25 15:27:16,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-11-25 15:27:16,429 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:27:16,429 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-25 15:27:16,429 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-25 15:27:16,430 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 15:27:16,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:27:16,430 INFO L85 PathProgramCache]: Analyzing trace with hash -262931398, now seen corresponding path program 1 times [2022-11-25 15:27:16,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:27:16,430 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922918805] [2022-11-25 15:27:16,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:27:16,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:27:16,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:27:16,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-25 15:27:16,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:27:16,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-25 15:27:16,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:27:16,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-11-25 15:27:16,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:27:16,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-25 15:27:16,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:27:16,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-11-25 15:27:16,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:27:16,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-11-25 15:27:16,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:27:16,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-11-25 15:27:16,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:27:16,596 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-25 15:27:16,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:27:16,596 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922918805] [2022-11-25 15:27:16,596 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1922918805] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:27:16,596 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:27:16,597 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 15:27:16,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247850337] [2022-11-25 15:27:16,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:27:16,597 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 15:27:16,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:27:16,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 15:27:16,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 15:27:16,599 INFO L87 Difference]: Start difference. First operand 1084 states and 1481 transitions. Second operand has 4 states, 4 states have (on average 17.5) internal successors, (70), 3 states have internal predecessors, (70), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-11-25 15:27:16,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:27:16,737 INFO L93 Difference]: Finished difference Result 2011 states and 2772 transitions. [2022-11-25 15:27:16,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 15:27:16,738 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 3 states have internal predecessors, (70), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 91 [2022-11-25 15:27:16,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:27:16,743 INFO L225 Difference]: With dead ends: 2011 [2022-11-25 15:27:16,743 INFO L226 Difference]: Without dead ends: 1108 [2022-11-25 15:27:16,746 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-25 15:27:16,746 INFO L413 NwaCegarLoop]: 260 mSDtfsCounter, 5 mSDsluCounter, 505 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 765 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 15:27:16,747 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 765 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 15:27:16,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1108 states. [2022-11-25 15:27:16,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1108 to 1108. [2022-11-25 15:27:16,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1108 states, 847 states have (on average 1.3636363636363635) internal successors, (1155), 852 states have internal predecessors, (1155), 172 states have call successors, (172), 88 states have call predecessors, (172), 88 states have return successors, (172), 167 states have call predecessors, (172), 172 states have call successors, (172) [2022-11-25 15:27:16,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1108 states to 1108 states and 1499 transitions. [2022-11-25 15:27:16,922 INFO L78 Accepts]: Start accepts. Automaton has 1108 states and 1499 transitions. Word has length 91 [2022-11-25 15:27:16,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:27:16,923 INFO L495 AbstractCegarLoop]: Abstraction has 1108 states and 1499 transitions. [2022-11-25 15:27:16,923 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 3 states have internal predecessors, (70), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-11-25 15:27:16,924 INFO L276 IsEmpty]: Start isEmpty. Operand 1108 states and 1499 transitions. [2022-11-25 15:27:16,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2022-11-25 15:27:16,928 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:27:16,929 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:27:16,929 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-25 15:27:16,929 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 15:27:16,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:27:16,930 INFO L85 PathProgramCache]: Analyzing trace with hash -1171844932, now seen corresponding path program 1 times [2022-11-25 15:27:16,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:27:16,930 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458065713] [2022-11-25 15:27:16,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:27:16,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:27:16,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:27:17,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-25 15:27:17,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:27:17,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-25 15:27:17,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:27:17,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-11-25 15:27:17,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:27:17,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-25 15:27:17,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:27:17,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-11-25 15:27:17,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:27:17,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-11-25 15:27:17,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:27:17,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-11-25 15:27:17,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:27:17,220 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-11-25 15:27:17,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:27:17,221 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458065713] [2022-11-25 15:27:17,221 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1458065713] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:27:17,221 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:27:17,221 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-25 15:27:17,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791922016] [2022-11-25 15:27:17,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:27:17,222 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-25 15:27:17,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:27:17,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-25 15:27:17,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-25 15:27:17,223 INFO L87 Difference]: Start difference. First operand 1108 states and 1499 transitions. Second operand has 8 states, 6 states have (on average 11.0) internal successors, (66), 7 states have internal predecessors, (66), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) [2022-11-25 15:27:17,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:27:17,586 INFO L93 Difference]: Finished difference Result 1540 states and 2191 transitions. [2022-11-25 15:27:17,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-25 15:27:17,587 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 11.0) internal successors, (66), 7 states have internal predecessors, (66), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) Word has length 90 [2022-11-25 15:27:17,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:27:17,594 INFO L225 Difference]: With dead ends: 1540 [2022-11-25 15:27:17,594 INFO L226 Difference]: Without dead ends: 1538 [2022-11-25 15:27:17,595 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2022-11-25 15:27:17,595 INFO L413 NwaCegarLoop]: 448 mSDtfsCounter, 332 mSDsluCounter, 2090 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 358 SdHoareTripleChecker+Valid, 2538 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 15:27:17,596 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [358 Valid, 2538 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 15:27:17,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1538 states. [2022-11-25 15:27:17,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1538 to 1116. [2022-11-25 15:27:17,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1116 states, 851 states have (on average 1.3619271445358403) internal successors, (1159), 858 states have internal predecessors, (1159), 174 states have call successors, (174), 90 states have call predecessors, (174), 90 states have return successors, (174), 167 states have call predecessors, (174), 174 states have call successors, (174) [2022-11-25 15:27:17,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1116 states to 1116 states and 1507 transitions. [2022-11-25 15:27:17,731 INFO L78 Accepts]: Start accepts. Automaton has 1116 states and 1507 transitions. Word has length 90 [2022-11-25 15:27:17,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:27:17,732 INFO L495 AbstractCegarLoop]: Abstraction has 1116 states and 1507 transitions. [2022-11-25 15:27:17,732 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 11.0) internal successors, (66), 7 states have internal predecessors, (66), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) [2022-11-25 15:27:17,732 INFO L276 IsEmpty]: Start isEmpty. Operand 1116 states and 1507 transitions. [2022-11-25 15:27:17,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-11-25 15:27:17,733 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:27:17,734 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:27:17,734 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-25 15:27:17,734 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 15:27:17,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:27:17,735 INFO L85 PathProgramCache]: Analyzing trace with hash 1049695796, now seen corresponding path program 1 times [2022-11-25 15:27:17,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:27:17,735 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921367308] [2022-11-25 15:27:17,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:27:17,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:27:17,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:27:17,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-25 15:27:17,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:27:17,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-25 15:27:17,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:27:17,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-11-25 15:27:17,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:27:17,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-25 15:27:17,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:27:17,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-11-25 15:27:17,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:27:17,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-11-25 15:27:17,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:27:17,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-11-25 15:27:17,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:27:17,894 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-11-25 15:27:17,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:27:17,894 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921367308] [2022-11-25 15:27:17,894 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [921367308] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:27:17,895 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:27:17,895 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-25 15:27:17,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654895238] [2022-11-25 15:27:17,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:27:17,896 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 15:27:17,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:27:17,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 15:27:17,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-25 15:27:17,897 INFO L87 Difference]: Start difference. First operand 1116 states and 1507 transitions. Second operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 6 states have internal predecessors, (69), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-11-25 15:27:18,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:27:18,268 INFO L93 Difference]: Finished difference Result 2214 states and 3052 transitions. [2022-11-25 15:27:18,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-25 15:27:18,269 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 6 states have internal predecessors, (69), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 93 [2022-11-25 15:27:18,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:27:18,275 INFO L225 Difference]: With dead ends: 2214 [2022-11-25 15:27:18,275 INFO L226 Difference]: Without dead ends: 1361 [2022-11-25 15:27:18,277 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-11-25 15:27:18,278 INFO L413 NwaCegarLoop]: 344 mSDtfsCounter, 374 mSDsluCounter, 1557 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 379 SdHoareTripleChecker+Valid, 1901 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 15:27:18,278 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [379 Valid, 1901 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 15:27:18,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1361 states. [2022-11-25 15:27:18,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1361 to 1121. [2022-11-25 15:27:18,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1121 states, 867 states have (on average 1.3517877739331026) internal successors, (1172), 879 states have internal predecessors, (1172), 162 states have call successors, (162), 91 states have call predecessors, (162), 91 states have return successors, (162), 150 states have call predecessors, (162), 162 states have call successors, (162) [2022-11-25 15:27:18,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1121 states to 1121 states and 1496 transitions. [2022-11-25 15:27:18,423 INFO L78 Accepts]: Start accepts. Automaton has 1121 states and 1496 transitions. Word has length 93 [2022-11-25 15:27:18,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:27:18,424 INFO L495 AbstractCegarLoop]: Abstraction has 1121 states and 1496 transitions. [2022-11-25 15:27:18,424 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 6 states have internal predecessors, (69), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-11-25 15:27:18,424 INFO L276 IsEmpty]: Start isEmpty. Operand 1121 states and 1496 transitions. [2022-11-25 15:27:18,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2022-11-25 15:27:18,426 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:27:18,426 INFO L195 NwaCegarLoop]: 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] [2022-11-25 15:27:18,426 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-25 15:27:18,426 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 15:27:18,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:27:18,427 INFO L85 PathProgramCache]: Analyzing trace with hash 82901354, now seen corresponding path program 1 times [2022-11-25 15:27:18,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:27:18,427 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2808405] [2022-11-25 15:27:18,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:27:18,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:27:18,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:27:18,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-25 15:27:18,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:27:18,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-25 15:27:18,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:27:18,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-11-25 15:27:18,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:27:18,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-25 15:27:18,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:27:18,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-11-25 15:27:18,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:27:18,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-11-25 15:27:18,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:27:18,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-11-25 15:27:18,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:27:18,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-11-25 15:27:18,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:27:18,715 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-11-25 15:27:18,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:27:18,715 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2808405] [2022-11-25 15:27:18,716 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2808405] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:27:18,716 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:27:18,716 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-25 15:27:18,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349213622] [2022-11-25 15:27:18,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:27:18,717 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 15:27:18,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:27:18,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 15:27:18,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-25 15:27:18,718 INFO L87 Difference]: Start difference. First operand 1121 states and 1496 transitions. Second operand has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 6 states have internal predecessors, (68), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2022-11-25 15:27:19,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:27:19,112 INFO L93 Difference]: Finished difference Result 2267 states and 3109 transitions. [2022-11-25 15:27:19,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-25 15:27:19,113 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 6 states have internal predecessors, (68), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) Word has length 95 [2022-11-25 15:27:19,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:27:19,119 INFO L225 Difference]: With dead ends: 2267 [2022-11-25 15:27:19,119 INFO L226 Difference]: Without dead ends: 1389 [2022-11-25 15:27:19,122 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-11-25 15:27:19,122 INFO L413 NwaCegarLoop]: 374 mSDtfsCounter, 289 mSDsluCounter, 1677 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 303 SdHoareTripleChecker+Valid, 2051 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 15:27:19,123 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [303 Valid, 2051 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 15:27:19,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1389 states. [2022-11-25 15:27:19,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1389 to 1011. [2022-11-25 15:27:19,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1011 states, 784 states have (on average 1.3545918367346939) internal successors, (1062), 794 states have internal predecessors, (1062), 145 states have call successors, (145), 81 states have call predecessors, (145), 81 states have return successors, (145), 135 states have call predecessors, (145), 145 states have call successors, (145) [2022-11-25 15:27:19,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1011 states to 1011 states and 1352 transitions. [2022-11-25 15:27:19,340 INFO L78 Accepts]: Start accepts. Automaton has 1011 states and 1352 transitions. Word has length 95 [2022-11-25 15:27:19,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:27:19,341 INFO L495 AbstractCegarLoop]: Abstraction has 1011 states and 1352 transitions. [2022-11-25 15:27:19,341 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 6 states have internal predecessors, (68), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2022-11-25 15:27:19,341 INFO L276 IsEmpty]: Start isEmpty. Operand 1011 states and 1352 transitions. [2022-11-25 15:27:19,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-11-25 15:27:19,343 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:27:19,343 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-25 15:27:19,343 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-25 15:27:19,344 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 15:27:19,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:27:19,344 INFO L85 PathProgramCache]: Analyzing trace with hash -914641030, now seen corresponding path program 1 times [2022-11-25 15:27:19,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:27:19,345 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861185571] [2022-11-25 15:27:19,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:27:19,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:27:19,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:27:19,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-25 15:27:19,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:27:19,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-25 15:27:19,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:27:19,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-11-25 15:27:19,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:27:19,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-25 15:27:19,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:27:19,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-11-25 15:27:19,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:27:19,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-11-25 15:27:19,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:27:19,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-11-25 15:27:19,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:27:19,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-11-25 15:27:19,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:27:19,653 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-25 15:27:19,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:27:19,653 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861185571] [2022-11-25 15:27:19,654 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861185571] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:27:19,654 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:27:19,654 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-25 15:27:19,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133596675] [2022-11-25 15:27:19,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:27:19,655 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-25 15:27:19,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:27:19,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-25 15:27:19,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-25 15:27:19,656 INFO L87 Difference]: Start difference. First operand 1011 states and 1352 transitions. Second operand has 8 states, 8 states have (on average 9.125) internal successors, (73), 7 states have internal predecessors, (73), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2022-11-25 15:27:20,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:27:20,634 INFO L93 Difference]: Finished difference Result 2326 states and 3198 transitions. [2022-11-25 15:27:20,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-25 15:27:20,635 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.125) internal successors, (73), 7 states have internal predecessors, (73), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Word has length 96 [2022-11-25 15:27:20,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:27:20,643 INFO L225 Difference]: With dead ends: 2326 [2022-11-25 15:27:20,643 INFO L226 Difference]: Without dead ends: 1478 [2022-11-25 15:27:20,645 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2022-11-25 15:27:20,646 INFO L413 NwaCegarLoop]: 429 mSDtfsCounter, 773 mSDsluCounter, 1382 mSDsCounter, 0 mSdLazyCounter, 394 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 779 SdHoareTripleChecker+Valid, 1811 SdHoareTripleChecker+Invalid, 515 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 394 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-25 15:27:20,646 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [779 Valid, 1811 Invalid, 515 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 394 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-25 15:27:20,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1478 states. [2022-11-25 15:27:20,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1478 to 1027. [2022-11-25 15:27:20,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1027 states, 792 states have (on average 1.332070707070707) internal successors, (1055), 803 states have internal predecessors, (1055), 148 states have call successors, (148), 86 states have call predecessors, (148), 86 states have return successors, (148), 137 states have call predecessors, (148), 148 states have call successors, (148) [2022-11-25 15:27:20,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1027 states to 1027 states and 1351 transitions. [2022-11-25 15:27:20,828 INFO L78 Accepts]: Start accepts. Automaton has 1027 states and 1351 transitions. Word has length 96 [2022-11-25 15:27:20,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:27:20,829 INFO L495 AbstractCegarLoop]: Abstraction has 1027 states and 1351 transitions. [2022-11-25 15:27:20,829 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.125) internal successors, (73), 7 states have internal predecessors, (73), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2022-11-25 15:27:20,829 INFO L276 IsEmpty]: Start isEmpty. Operand 1027 states and 1351 transitions. [2022-11-25 15:27:20,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-11-25 15:27:20,831 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:27:20,831 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-25 15:27:20,831 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-25 15:27:20,832 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 15:27:20,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:27:20,832 INFO L85 PathProgramCache]: Analyzing trace with hash 1010886925, now seen corresponding path program 1 times [2022-11-25 15:27:20,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:27:20,833 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018225730] [2022-11-25 15:27:20,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:27:20,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:27:20,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:27:20,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-25 15:27:20,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:27:20,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-25 15:27:20,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:27:20,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-25 15:27:20,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:27:20,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-11-25 15:27:20,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:27:20,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-11-25 15:27:20,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:27:20,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-11-25 15:27:20,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:27:20,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-11-25 15:27:20,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:27:20,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-11-25 15:27:20,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:27:20,952 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-25 15:27:20,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:27:20,952 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018225730] [2022-11-25 15:27:20,953 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2018225730] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:27:20,953 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:27:20,953 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 15:27:20,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658187883] [2022-11-25 15:27:20,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:27:20,954 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 15:27:20,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:27:20,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 15:27:20,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 15:27:20,955 INFO L87 Difference]: Start difference. First operand 1027 states and 1351 transitions. Second operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-11-25 15:27:21,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:27:21,465 INFO L93 Difference]: Finished difference Result 2890 states and 3877 transitions. [2022-11-25 15:27:21,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 15:27:21,466 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 97 [2022-11-25 15:27:21,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:27:21,476 INFO L225 Difference]: With dead ends: 2890 [2022-11-25 15:27:21,476 INFO L226 Difference]: Without dead ends: 2077 [2022-11-25 15:27:21,479 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-25 15:27:21,480 INFO L413 NwaCegarLoop]: 455 mSDtfsCounter, 375 mSDsluCounter, 646 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 375 SdHoareTripleChecker+Valid, 1101 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 15:27:21,480 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [375 Valid, 1101 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 15:27:21,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2077 states. [2022-11-25 15:27:21,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2077 to 1772. [2022-11-25 15:27:21,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1772 states, 1347 states have (on average 1.325909428359317) internal successors, (1786), 1366 states have internal predecessors, (1786), 272 states have call successors, (272), 152 states have call predecessors, (272), 152 states have return successors, (272), 253 states have call predecessors, (272), 272 states have call successors, (272) [2022-11-25 15:27:21,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1772 states to 1772 states and 2330 transitions. [2022-11-25 15:27:21,796 INFO L78 Accepts]: Start accepts. Automaton has 1772 states and 2330 transitions. Word has length 97 [2022-11-25 15:27:21,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:27:21,797 INFO L495 AbstractCegarLoop]: Abstraction has 1772 states and 2330 transitions. [2022-11-25 15:27:21,797 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-11-25 15:27:21,797 INFO L276 IsEmpty]: Start isEmpty. Operand 1772 states and 2330 transitions. [2022-11-25 15:27:21,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-11-25 15:27:21,799 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:27:21,799 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-25 15:27:21,800 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-25 15:27:21,800 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 15:27:21,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:27:21,800 INFO L85 PathProgramCache]: Analyzing trace with hash 1421619842, now seen corresponding path program 1 times [2022-11-25 15:27:21,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:27:21,801 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192129613] [2022-11-25 15:27:21,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:27:21,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:27:21,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:27:22,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-25 15:27:22,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:27:22,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-25 15:27:22,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:27:22,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-25 15:27:22,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:27:22,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-11-25 15:27:22,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:27:22,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-11-25 15:27:22,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:27:22,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-11-25 15:27:22,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:27:22,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-11-25 15:27:22,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:27:22,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-11-25 15:27:22,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:27:22,152 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-25 15:27:22,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:27:22,152 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192129613] [2022-11-25 15:27:22,152 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1192129613] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:27:22,153 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:27:22,153 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-25 15:27:22,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008246752] [2022-11-25 15:27:22,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:27:22,155 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 15:27:22,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:27:22,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 15:27:22,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-25 15:27:22,156 INFO L87 Difference]: Start difference. First operand 1772 states and 2330 transitions. Second operand has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 6 states have internal predecessors, (76), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2022-11-25 15:27:23,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:27:23,443 INFO L93 Difference]: Finished difference Result 3933 states and 5306 transitions. [2022-11-25 15:27:23,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-25 15:27:23,444 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 6 states have internal predecessors, (76), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) Word has length 99 [2022-11-25 15:27:23,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:27:23,456 INFO L225 Difference]: With dead ends: 3933 [2022-11-25 15:27:23,456 INFO L226 Difference]: Without dead ends: 2457 [2022-11-25 15:27:23,460 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2022-11-25 15:27:23,462 INFO L413 NwaCegarLoop]: 470 mSDtfsCounter, 702 mSDsluCounter, 1554 mSDsCounter, 0 mSdLazyCounter, 397 mSolverCounterSat, 195 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 705 SdHoareTripleChecker+Valid, 2024 SdHoareTripleChecker+Invalid, 592 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 195 IncrementalHoareTripleChecker+Valid, 397 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-25 15:27:23,463 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [705 Valid, 2024 Invalid, 592 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [195 Valid, 397 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-25 15:27:23,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2457 states. [2022-11-25 15:27:23,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2457 to 1797. [2022-11-25 15:27:23,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1797 states, 1359 states have (on average 1.3200883002207506) internal successors, (1794), 1379 states have internal predecessors, (1794), 280 states have call successors, (280), 157 states have call predecessors, (280), 157 states have return successors, (280), 260 states have call predecessors, (280), 280 states have call successors, (280) [2022-11-25 15:27:23,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1797 states to 1797 states and 2354 transitions. [2022-11-25 15:27:23,838 INFO L78 Accepts]: Start accepts. Automaton has 1797 states and 2354 transitions. Word has length 99 [2022-11-25 15:27:23,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:27:23,838 INFO L495 AbstractCegarLoop]: Abstraction has 1797 states and 2354 transitions. [2022-11-25 15:27:23,838 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 6 states have internal predecessors, (76), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2022-11-25 15:27:23,839 INFO L276 IsEmpty]: Start isEmpty. Operand 1797 states and 2354 transitions. [2022-11-25 15:27:23,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-11-25 15:27:23,840 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:27:23,841 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-25 15:27:23,841 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-11-25 15:27:23,841 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 15:27:23,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:27:23,842 INFO L85 PathProgramCache]: Analyzing trace with hash 506581735, now seen corresponding path program 1 times [2022-11-25 15:27:23,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:27:23,842 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429861205] [2022-11-25 15:27:23,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:27:23,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:27:23,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:27:23,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-25 15:27:23,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:27:23,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-25 15:27:23,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:27:23,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-11-25 15:27:23,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:27:23,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-11-25 15:27:23,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:27:23,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-11-25 15:27:23,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:27:23,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-11-25 15:27:23,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:27:23,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-11-25 15:27:23,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:27:23,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-11-25 15:27:23,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:27:23,996 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-25 15:27:23,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:27:23,996 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429861205] [2022-11-25 15:27:23,997 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429861205] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:27:23,997 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:27:23,997 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 15:27:23,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221103383] [2022-11-25 15:27:23,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:27:23,998 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 15:27:23,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:27:23,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 15:27:23,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 15:27:23,999 INFO L87 Difference]: Start difference. First operand 1797 states and 2354 transitions. Second operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-11-25 15:27:24,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:27:24,732 INFO L93 Difference]: Finished difference Result 4664 states and 6167 transitions. [2022-11-25 15:27:24,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 15:27:24,733 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 101 [2022-11-25 15:27:24,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:27:24,750 INFO L225 Difference]: With dead ends: 4664 [2022-11-25 15:27:24,750 INFO L226 Difference]: Without dead ends: 3204 [2022-11-25 15:27:24,755 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-25 15:27:24,756 INFO L413 NwaCegarLoop]: 471 mSDtfsCounter, 402 mSDsluCounter, 680 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 402 SdHoareTripleChecker+Valid, 1151 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 15:27:24,757 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [402 Valid, 1151 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 15:27:24,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3204 states. [2022-11-25 15:27:25,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3204 to 2818. [2022-11-25 15:27:25,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2818 states, 2105 states have (on average 1.3116389548693588) internal successors, (2761), 2136 states have internal predecessors, (2761), 460 states have call successors, (460), 252 states have call predecessors, (460), 252 states have return successors, (460), 429 states have call predecessors, (460), 460 states have call successors, (460) [2022-11-25 15:27:25,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2818 states to 2818 states and 3681 transitions. [2022-11-25 15:27:25,274 INFO L78 Accepts]: Start accepts. Automaton has 2818 states and 3681 transitions. Word has length 101 [2022-11-25 15:27:25,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:27:25,275 INFO L495 AbstractCegarLoop]: Abstraction has 2818 states and 3681 transitions. [2022-11-25 15:27:25,276 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-11-25 15:27:25,276 INFO L276 IsEmpty]: Start isEmpty. Operand 2818 states and 3681 transitions. [2022-11-25 15:27:25,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-11-25 15:27:25,279 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:27:25,280 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-25 15:27:25,280 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-11-25 15:27:25,280 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 15:27:25,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:27:25,281 INFO L85 PathProgramCache]: Analyzing trace with hash -1826960265, now seen corresponding path program 1 times [2022-11-25 15:27:25,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:27:25,281 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997911868] [2022-11-25 15:27:25,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:27:25,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:27:25,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:27:25,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-25 15:27:25,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:27:25,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-25 15:27:25,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:27:25,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-25 15:27:25,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:27:25,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-25 15:27:25,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:27:25,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-25 15:27:25,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:27:25,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-11-25 15:27:25,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:27:25,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-11-25 15:27:25,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:27:25,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-11-25 15:27:25,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:27:25,403 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-25 15:27:25,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:27:25,403 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997911868] [2022-11-25 15:27:25,403 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1997911868] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:27:25,403 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:27:25,404 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 15:27:25,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250545861] [2022-11-25 15:27:25,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:27:25,404 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 15:27:25,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:27:25,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 15:27:25,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 15:27:25,405 INFO L87 Difference]: Start difference. First operand 2818 states and 3681 transitions. Second operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-11-25 15:27:26,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:27:26,413 INFO L93 Difference]: Finished difference Result 6670 states and 8777 transitions. [2022-11-25 15:27:26,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 15:27:26,414 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 101 [2022-11-25 15:27:26,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:27:26,438 INFO L225 Difference]: With dead ends: 6670 [2022-11-25 15:27:26,447 INFO L226 Difference]: Without dead ends: 4309 [2022-11-25 15:27:26,454 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-25 15:27:26,456 INFO L413 NwaCegarLoop]: 479 mSDtfsCounter, 376 mSDsluCounter, 659 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 376 SdHoareTripleChecker+Valid, 1138 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 15:27:26,457 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [376 Valid, 1138 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 15:27:26,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4309 states. [2022-11-25 15:27:27,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4309 to 4035. [2022-11-25 15:27:27,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4035 states, 2998 states have (on average 1.3082054703135424) internal successors, (3922), 3042 states have internal predecessors, (3922), 672 states have call successors, (672), 364 states have call predecessors, (672), 364 states have return successors, (672), 628 states have call predecessors, (672), 672 states have call successors, (672) [2022-11-25 15:27:27,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4035 states to 4035 states and 5266 transitions. [2022-11-25 15:27:27,179 INFO L78 Accepts]: Start accepts. Automaton has 4035 states and 5266 transitions. Word has length 101 [2022-11-25 15:27:27,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:27:27,180 INFO L495 AbstractCegarLoop]: Abstraction has 4035 states and 5266 transitions. [2022-11-25 15:27:27,180 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-11-25 15:27:27,181 INFO L276 IsEmpty]: Start isEmpty. Operand 4035 states and 5266 transitions. [2022-11-25 15:27:27,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2022-11-25 15:27:27,184 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:27:27,184 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-25 15:27:27,184 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-11-25 15:27:27,184 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 15:27:27,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:27:27,185 INFO L85 PathProgramCache]: Analyzing trace with hash 1131002330, now seen corresponding path program 1 times [2022-11-25 15:27:27,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:27:27,186 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177777050] [2022-11-25 15:27:27,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:27:27,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:27:27,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:27:27,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-25 15:27:27,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:27:27,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-25 15:27:27,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:27:27,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-11-25 15:27:27,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:27:27,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-11-25 15:27:27,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:27:27,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-11-25 15:27:27,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:27:27,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-11-25 15:27:27,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:27:27,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-11-25 15:27:27,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:27:27,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-11-25 15:27:27,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:27:27,261 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-25 15:27:27,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:27:27,261 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177777050] [2022-11-25 15:27:27,261 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [177777050] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:27:27,262 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:27:27,262 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 15:27:27,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309992200] [2022-11-25 15:27:27,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:27:27,263 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 15:27:27,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:27:27,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 15:27:27,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 15:27:27,267 INFO L87 Difference]: Start difference. First operand 4035 states and 5266 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-11-25 15:27:28,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:27:28,387 INFO L93 Difference]: Finished difference Result 9107 states and 12324 transitions. [2022-11-25 15:27:28,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 15:27:28,388 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 102 [2022-11-25 15:27:28,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:27:28,415 INFO L225 Difference]: With dead ends: 9107 [2022-11-25 15:27:28,415 INFO L226 Difference]: Without dead ends: 5426 [2022-11-25 15:27:28,422 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 15:27:28,423 INFO L413 NwaCegarLoop]: 408 mSDtfsCounter, 124 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 633 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 15:27:28,423 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 633 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 15:27:28,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5426 states. [2022-11-25 15:27:29,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5426 to 4041. [2022-11-25 15:27:29,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4041 states, 3004 states have (on average 1.307589880159787) internal successors, (3928), 3048 states have internal predecessors, (3928), 672 states have call successors, (672), 364 states have call predecessors, (672), 364 states have return successors, (672), 628 states have call predecessors, (672), 672 states have call successors, (672) [2022-11-25 15:27:29,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4041 states to 4041 states and 5272 transitions. [2022-11-25 15:27:29,282 INFO L78 Accepts]: Start accepts. Automaton has 4041 states and 5272 transitions. Word has length 102 [2022-11-25 15:27:29,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:27:29,282 INFO L495 AbstractCegarLoop]: Abstraction has 4041 states and 5272 transitions. [2022-11-25 15:27:29,283 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-11-25 15:27:29,283 INFO L276 IsEmpty]: Start isEmpty. Operand 4041 states and 5272 transitions. [2022-11-25 15:27:29,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-11-25 15:27:29,286 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:27:29,286 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-25 15:27:29,287 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-11-25 15:27:29,287 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 15:27:29,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:27:29,288 INFO L85 PathProgramCache]: Analyzing trace with hash -1347241870, now seen corresponding path program 1 times [2022-11-25 15:27:29,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:27:29,288 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592886968] [2022-11-25 15:27:29,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:27:29,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:27:29,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:27:29,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-25 15:27:29,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:27:29,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-25 15:27:29,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:27:29,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-25 15:27:29,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:27:29,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-25 15:27:29,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:27:29,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-25 15:27:29,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:27:29,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-11-25 15:27:29,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:27:29,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-11-25 15:27:29,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:27:29,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-11-25 15:27:29,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:27:29,456 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-25 15:27:29,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:27:29,457 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592886968] [2022-11-25 15:27:29,457 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1592886968] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:27:29,457 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:27:29,457 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 15:27:29,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150403425] [2022-11-25 15:27:29,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:27:29,458 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 15:27:29,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:27:29,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 15:27:29,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 15:27:29,459 INFO L87 Difference]: Start difference. First operand 4041 states and 5272 transitions. Second operand has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-11-25 15:27:30,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:27:30,291 INFO L93 Difference]: Finished difference Result 8489 states and 11336 transitions. [2022-11-25 15:27:30,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 15:27:30,292 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 103 [2022-11-25 15:27:30,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:27:30,311 INFO L225 Difference]: With dead ends: 8489 [2022-11-25 15:27:30,311 INFO L226 Difference]: Without dead ends: 4524 [2022-11-25 15:27:30,319 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-25 15:27:30,320 INFO L413 NwaCegarLoop]: 295 mSDtfsCounter, 264 mSDsluCounter, 495 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 289 SdHoareTripleChecker+Valid, 790 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 15:27:30,320 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [289 Valid, 790 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 15:27:30,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4524 states. [2022-11-25 15:27:31,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4524 to 3686. [2022-11-25 15:27:31,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3686 states, 2732 states have (on average 1.3177159590043923) internal successors, (3600), 2766 states have internal predecessors, (3600), 620 states have call successors, (620), 333 states have call predecessors, (620), 333 states have return successors, (620), 586 states have call predecessors, (620), 620 states have call successors, (620) [2022-11-25 15:27:31,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3686 states to 3686 states and 4840 transitions. [2022-11-25 15:27:31,064 INFO L78 Accepts]: Start accepts. Automaton has 3686 states and 4840 transitions. Word has length 103 [2022-11-25 15:27:31,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:27:31,064 INFO L495 AbstractCegarLoop]: Abstraction has 3686 states and 4840 transitions. [2022-11-25 15:27:31,065 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-11-25 15:27:31,065 INFO L276 IsEmpty]: Start isEmpty. Operand 3686 states and 4840 transitions. [2022-11-25 15:27:31,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2022-11-25 15:27:31,067 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:27:31,067 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-25 15:27:31,067 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-11-25 15:27:31,068 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 15:27:31,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:27:31,069 INFO L85 PathProgramCache]: Analyzing trace with hash -2076713750, now seen corresponding path program 1 times [2022-11-25 15:27:31,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:27:31,069 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464732858] [2022-11-25 15:27:31,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:27:31,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:27:31,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:27:31,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-25 15:27:31,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:27:31,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-25 15:27:31,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:27:31,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-11-25 15:27:31,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:27:31,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-11-25 15:27:31,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:27:31,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-11-25 15:27:31,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:27:31,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-11-25 15:27:31,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:27:31,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-11-25 15:27:31,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:27:31,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-11-25 15:27:31,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:27:31,140 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-25 15:27:31,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:27:31,141 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464732858] [2022-11-25 15:27:31,141 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464732858] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:27:31,141 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:27:31,141 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 15:27:31,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470167467] [2022-11-25 15:27:31,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:27:31,143 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 15:27:31,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:27:31,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 15:27:31,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 15:27:31,144 INFO L87 Difference]: Start difference. First operand 3686 states and 4840 transitions. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-11-25 15:27:32,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:27:32,082 INFO L93 Difference]: Finished difference Result 8085 states and 10894 transitions. [2022-11-25 15:27:32,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 15:27:32,082 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 104 [2022-11-25 15:27:32,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:27:32,104 INFO L225 Difference]: With dead ends: 8085 [2022-11-25 15:27:32,105 INFO L226 Difference]: Without dead ends: 4580 [2022-11-25 15:27:32,111 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 15:27:32,112 INFO L413 NwaCegarLoop]: 391 mSDtfsCounter, 124 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 617 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 15:27:32,114 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 617 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 15:27:32,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4580 states. [2022-11-25 15:27:32,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4580 to 3696. [2022-11-25 15:27:32,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3696 states, 2742 states have (on average 1.3165572574762947) internal successors, (3610), 2776 states have internal predecessors, (3610), 620 states have call successors, (620), 333 states have call predecessors, (620), 333 states have return successors, (620), 586 states have call predecessors, (620), 620 states have call successors, (620) [2022-11-25 15:27:32,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3696 states to 3696 states and 4850 transitions. [2022-11-25 15:27:32,736 INFO L78 Accepts]: Start accepts. Automaton has 3696 states and 4850 transitions. Word has length 104 [2022-11-25 15:27:32,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:27:32,736 INFO L495 AbstractCegarLoop]: Abstraction has 3696 states and 4850 transitions. [2022-11-25 15:27:32,737 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-11-25 15:27:32,737 INFO L276 IsEmpty]: Start isEmpty. Operand 3696 states and 4850 transitions. [2022-11-25 15:27:32,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2022-11-25 15:27:32,739 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:27:32,739 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-25 15:27:32,740 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-11-25 15:27:32,740 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 15:27:32,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:27:32,740 INFO L85 PathProgramCache]: Analyzing trace with hash -2022352177, now seen corresponding path program 1 times [2022-11-25 15:27:32,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:27:32,741 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606369441] [2022-11-25 15:27:32,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:27:32,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:27:32,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:27:32,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-25 15:27:32,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:27:32,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-25 15:27:32,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:27:32,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-11-25 15:27:32,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:27:32,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-11-25 15:27:32,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:27:32,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-11-25 15:27:32,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:27:32,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-11-25 15:27:32,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:27:32,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-11-25 15:27:32,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:27:32,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-11-25 15:27:32,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:27:32,933 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-25 15:27:32,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:27:32,934 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606369441] [2022-11-25 15:27:32,934 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1606369441] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:27:32,934 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:27:32,935 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 15:27:32,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760897580] [2022-11-25 15:27:32,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:27:32,935 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 15:27:32,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:27:32,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 15:27:32,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 15:27:32,937 INFO L87 Difference]: Start difference. First operand 3696 states and 4850 transitions. Second operand has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-11-25 15:27:34,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:27:34,032 INFO L93 Difference]: Finished difference Result 8067 states and 10862 transitions. [2022-11-25 15:27:34,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 15:27:34,033 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 104 [2022-11-25 15:27:34,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:27:34,051 INFO L225 Difference]: With dead ends: 8067 [2022-11-25 15:27:34,051 INFO L226 Difference]: Without dead ends: 4490 [2022-11-25 15:27:34,059 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-25 15:27:34,060 INFO L413 NwaCegarLoop]: 306 mSDtfsCounter, 212 mSDsluCounter, 501 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 807 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 15:27:34,060 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 807 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 15:27:34,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4490 states. [2022-11-25 15:27:34,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4490 to 2785. [2022-11-25 15:27:34,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2785 states, 2065 states have (on average 1.3113801452784504) internal successors, (2708), 2084 states have internal predecessors, (2708), 469 states have call successors, (469), 250 states have call predecessors, (469), 250 states have return successors, (469), 450 states have call predecessors, (469), 469 states have call successors, (469) [2022-11-25 15:27:34,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2785 states to 2785 states and 3646 transitions. [2022-11-25 15:27:34,591 INFO L78 Accepts]: Start accepts. Automaton has 2785 states and 3646 transitions. Word has length 104 [2022-11-25 15:27:34,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:27:34,591 INFO L495 AbstractCegarLoop]: Abstraction has 2785 states and 3646 transitions. [2022-11-25 15:27:34,591 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-11-25 15:27:34,592 INFO L276 IsEmpty]: Start isEmpty. Operand 2785 states and 3646 transitions. [2022-11-25 15:27:34,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2022-11-25 15:27:34,597 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:27:34,597 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 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] [2022-11-25 15:27:34,597 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-11-25 15:27:34,597 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 15:27:34,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:27:34,598 INFO L85 PathProgramCache]: Analyzing trace with hash 1445089110, now seen corresponding path program 1 times [2022-11-25 15:27:34,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:27:34,598 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869771840] [2022-11-25 15:27:34,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:27:34,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:27:34,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:27:34,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-25 15:27:34,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:27:34,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-25 15:27:34,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:27:34,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-11-25 15:27:34,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:27:34,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-25 15:27:34,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:27:34,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-11-25 15:27:34,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:27:34,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-11-25 15:27:34,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:27:34,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-11-25 15:27:34,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:27:34,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-11-25 15:27:34,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:27:34,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-11-25 15:27:34,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:27:34,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-11-25 15:27:34,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:27:34,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-11-25 15:27:34,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:27:34,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-11-25 15:27:34,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:27:34,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-11-25 15:27:34,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:27:34,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-11-25 15:27:34,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:27:34,900 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 16 proven. 12 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2022-11-25 15:27:34,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:27:34,900 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869771840] [2022-11-25 15:27:34,900 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [869771840] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 15:27:34,901 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2003990798] [2022-11-25 15:27:34,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:27:34,901 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 15:27:34,901 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b050e35a-0ebd-4c9f-90ce-59bf7556af81/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 15:27:34,907 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b050e35a-0ebd-4c9f-90ce-59bf7556af81/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 15:27:34,920 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b050e35a-0ebd-4c9f-90ce-59bf7556af81/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-25 15:27:35,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:27:35,149 INFO L263 TraceCheckSpWp]: Trace formula consists of 702 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-25 15:27:35,159 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 15:27:35,461 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 61 proven. 4 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-11-25 15:27:35,462 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 15:27:35,687 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 28 proven. 2 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2022-11-25 15:27:35,689 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2003990798] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 15:27:35,689 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 15:27:35,689 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2022-11-25 15:27:35,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207786173] [2022-11-25 15:27:35,690 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 15:27:35,690 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-25 15:27:35,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:27:35,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-25 15:27:35,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2022-11-25 15:27:35,692 INFO L87 Difference]: Start difference. First operand 2785 states and 3646 transitions. Second operand has 13 states, 13 states have (on average 15.384615384615385) internal successors, (200), 12 states have internal predecessors, (200), 6 states have call successors, (37), 4 states have call predecessors, (37), 6 states have return successors, (37), 7 states have call predecessors, (37), 6 states have call successors, (37) [2022-11-25 15:27:40,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:27:40,438 INFO L93 Difference]: Finished difference Result 9108 states and 12776 transitions. [2022-11-25 15:27:40,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-11-25 15:27:40,439 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 15.384615384615385) internal successors, (200), 12 states have internal predecessors, (200), 6 states have call successors, (37), 4 states have call predecessors, (37), 6 states have return successors, (37), 7 states have call predecessors, (37), 6 states have call successors, (37) Word has length 154 [2022-11-25 15:27:40,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:27:40,463 INFO L225 Difference]: With dead ends: 9108 [2022-11-25 15:27:40,463 INFO L226 Difference]: Without dead ends: 6573 [2022-11-25 15:27:40,469 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 380 GetRequests, 337 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 499 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=383, Invalid=1509, Unknown=0, NotChecked=0, Total=1892 [2022-11-25 15:27:40,469 INFO L413 NwaCegarLoop]: 291 mSDtfsCounter, 3255 mSDsluCounter, 2024 mSDsCounter, 0 mSdLazyCounter, 1342 mSolverCounterSat, 1214 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3255 SdHoareTripleChecker+Valid, 2315 SdHoareTripleChecker+Invalid, 2556 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1214 IncrementalHoareTripleChecker+Valid, 1342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-11-25 15:27:40,470 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3255 Valid, 2315 Invalid, 2556 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1214 Valid, 1342 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-11-25 15:27:40,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6573 states. [2022-11-25 15:27:41,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6573 to 3536. [2022-11-25 15:27:41,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3536 states, 2627 states have (on average 1.3022459078797106) internal successors, (3421), 2651 states have internal predecessors, (3421), 585 states have call successors, (585), 323 states have call predecessors, (585), 323 states have return successors, (585), 561 states have call predecessors, (585), 585 states have call successors, (585) [2022-11-25 15:27:41,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3536 states to 3536 states and 4591 transitions. [2022-11-25 15:27:41,271 INFO L78 Accepts]: Start accepts. Automaton has 3536 states and 4591 transitions. Word has length 154 [2022-11-25 15:27:41,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:27:41,272 INFO L495 AbstractCegarLoop]: Abstraction has 3536 states and 4591 transitions. [2022-11-25 15:27:41,272 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 15.384615384615385) internal successors, (200), 12 states have internal predecessors, (200), 6 states have call successors, (37), 4 states have call predecessors, (37), 6 states have return successors, (37), 7 states have call predecessors, (37), 6 states have call successors, (37) [2022-11-25 15:27:41,272 INFO L276 IsEmpty]: Start isEmpty. Operand 3536 states and 4591 transitions. [2022-11-25 15:27:41,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2022-11-25 15:27:41,279 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:27:41,279 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 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, 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] [2022-11-25 15:27:41,285 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b050e35a-0ebd-4c9f-90ce-59bf7556af81/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-25 15:27:41,485 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b050e35a-0ebd-4c9f-90ce-59bf7556af81/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-11-25 15:27:41,486 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 15:27:41,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:27:41,486 INFO L85 PathProgramCache]: Analyzing trace with hash 124995051, now seen corresponding path program 1 times [2022-11-25 15:27:41,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:27:41,486 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979881658] [2022-11-25 15:27:41,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:27:41,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:27:41,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:27:41,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-25 15:27:41,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:27:41,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-25 15:27:41,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:27:41,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-11-25 15:27:41,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:27:41,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-25 15:27:41,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:27:41,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-11-25 15:27:41,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:27:41,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-11-25 15:27:41,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:27:41,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-11-25 15:27:41,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:27:41,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-11-25 15:27:41,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:27:41,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-11-25 15:27:41,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:27:41,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-11-25 15:27:41,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:27:41,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-11-25 15:27:41,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:27:41,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-11-25 15:27:41,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:27:41,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-11-25 15:27:41,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:27:41,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-11-25 15:27:41,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:27:41,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2022-11-25 15:27:41,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:27:41,787 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2022-11-25 15:27:41,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:27:41,788 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979881658] [2022-11-25 15:27:41,788 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [979881658] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:27:41,788 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:27:41,788 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-25 15:27:41,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512938799] [2022-11-25 15:27:41,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:27:41,790 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 15:27:41,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:27:41,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 15:27:41,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-25 15:27:41,791 INFO L87 Difference]: Start difference. First operand 3536 states and 4591 transitions. Second operand has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 6 states have internal predecessors, (93), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) [2022-11-25 15:27:44,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:27:44,111 INFO L93 Difference]: Finished difference Result 12130 states and 16505 transitions. [2022-11-25 15:27:44,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-25 15:27:44,112 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 6 states have internal predecessors, (93), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) Word has length 163 [2022-11-25 15:27:44,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:27:44,145 INFO L225 Difference]: With dead ends: 12130 [2022-11-25 15:27:44,146 INFO L226 Difference]: Without dead ends: 8950 [2022-11-25 15:27:44,154 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2022-11-25 15:27:44,154 INFO L413 NwaCegarLoop]: 449 mSDtfsCounter, 638 mSDsluCounter, 1989 mSDsCounter, 0 mSdLazyCounter, 264 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 657 SdHoareTripleChecker+Valid, 2438 SdHoareTripleChecker+Invalid, 366 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-25 15:27:44,155 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [657 Valid, 2438 Invalid, 366 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 264 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-25 15:27:44,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8950 states. [2022-11-25 15:27:45,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8950 to 6294. [2022-11-25 15:27:45,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6294 states, 4617 states have (on average 1.3025774312324019) internal successors, (6014), 4663 states have internal predecessors, (6014), 1095 states have call successors, (1095), 581 states have call predecessors, (1095), 581 states have return successors, (1095), 1049 states have call predecessors, (1095), 1095 states have call successors, (1095) [2022-11-25 15:27:45,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6294 states to 6294 states and 8204 transitions. [2022-11-25 15:27:45,264 INFO L78 Accepts]: Start accepts. Automaton has 6294 states and 8204 transitions. Word has length 163 [2022-11-25 15:27:45,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:27:45,264 INFO L495 AbstractCegarLoop]: Abstraction has 6294 states and 8204 transitions. [2022-11-25 15:27:45,265 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 6 states have internal predecessors, (93), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) [2022-11-25 15:27:45,265 INFO L276 IsEmpty]: Start isEmpty. Operand 6294 states and 8204 transitions. [2022-11-25 15:27:45,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2022-11-25 15:27:45,274 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:27:45,274 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:27:45,275 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-11-25 15:27:45,275 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 15:27:45,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:27:45,275 INFO L85 PathProgramCache]: Analyzing trace with hash 655594681, now seen corresponding path program 1 times [2022-11-25 15:27:45,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:27:45,276 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666475215] [2022-11-25 15:27:45,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:27:45,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:27:45,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:27:45,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-25 15:27:45,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:27:45,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-25 15:27:45,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:27:45,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-25 15:27:45,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:27:45,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-11-25 15:27:45,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:27:45,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-11-25 15:27:45,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:27:45,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-11-25 15:27:45,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:27:45,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-11-25 15:27:45,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:27:45,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-11-25 15:27:45,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:27:45,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-11-25 15:27:45,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:27:45,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-11-25 15:27:45,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:27:45,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-11-25 15:27:45,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:27:45,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-11-25 15:27:45,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:27:45,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-11-25 15:27:45,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:27:45,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-11-25 15:27:45,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:27:45,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2022-11-25 15:27:45,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:27:45,709 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 12 proven. 17 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2022-11-25 15:27:45,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:27:45,710 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666475215] [2022-11-25 15:27:45,710 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [666475215] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 15:27:45,710 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [911132211] [2022-11-25 15:27:45,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:27:45,710 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 15:27:45,711 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b050e35a-0ebd-4c9f-90ce-59bf7556af81/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 15:27:45,712 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b050e35a-0ebd-4c9f-90ce-59bf7556af81/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 15:27:45,734 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b050e35a-0ebd-4c9f-90ce-59bf7556af81/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-25 15:27:45,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:27:45,905 INFO L263 TraceCheckSpWp]: Trace formula consists of 738 conjuncts, 16 conjunts are in the unsatisfiable core [2022-11-25 15:27:45,911 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 15:27:46,214 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 32 proven. 47 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-25 15:27:46,214 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 15:27:46,455 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 11 proven. 20 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2022-11-25 15:27:46,455 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [911132211] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 15:27:46,456 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 15:27:46,456 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 16 [2022-11-25 15:27:46,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136824727] [2022-11-25 15:27:46,456 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 15:27:46,457 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-11-25 15:27:46,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:27:46,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-11-25 15:27:46,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2022-11-25 15:27:46,458 INFO L87 Difference]: Start difference. First operand 6294 states and 8204 transitions. Second operand has 16 states, 16 states have (on average 13.0) internal successors, (208), 14 states have internal predecessors, (208), 6 states have call successors, (43), 4 states have call predecessors, (43), 7 states have return successors, (42), 8 states have call predecessors, (42), 6 states have call successors, (42) [2022-11-25 15:28:01,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:28:01,051 INFO L93 Difference]: Finished difference Result 29252 states and 39452 transitions. [2022-11-25 15:28:01,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2022-11-25 15:28:01,052 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 13.0) internal successors, (208), 14 states have internal predecessors, (208), 6 states have call successors, (43), 4 states have call predecessors, (43), 7 states have return successors, (42), 8 states have call predecessors, (42), 6 states have call successors, (42) Word has length 163 [2022-11-25 15:28:01,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:28:01,137 INFO L225 Difference]: With dead ends: 29252 [2022-11-25 15:28:01,137 INFO L226 Difference]: Without dead ends: 23239 [2022-11-25 15:28:01,157 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 530 GetRequests, 412 SyntacticMatches, 1 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5081 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=1835, Invalid=12207, Unknown=0, NotChecked=0, Total=14042 [2022-11-25 15:28:01,157 INFO L413 NwaCegarLoop]: 1488 mSDtfsCounter, 5057 mSDsluCounter, 11731 mSDsCounter, 0 mSdLazyCounter, 5862 mSolverCounterSat, 3473 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5057 SdHoareTripleChecker+Valid, 13219 SdHoareTripleChecker+Invalid, 9335 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 3473 IncrementalHoareTripleChecker+Valid, 5862 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.1s IncrementalHoareTripleChecker+Time [2022-11-25 15:28:01,158 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5057 Valid, 13219 Invalid, 9335 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [3473 Valid, 5862 Invalid, 0 Unknown, 0 Unchecked, 6.1s Time] [2022-11-25 15:28:01,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23239 states. [2022-11-25 15:28:03,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23239 to 8393. [2022-11-25 15:28:03,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8393 states, 6200 states have (on average 1.3038709677419356) internal successors, (8084), 6258 states have internal predecessors, (8084), 1423 states have call successors, (1423), 769 states have call predecessors, (1423), 769 states have return successors, (1423), 1365 states have call predecessors, (1423), 1423 states have call successors, (1423) [2022-11-25 15:28:03,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8393 states to 8393 states and 10930 transitions. [2022-11-25 15:28:03,219 INFO L78 Accepts]: Start accepts. Automaton has 8393 states and 10930 transitions. Word has length 163 [2022-11-25 15:28:03,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:28:03,220 INFO L495 AbstractCegarLoop]: Abstraction has 8393 states and 10930 transitions. [2022-11-25 15:28:03,220 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 13.0) internal successors, (208), 14 states have internal predecessors, (208), 6 states have call successors, (43), 4 states have call predecessors, (43), 7 states have return successors, (42), 8 states have call predecessors, (42), 6 states have call successors, (42) [2022-11-25 15:28:03,220 INFO L276 IsEmpty]: Start isEmpty. Operand 8393 states and 10930 transitions. [2022-11-25 15:28:03,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2022-11-25 15:28:03,234 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:28:03,234 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 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, 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] [2022-11-25 15:28:03,244 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b050e35a-0ebd-4c9f-90ce-59bf7556af81/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-11-25 15:28:03,439 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b050e35a-0ebd-4c9f-90ce-59bf7556af81/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 15:28:03,440 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 15:28:03,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:28:03,440 INFO L85 PathProgramCache]: Analyzing trace with hash -1767398441, now seen corresponding path program 1 times [2022-11-25 15:28:03,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:28:03,440 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385523546] [2022-11-25 15:28:03,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:28:03,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:28:03,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:28:04,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-25 15:28:04,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:28:04,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-25 15:28:04,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:28:04,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-11-25 15:28:04,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:28:04,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-11-25 15:28:04,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:28:04,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-11-25 15:28:04,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:28:04,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-11-25 15:28:04,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:28:04,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-11-25 15:28:04,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:28:04,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-11-25 15:28:04,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:28:04,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-11-25 15:28:04,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:28:04,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-11-25 15:28:04,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:28:04,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-11-25 15:28:04,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:28:04,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-11-25 15:28:04,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:28:04,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-11-25 15:28:04,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:28:04,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-11-25 15:28:04,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:28:04,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2022-11-25 15:28:04,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:28:04,178 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 16 proven. 14 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2022-11-25 15:28:04,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:28:04,179 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385523546] [2022-11-25 15:28:04,179 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1385523546] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 15:28:04,179 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1960162818] [2022-11-25 15:28:04,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:28:04,179 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 15:28:04,180 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b050e35a-0ebd-4c9f-90ce-59bf7556af81/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 15:28:04,181 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b050e35a-0ebd-4c9f-90ce-59bf7556af81/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 15:28:04,187 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b050e35a-0ebd-4c9f-90ce-59bf7556af81/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-25 15:28:04,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:28:04,374 INFO L263 TraceCheckSpWp]: Trace formula consists of 743 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-25 15:28:04,378 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 15:28:04,463 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 49 proven. 6 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-11-25 15:28:04,464 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 15:28:04,589 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2022-11-25 15:28:04,590 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1960162818] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-25 15:28:04,590 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-25 15:28:04,590 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8, 7] total 14 [2022-11-25 15:28:04,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183819349] [2022-11-25 15:28:04,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:28:04,592 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 15:28:04,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:28:04,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 15:28:04,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2022-11-25 15:28:04,594 INFO L87 Difference]: Start difference. First operand 8393 states and 10930 transitions. Second operand has 5 states, 4 states have (on average 23.5) internal successors, (94), 5 states have internal predecessors, (94), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) [2022-11-25 15:28:05,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:28:05,632 INFO L93 Difference]: Finished difference Result 13726 states and 17927 transitions. [2022-11-25 15:28:05,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 15:28:05,633 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 23.5) internal successors, (94), 5 states have internal predecessors, (94), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) Word has length 167 [2022-11-25 15:28:05,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:28:05,653 INFO L225 Difference]: With dead ends: 13726 [2022-11-25 15:28:05,654 INFO L226 Difference]: Without dead ends: 5530 [2022-11-25 15:28:05,667 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 370 GetRequests, 358 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2022-11-25 15:28:05,668 INFO L413 NwaCegarLoop]: 259 mSDtfsCounter, 0 mSDsluCounter, 764 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1023 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 15:28:05,668 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1023 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 15:28:05,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5530 states. [2022-11-25 15:28:06,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5530 to 5296. [2022-11-25 15:28:06,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5296 states, 3914 states have (on average 1.303270311701584) internal successors, (5101), 3948 states have internal predecessors, (5101), 901 states have call successors, (901), 480 states have call predecessors, (901), 480 states have return successors, (901), 867 states have call predecessors, (901), 901 states have call successors, (901) [2022-11-25 15:28:06,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5296 states to 5296 states and 6903 transitions. [2022-11-25 15:28:06,655 INFO L78 Accepts]: Start accepts. Automaton has 5296 states and 6903 transitions. Word has length 167 [2022-11-25 15:28:06,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:28:06,656 INFO L495 AbstractCegarLoop]: Abstraction has 5296 states and 6903 transitions. [2022-11-25 15:28:06,656 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 23.5) internal successors, (94), 5 states have internal predecessors, (94), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) [2022-11-25 15:28:06,656 INFO L276 IsEmpty]: Start isEmpty. Operand 5296 states and 6903 transitions. [2022-11-25 15:28:06,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2022-11-25 15:28:06,666 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:28:06,666 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 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] [2022-11-25 15:28:06,675 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b050e35a-0ebd-4c9f-90ce-59bf7556af81/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-25 15:28:06,872 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b050e35a-0ebd-4c9f-90ce-59bf7556af81/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 15:28:06,872 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 15:28:06,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:28:06,873 INFO L85 PathProgramCache]: Analyzing trace with hash 946763764, now seen corresponding path program 1 times [2022-11-25 15:28:06,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:28:06,873 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425623186] [2022-11-25 15:28:06,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:28:06,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:28:06,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:28:07,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-25 15:28:07,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:28:07,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-25 15:28:07,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:28:07,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-11-25 15:28:07,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:28:07,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-11-25 15:28:07,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:28:07,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-11-25 15:28:07,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:28:07,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-11-25 15:28:07,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:28:07,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-11-25 15:28:07,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:28:07,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-11-25 15:28:07,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:28:07,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-11-25 15:28:07,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:28:07,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-11-25 15:28:07,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:28:07,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-11-25 15:28:07,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:28:07,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-11-25 15:28:07,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:28:07,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-11-25 15:28:07,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:28:07,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2022-11-25 15:28:07,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:28:07,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2022-11-25 15:28:07,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:28:07,691 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 24 proven. 5 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2022-11-25 15:28:07,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:28:07,691 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425623186] [2022-11-25 15:28:07,691 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [425623186] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 15:28:07,692 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [423845045] [2022-11-25 15:28:07,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:28:07,692 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 15:28:07,693 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b050e35a-0ebd-4c9f-90ce-59bf7556af81/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 15:28:07,694 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b050e35a-0ebd-4c9f-90ce-59bf7556af81/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 15:28:07,718 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b050e35a-0ebd-4c9f-90ce-59bf7556af81/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-25 15:28:07,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:28:07,897 INFO L263 TraceCheckSpWp]: Trace formula consists of 760 conjuncts, 27 conjunts are in the unsatisfiable core [2022-11-25 15:28:07,902 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 15:28:08,700 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 59 proven. 22 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-25 15:28:08,701 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 15:28:09,303 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 15 proven. 14 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2022-11-25 15:28:09,304 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [423845045] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 15:28:09,304 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 15:28:09,304 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 8] total 23 [2022-11-25 15:28:09,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926314895] [2022-11-25 15:28:09,305 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 15:28:09,307 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-11-25 15:28:09,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:28:09,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-11-25 15:28:09,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=424, Unknown=0, NotChecked=0, Total=506 [2022-11-25 15:28:09,309 INFO L87 Difference]: Start difference. First operand 5296 states and 6903 transitions. Second operand has 23 states, 23 states have (on average 11.91304347826087) internal successors, (274), 23 states have internal predecessors, (274), 9 states have call successors, (41), 5 states have call predecessors, (41), 5 states have return successors, (40), 9 states have call predecessors, (40), 9 states have call successors, (40) [2022-11-25 15:28:35,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:28:35,366 INFO L93 Difference]: Finished difference Result 24007 states and 33921 transitions. [2022-11-25 15:28:35,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 255 states. [2022-11-25 15:28:35,366 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 11.91304347826087) internal successors, (274), 23 states have internal predecessors, (274), 9 states have call successors, (41), 5 states have call predecessors, (41), 5 states have return successors, (40), 9 states have call predecessors, (40), 9 states have call successors, (40) Word has length 168 [2022-11-25 15:28:35,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:28:35,436 INFO L225 Difference]: With dead ends: 24007 [2022-11-25 15:28:35,437 INFO L226 Difference]: Without dead ends: 18964 [2022-11-25 15:28:35,464 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 643 GetRequests, 372 SyntacticMatches, 1 SemanticMatches, 270 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31895 ImplicationChecksByTransitivity, 11.9s TimeCoverageRelationStatistics Valid=7428, Invalid=66284, Unknown=0, NotChecked=0, Total=73712 [2022-11-25 15:28:35,464 INFO L413 NwaCegarLoop]: 785 mSDtfsCounter, 5346 mSDsluCounter, 5876 mSDsCounter, 0 mSdLazyCounter, 8558 mSolverCounterSat, 4097 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5346 SdHoareTripleChecker+Valid, 6661 SdHoareTripleChecker+Invalid, 12655 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 4097 IncrementalHoareTripleChecker+Valid, 8558 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.2s IncrementalHoareTripleChecker+Time [2022-11-25 15:28:35,465 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5346 Valid, 6661 Invalid, 12655 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [4097 Valid, 8558 Invalid, 0 Unknown, 0 Unchecked, 8.2s Time] [2022-11-25 15:28:35,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18964 states. [2022-11-25 15:28:37,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18964 to 9202. [2022-11-25 15:28:37,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9202 states, 6909 states have (on average 1.3064119264727168) internal successors, (9026), 6963 states have internal predecessors, (9026), 1469 states have call successors, (1469), 823 states have call predecessors, (1469), 823 states have return successors, (1469), 1415 states have call predecessors, (1469), 1469 states have call successors, (1469) [2022-11-25 15:28:37,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9202 states to 9202 states and 11964 transitions. [2022-11-25 15:28:37,937 INFO L78 Accepts]: Start accepts. Automaton has 9202 states and 11964 transitions. Word has length 168 [2022-11-25 15:28:37,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:28:37,938 INFO L495 AbstractCegarLoop]: Abstraction has 9202 states and 11964 transitions. [2022-11-25 15:28:37,938 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 11.91304347826087) internal successors, (274), 23 states have internal predecessors, (274), 9 states have call successors, (41), 5 states have call predecessors, (41), 5 states have return successors, (40), 9 states have call predecessors, (40), 9 states have call successors, (40) [2022-11-25 15:28:37,938 INFO L276 IsEmpty]: Start isEmpty. Operand 9202 states and 11964 transitions. [2022-11-25 15:28:37,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2022-11-25 15:28:37,954 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:28:37,954 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 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, 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] [2022-11-25 15:28:37,961 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b050e35a-0ebd-4c9f-90ce-59bf7556af81/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-25 15:28:38,161 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b050e35a-0ebd-4c9f-90ce-59bf7556af81/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 15:28:38,161 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 15:28:38,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:28:38,162 INFO L85 PathProgramCache]: Analyzing trace with hash 1376236573, now seen corresponding path program 1 times [2022-11-25 15:28:38,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:28:38,162 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788266902] [2022-11-25 15:28:38,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:28:38,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:28:38,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:28:39,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-25 15:28:39,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:28:39,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-25 15:28:39,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:28:39,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-11-25 15:28:39,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:28:39,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-11-25 15:28:39,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:28:39,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-11-25 15:28:39,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:28:39,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-11-25 15:28:39,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:28:39,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-11-25 15:28:39,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:28:39,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-11-25 15:28:39,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:28:39,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-11-25 15:28:39,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:28:39,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-11-25 15:28:39,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:28:39,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-11-25 15:28:39,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:28:39,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-11-25 15:28:39,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:28:39,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-11-25 15:28:39,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:28:39,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2022-11-25 15:28:39,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:28:39,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-11-25 15:28:39,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:28:39,321 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 24 proven. 9 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2022-11-25 15:28:39,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:28:39,321 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788266902] [2022-11-25 15:28:39,322 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [788266902] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 15:28:39,322 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [939362208] [2022-11-25 15:28:39,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:28:39,322 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 15:28:39,322 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b050e35a-0ebd-4c9f-90ce-59bf7556af81/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 15:28:39,323 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b050e35a-0ebd-4c9f-90ce-59bf7556af81/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 15:28:39,362 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b050e35a-0ebd-4c9f-90ce-59bf7556af81/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-25 15:28:39,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:28:39,545 INFO L263 TraceCheckSpWp]: Trace formula consists of 759 conjuncts, 44 conjunts are in the unsatisfiable core [2022-11-25 15:28:39,554 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 15:28:40,780 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 72 proven. 13 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-25 15:28:40,780 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 15:28:42,212 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 16 proven. 17 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2022-11-25 15:28:42,212 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [939362208] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 15:28:42,213 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 15:28:42,213 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 12] total 27 [2022-11-25 15:28:42,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853920929] [2022-11-25 15:28:42,213 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 15:28:42,214 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-11-25 15:28:42,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:28:42,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-11-25 15:28:42,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=580, Unknown=0, NotChecked=0, Total=702 [2022-11-25 15:28:42,216 INFO L87 Difference]: Start difference. First operand 9202 states and 11964 transitions. Second operand has 27 states, 27 states have (on average 9.88888888888889) internal successors, (267), 27 states have internal predecessors, (267), 10 states have call successors, (41), 5 states have call predecessors, (41), 5 states have return successors, (40), 10 states have call predecessors, (40), 10 states have call successors, (40) [2022-11-25 15:29:30,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:29:30,606 INFO L93 Difference]: Finished difference Result 29348 states and 40898 transitions. [2022-11-25 15:29:30,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 211 states. [2022-11-25 15:29:30,607 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 9.88888888888889) internal successors, (267), 27 states have internal predecessors, (267), 10 states have call successors, (41), 5 states have call predecessors, (41), 5 states have return successors, (40), 10 states have call predecessors, (40), 10 states have call successors, (40) Word has length 169 [2022-11-25 15:29:30,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:29:30,676 INFO L225 Difference]: With dead ends: 29348 [2022-11-25 15:29:30,676 INFO L226 Difference]: Without dead ends: 20410 [2022-11-25 15:29:30,700 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 590 GetRequests, 359 SyntacticMatches, 2 SemanticMatches, 229 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22967 ImplicationChecksByTransitivity, 30.8s TimeCoverageRelationStatistics Valid=7936, Invalid=45194, Unknown=0, NotChecked=0, Total=53130 [2022-11-25 15:29:30,701 INFO L413 NwaCegarLoop]: 530 mSDtfsCounter, 8374 mSDsluCounter, 5869 mSDsCounter, 0 mSdLazyCounter, 9177 mSolverCounterSat, 6104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8374 SdHoareTripleChecker+Valid, 6399 SdHoareTripleChecker+Invalid, 15281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 6104 IncrementalHoareTripleChecker+Valid, 9177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.4s IncrementalHoareTripleChecker+Time [2022-11-25 15:29:30,701 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8374 Valid, 6399 Invalid, 15281 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [6104 Valid, 9177 Invalid, 0 Unknown, 0 Unchecked, 10.4s Time] [2022-11-25 15:29:30,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20410 states. [2022-11-25 15:29:33,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20410 to 9229. [2022-11-25 15:29:33,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9229 states, 6932 states have (on average 1.3026543566070399) internal successors, (9030), 6986 states have internal predecessors, (9030), 1471 states have call successors, (1471), 825 states have call predecessors, (1471), 825 states have return successors, (1471), 1417 states have call predecessors, (1471), 1471 states have call successors, (1471) [2022-11-25 15:29:33,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9229 states to 9229 states and 11972 transitions. [2022-11-25 15:29:33,544 INFO L78 Accepts]: Start accepts. Automaton has 9229 states and 11972 transitions. Word has length 169 [2022-11-25 15:29:33,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:29:33,545 INFO L495 AbstractCegarLoop]: Abstraction has 9229 states and 11972 transitions. [2022-11-25 15:29:33,545 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 9.88888888888889) internal successors, (267), 27 states have internal predecessors, (267), 10 states have call successors, (41), 5 states have call predecessors, (41), 5 states have return successors, (40), 10 states have call predecessors, (40), 10 states have call successors, (40) [2022-11-25 15:29:33,546 INFO L276 IsEmpty]: Start isEmpty. Operand 9229 states and 11972 transitions. [2022-11-25 15:29:33,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2022-11-25 15:29:33,552 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:29:33,552 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:29:33,559 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b050e35a-0ebd-4c9f-90ce-59bf7556af81/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-25 15:29:33,758 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b050e35a-0ebd-4c9f-90ce-59bf7556af81/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 15:29:33,758 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 15:29:33,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:29:33,759 INFO L85 PathProgramCache]: Analyzing trace with hash -1599527252, now seen corresponding path program 1 times [2022-11-25 15:29:33,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:29:33,759 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009287211] [2022-11-25 15:29:33,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:29:33,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:29:33,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:29:33,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-25 15:29:33,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:29:33,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-25 15:29:33,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:29:33,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-25 15:29:33,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:29:33,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-11-25 15:29:33,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:29:33,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-11-25 15:29:33,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:29:33,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-11-25 15:29:33,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:29:33,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-11-25 15:29:33,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:29:33,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-11-25 15:29:33,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:29:33,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-11-25 15:29:33,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:29:33,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-11-25 15:29:33,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:29:33,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-11-25 15:29:33,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:29:33,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-11-25 15:29:33,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:29:33,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2022-11-25 15:29:33,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:29:33,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-11-25 15:29:33,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:29:33,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-11-25 15:29:33,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:29:33,992 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 14 proven. 31 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2022-11-25 15:29:33,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:29:33,992 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009287211] [2022-11-25 15:29:33,992 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1009287211] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 15:29:33,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1871359921] [2022-11-25 15:29:33,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:29:33,993 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 15:29:33,993 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b050e35a-0ebd-4c9f-90ce-59bf7556af81/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 15:29:33,994 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b050e35a-0ebd-4c9f-90ce-59bf7556af81/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 15:29:34,003 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b050e35a-0ebd-4c9f-90ce-59bf7556af81/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-25 15:29:34,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:29:34,184 INFO L263 TraceCheckSpWp]: Trace formula consists of 760 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-25 15:29:34,188 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 15:29:34,450 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 8 proven. 90 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-11-25 15:29:34,450 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 15:29:34,678 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 14 proven. 31 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2022-11-25 15:29:34,678 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1871359921] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 15:29:34,678 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 15:29:34,678 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 10 [2022-11-25 15:29:34,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313707128] [2022-11-25 15:29:34,679 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 15:29:34,679 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-25 15:29:34,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:29:34,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-25 15:29:34,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-11-25 15:29:34,681 INFO L87 Difference]: Start difference. First operand 9229 states and 11972 transitions. Second operand has 10 states, 10 states have (on average 15.6) internal successors, (156), 9 states have internal predecessors, (156), 4 states have call successors, (32), 5 states have call predecessors, (32), 7 states have return successors, (31), 4 states have call predecessors, (31), 3 states have call successors, (31) [2022-11-25 15:29:39,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:29:39,712 INFO L93 Difference]: Finished difference Result 25786 states and 33663 transitions. [2022-11-25 15:29:39,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-25 15:29:39,713 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 15.6) internal successors, (156), 9 states have internal predecessors, (156), 4 states have call successors, (32), 5 states have call predecessors, (32), 7 states have return successors, (31), 4 states have call predecessors, (31), 3 states have call successors, (31) Word has length 170 [2022-11-25 15:29:39,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:29:39,745 INFO L225 Difference]: With dead ends: 25786 [2022-11-25 15:29:39,746 INFO L226 Difference]: Without dead ends: 16821 [2022-11-25 15:29:39,758 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 388 GetRequests, 365 SyntacticMatches, 5 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=299, Unknown=0, NotChecked=0, Total=380 [2022-11-25 15:29:39,759 INFO L413 NwaCegarLoop]: 351 mSDtfsCounter, 503 mSDsluCounter, 1947 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 508 SdHoareTripleChecker+Valid, 2298 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 15:29:39,759 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [508 Valid, 2298 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 15:29:39,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16821 states. [2022-11-25 15:29:42,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16821 to 11770. [2022-11-25 15:29:42,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11770 states, 8903 states have (on average 1.2885544198584746) internal successors, (11472), 8973 states have internal predecessors, (11472), 1809 states have call successors, (1809), 1057 states have call predecessors, (1809), 1057 states have return successors, (1809), 1739 states have call predecessors, (1809), 1809 states have call successors, (1809) [2022-11-25 15:29:42,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11770 states to 11770 states and 15090 transitions. [2022-11-25 15:29:42,580 INFO L78 Accepts]: Start accepts. Automaton has 11770 states and 15090 transitions. Word has length 170 [2022-11-25 15:29:42,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:29:42,580 INFO L495 AbstractCegarLoop]: Abstraction has 11770 states and 15090 transitions. [2022-11-25 15:29:42,581 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 15.6) internal successors, (156), 9 states have internal predecessors, (156), 4 states have call successors, (32), 5 states have call predecessors, (32), 7 states have return successors, (31), 4 states have call predecessors, (31), 3 states have call successors, (31) [2022-11-25 15:29:42,581 INFO L276 IsEmpty]: Start isEmpty. Operand 11770 states and 15090 transitions. [2022-11-25 15:29:42,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2022-11-25 15:29:42,588 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:29:42,588 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:29:42,603 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b050e35a-0ebd-4c9f-90ce-59bf7556af81/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-25 15:29:42,795 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b050e35a-0ebd-4c9f-90ce-59bf7556af81/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2022-11-25 15:29:42,795 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 15:29:42,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:29:42,795 INFO L85 PathProgramCache]: Analyzing trace with hash 1095158754, now seen corresponding path program 1 times [2022-11-25 15:29:42,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:29:42,796 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923767825] [2022-11-25 15:29:42,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:29:42,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:29:42,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:29:42,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-25 15:29:42,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:29:42,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-25 15:29:42,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:29:42,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-25 15:29:42,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:29:42,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-11-25 15:29:42,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:29:42,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-11-25 15:29:42,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:29:42,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-11-25 15:29:42,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:29:42,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-11-25 15:29:42,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:29:42,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-11-25 15:29:42,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:29:42,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-11-25 15:29:42,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:29:42,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-11-25 15:29:42,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:29:42,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-11-25 15:29:42,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:29:42,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-11-25 15:29:42,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:29:42,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2022-11-25 15:29:42,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:29:42,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-11-25 15:29:42,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:29:42,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-11-25 15:29:42,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:29:42,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2022-11-25 15:29:42,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:29:43,007 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-11-25 15:29:43,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:29:43,008 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923767825] [2022-11-25 15:29:43,008 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1923767825] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:29:43,008 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:29:43,008 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-25 15:29:43,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408190386] [2022-11-25 15:29:43,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:29:43,009 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 15:29:43,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:29:43,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 15:29:43,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-25 15:29:43,010 INFO L87 Difference]: Start difference. First operand 11770 states and 15090 transitions. Second operand has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 6 states have internal predecessors, (95), 3 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) [2022-11-25 15:29:50,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:29:50,563 INFO L93 Difference]: Finished difference Result 33636 states and 44436 transitions. [2022-11-25 15:29:50,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-25 15:29:50,563 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 6 states have internal predecessors, (95), 3 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) Word has length 172 [2022-11-25 15:29:50,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:29:50,622 INFO L225 Difference]: With dead ends: 33636 [2022-11-25 15:29:50,622 INFO L226 Difference]: Without dead ends: 24629 [2022-11-25 15:29:50,636 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2022-11-25 15:29:50,636 INFO L413 NwaCegarLoop]: 499 mSDtfsCounter, 508 mSDsluCounter, 2065 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 523 SdHoareTripleChecker+Valid, 2564 SdHoareTripleChecker+Invalid, 355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 15:29:50,637 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [523 Valid, 2564 Invalid, 355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 265 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 15:29:50,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24629 states. [2022-11-25 15:29:55,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24629 to 17338. [2022-11-25 15:29:55,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17338 states, 12936 states have (on average 1.2804576376004948) internal successors, (16564), 13055 states have internal predecessors, (16564), 2807 states have call successors, (2807), 1594 states have call predecessors, (2807), 1594 states have return successors, (2807), 2688 states have call predecessors, (2807), 2807 states have call successors, (2807) [2022-11-25 15:29:55,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17338 states to 17338 states and 22178 transitions. [2022-11-25 15:29:55,392 INFO L78 Accepts]: Start accepts. Automaton has 17338 states and 22178 transitions. Word has length 172 [2022-11-25 15:29:55,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:29:55,393 INFO L495 AbstractCegarLoop]: Abstraction has 17338 states and 22178 transitions. [2022-11-25 15:29:55,393 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 6 states have internal predecessors, (95), 3 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) [2022-11-25 15:29:55,393 INFO L276 IsEmpty]: Start isEmpty. Operand 17338 states and 22178 transitions. [2022-11-25 15:29:55,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2022-11-25 15:29:55,402 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:29:55,402 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:29:55,402 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-11-25 15:29:55,403 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 15:29:55,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:29:55,403 INFO L85 PathProgramCache]: Analyzing trace with hash -359260583, now seen corresponding path program 1 times [2022-11-25 15:29:55,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:29:55,403 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185199429] [2022-11-25 15:29:55,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:29:55,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:29:55,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:29:56,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-25 15:29:56,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:29:56,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-25 15:29:56,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:29:56,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-25 15:29:56,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:29:56,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-11-25 15:29:56,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:29:56,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-11-25 15:29:56,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:29:56,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-11-25 15:29:56,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:29:56,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-11-25 15:29:56,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:29:56,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-11-25 15:29:56,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:29:56,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-11-25 15:29:56,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:29:56,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-11-25 15:29:56,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:29:56,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-11-25 15:29:56,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:29:56,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-11-25 15:29:56,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:29:56,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-11-25 15:29:56,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:29:56,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2022-11-25 15:29:56,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:29:56,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2022-11-25 15:29:56,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:29:56,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2022-11-25 15:29:56,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:29:56,154 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 30 proven. 6 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2022-11-25 15:29:56,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:29:56,154 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185199429] [2022-11-25 15:29:56,154 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1185199429] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 15:29:56,154 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1683799971] [2022-11-25 15:29:56,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:29:56,155 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 15:29:56,155 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b050e35a-0ebd-4c9f-90ce-59bf7556af81/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 15:29:56,156 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b050e35a-0ebd-4c9f-90ce-59bf7556af81/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 15:29:56,174 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b050e35a-0ebd-4c9f-90ce-59bf7556af81/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-25 15:29:56,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:29:56,350 INFO L263 TraceCheckSpWp]: Trace formula consists of 774 conjuncts, 11 conjunts are in the unsatisfiable core [2022-11-25 15:29:56,354 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 15:29:56,498 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 48 proven. 4 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-11-25 15:29:56,498 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 15:29:56,632 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 25 proven. 2 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2022-11-25 15:29:56,632 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1683799971] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 15:29:56,633 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 15:29:56,633 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 15 [2022-11-25 15:29:56,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361323410] [2022-11-25 15:29:56,633 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 15:29:56,634 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-25 15:29:56,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:29:56,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-25 15:29:56,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2022-11-25 15:29:56,635 INFO L87 Difference]: Start difference. First operand 17338 states and 22178 transitions. Second operand has 15 states, 15 states have (on average 12.933333333333334) internal successors, (194), 14 states have internal predecessors, (194), 6 states have call successors, (35), 4 states have call predecessors, (35), 6 states have return successors, (35), 7 states have call predecessors, (35), 6 states have call successors, (35) [2022-11-25 15:30:10,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:30:10,547 INFO L93 Difference]: Finished difference Result 44819 states and 60083 transitions. [2022-11-25 15:30:10,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-11-25 15:30:10,548 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 12.933333333333334) internal successors, (194), 14 states have internal predecessors, (194), 6 states have call successors, (35), 4 states have call predecessors, (35), 6 states have return successors, (35), 7 states have call predecessors, (35), 6 states have call successors, (35) Word has length 173 [2022-11-25 15:30:10,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:30:10,610 INFO L225 Difference]: With dead ends: 44819 [2022-11-25 15:30:10,610 INFO L226 Difference]: Without dead ends: 27661 [2022-11-25 15:30:10,627 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 433 GetRequests, 383 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 680 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=369, Invalid=2283, Unknown=0, NotChecked=0, Total=2652 [2022-11-25 15:30:10,627 INFO L413 NwaCegarLoop]: 808 mSDtfsCounter, 1590 mSDsluCounter, 6262 mSDsCounter, 0 mSdLazyCounter, 4343 mSolverCounterSat, 956 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1590 SdHoareTripleChecker+Valid, 7070 SdHoareTripleChecker+Invalid, 5299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 956 IncrementalHoareTripleChecker+Valid, 4343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2022-11-25 15:30:10,628 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1590 Valid, 7070 Invalid, 5299 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [956 Valid, 4343 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2022-11-25 15:30:10,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27661 states. [2022-11-25 15:30:15,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27661 to 17446. [2022-11-25 15:30:15,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17446 states, 13016 states have (on average 1.2799631223110017) internal successors, (16660), 13137 states have internal predecessors, (16660), 2823 states have call successors, (2823), 1606 states have call predecessors, (2823), 1606 states have return successors, (2823), 2702 states have call predecessors, (2823), 2823 states have call successors, (2823) [2022-11-25 15:30:15,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17446 states to 17446 states and 22306 transitions. [2022-11-25 15:30:15,414 INFO L78 Accepts]: Start accepts. Automaton has 17446 states and 22306 transitions. Word has length 173 [2022-11-25 15:30:15,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:30:15,415 INFO L495 AbstractCegarLoop]: Abstraction has 17446 states and 22306 transitions. [2022-11-25 15:30:15,415 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 12.933333333333334) internal successors, (194), 14 states have internal predecessors, (194), 6 states have call successors, (35), 4 states have call predecessors, (35), 6 states have return successors, (35), 7 states have call predecessors, (35), 6 states have call successors, (35) [2022-11-25 15:30:15,415 INFO L276 IsEmpty]: Start isEmpty. Operand 17446 states and 22306 transitions. [2022-11-25 15:30:15,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2022-11-25 15:30:15,424 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:30:15,424 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:30:15,431 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b050e35a-0ebd-4c9f-90ce-59bf7556af81/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-25 15:30:15,630 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b050e35a-0ebd-4c9f-90ce-59bf7556af81/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2022-11-25 15:30:15,631 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 15:30:15,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:30:15,631 INFO L85 PathProgramCache]: Analyzing trace with hash -1136109205, now seen corresponding path program 1 times [2022-11-25 15:30:15,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:30:15,631 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265746369] [2022-11-25 15:30:15,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:30:15,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:30:15,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:30:16,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-25 15:30:16,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:30:16,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-25 15:30:16,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:30:16,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-25 15:30:16,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:30:16,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-11-25 15:30:16,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:30:16,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-11-25 15:30:16,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:30:16,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-11-25 15:30:16,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:30:16,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-11-25 15:30:16,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:30:16,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-11-25 15:30:16,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:30:16,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-11-25 15:30:16,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:30:16,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-11-25 15:30:16,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:30:16,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-11-25 15:30:16,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:30:16,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-11-25 15:30:16,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:30:16,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-11-25 15:30:16,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:30:16,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-11-25 15:30:16,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:30:16,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2022-11-25 15:30:16,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:30:16,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2022-11-25 15:30:16,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:30:16,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2022-11-25 15:30:16,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:30:16,328 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 26 proven. 8 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2022-11-25 15:30:16,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:30:16,328 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265746369] [2022-11-25 15:30:16,328 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1265746369] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 15:30:16,328 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2000716657] [2022-11-25 15:30:16,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:30:16,329 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 15:30:16,329 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b050e35a-0ebd-4c9f-90ce-59bf7556af81/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 15:30:16,330 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b050e35a-0ebd-4c9f-90ce-59bf7556af81/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 15:30:16,354 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b050e35a-0ebd-4c9f-90ce-59bf7556af81/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-25 15:30:16,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:30:16,525 INFO L263 TraceCheckSpWp]: Trace formula consists of 793 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-25 15:30:16,529 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 15:30:16,693 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 66 proven. 4 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-11-25 15:30:16,696 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 15:30:16,869 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 23 proven. 8 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2022-11-25 15:30:16,870 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2000716657] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 15:30:16,870 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 15:30:16,870 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 15 [2022-11-25 15:30:16,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135136100] [2022-11-25 15:30:16,871 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 15:30:16,873 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-25 15:30:16,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:30:16,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-25 15:30:16,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2022-11-25 15:30:16,876 INFO L87 Difference]: Start difference. First operand 17446 states and 22306 transitions. Second operand has 15 states, 15 states have (on average 13.733333333333333) internal successors, (206), 14 states have internal predecessors, (206), 6 states have call successors, (38), 4 states have call predecessors, (38), 6 states have return successors, (38), 7 states have call predecessors, (38), 6 states have call successors, (38) [2022-11-25 15:30:30,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:30:30,149 INFO L93 Difference]: Finished difference Result 43669 states and 58357 transitions. [2022-11-25 15:30:30,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-11-25 15:30:30,150 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 13.733333333333333) internal successors, (206), 14 states have internal predecessors, (206), 6 states have call successors, (38), 4 states have call predecessors, (38), 6 states have return successors, (38), 7 states have call predecessors, (38), 6 states have call successors, (38) Word has length 182 [2022-11-25 15:30:30,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:30:30,231 INFO L225 Difference]: With dead ends: 43669 [2022-11-25 15:30:30,231 INFO L226 Difference]: Without dead ends: 26403 [2022-11-25 15:30:30,254 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 456 GetRequests, 403 SyntacticMatches, 1 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 775 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=389, Invalid=2473, Unknown=0, NotChecked=0, Total=2862 [2022-11-25 15:30:30,254 INFO L413 NwaCegarLoop]: 721 mSDtfsCounter, 1522 mSDsluCounter, 5342 mSDsCounter, 0 mSdLazyCounter, 3580 mSolverCounterSat, 734 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1522 SdHoareTripleChecker+Valid, 6063 SdHoareTripleChecker+Invalid, 4314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 734 IncrementalHoareTripleChecker+Valid, 3580 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2022-11-25 15:30:30,255 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1522 Valid, 6063 Invalid, 4314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [734 Valid, 3580 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2022-11-25 15:30:30,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26403 states. [2022-11-25 15:30:35,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26403 to 17430. [2022-11-25 15:30:35,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17430 states, 13006 states have (on average 1.2794095033061663) internal successors, (16640), 13127 states have internal predecessors, (16640), 2820 states have call successors, (2820), 1603 states have call predecessors, (2820), 1603 states have return successors, (2820), 2699 states have call predecessors, (2820), 2820 states have call successors, (2820) [2022-11-25 15:30:35,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17430 states to 17430 states and 22280 transitions. [2022-11-25 15:30:35,054 INFO L78 Accepts]: Start accepts. Automaton has 17430 states and 22280 transitions. Word has length 182 [2022-11-25 15:30:35,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:30:35,055 INFO L495 AbstractCegarLoop]: Abstraction has 17430 states and 22280 transitions. [2022-11-25 15:30:35,055 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 13.733333333333333) internal successors, (206), 14 states have internal predecessors, (206), 6 states have call successors, (38), 4 states have call predecessors, (38), 6 states have return successors, (38), 7 states have call predecessors, (38), 6 states have call successors, (38) [2022-11-25 15:30:35,055 INFO L276 IsEmpty]: Start isEmpty. Operand 17430 states and 22280 transitions. [2022-11-25 15:30:35,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2022-11-25 15:30:35,060 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:30:35,060 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:30:35,065 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b050e35a-0ebd-4c9f-90ce-59bf7556af81/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-11-25 15:30:35,261 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b050e35a-0ebd-4c9f-90ce-59bf7556af81/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2022-11-25 15:30:35,261 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 15:30:35,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:30:35,262 INFO L85 PathProgramCache]: Analyzing trace with hash -996153312, now seen corresponding path program 1 times [2022-11-25 15:30:35,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:30:35,262 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306203512] [2022-11-25 15:30:35,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:30:35,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:30:35,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:30:35,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-25 15:30:35,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:30:35,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-25 15:30:35,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:30:35,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-25 15:30:35,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:30:35,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-11-25 15:30:35,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:30:35,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-11-25 15:30:35,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:30:35,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-11-25 15:30:35,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:30:35,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-11-25 15:30:35,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:30:35,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-11-25 15:30:35,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:30:35,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-11-25 15:30:35,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:30:35,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-11-25 15:30:35,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:30:35,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-11-25 15:30:35,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:30:35,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-11-25 15:30:35,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:30:35,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-11-25 15:30:35,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:30:35,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-11-25 15:30:35,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:30:35,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2022-11-25 15:30:35,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:30:35,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2022-11-25 15:30:35,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:30:35,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2022-11-25 15:30:35,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:30:35,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2022-11-25 15:30:35,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:30:35,868 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 30 proven. 6 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2022-11-25 15:30:35,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:30:35,869 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306203512] [2022-11-25 15:30:35,869 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [306203512] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 15:30:35,869 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1034795245] [2022-11-25 15:30:35,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:30:35,869 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 15:30:35,870 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b050e35a-0ebd-4c9f-90ce-59bf7556af81/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 15:30:35,871 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b050e35a-0ebd-4c9f-90ce-59bf7556af81/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 15:30:35,876 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b050e35a-0ebd-4c9f-90ce-59bf7556af81/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-25 15:30:36,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:30:36,070 INFO L263 TraceCheckSpWp]: Trace formula consists of 811 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-25 15:30:36,074 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 15:30:36,233 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2022-11-25 15:30:36,233 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 15:30:36,233 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1034795245] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:30:36,234 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-25 15:30:36,234 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 13 [2022-11-25 15:30:36,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269544804] [2022-11-25 15:30:36,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:30:36,235 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 15:30:36,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:30:36,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 15:30:36,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2022-11-25 15:30:36,237 INFO L87 Difference]: Start difference. First operand 17430 states and 22280 transitions. Second operand has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 6 states have internal predecessors, (124), 3 states have call successors, (15), 3 states have call predecessors, (15), 4 states have return successors, (15), 4 states have call predecessors, (15), 3 states have call successors, (15) [2022-11-25 15:30:43,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:30:43,050 INFO L93 Difference]: Finished difference Result 38484 states and 50506 transitions. [2022-11-25 15:30:43,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-25 15:30:43,051 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 6 states have internal predecessors, (124), 3 states have call successors, (15), 3 states have call predecessors, (15), 4 states have return successors, (15), 4 states have call predecessors, (15), 3 states have call successors, (15) Word has length 190 [2022-11-25 15:30:43,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:30:43,096 INFO L225 Difference]: With dead ends: 38484 [2022-11-25 15:30:43,096 INFO L226 Difference]: Without dead ends: 21652 [2022-11-25 15:30:43,113 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 224 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2022-11-25 15:30:43,113 INFO L413 NwaCegarLoop]: 515 mSDtfsCounter, 592 mSDsluCounter, 1472 mSDsCounter, 0 mSdLazyCounter, 325 mSolverCounterSat, 172 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 592 SdHoareTripleChecker+Valid, 1987 SdHoareTripleChecker+Invalid, 497 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 172 IncrementalHoareTripleChecker+Valid, 325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-25 15:30:43,113 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [592 Valid, 1987 Invalid, 497 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [172 Valid, 325 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-25 15:30:43,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21652 states. [2022-11-25 15:30:47,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21652 to 17430. [2022-11-25 15:30:47,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17430 states, 13006 states have (on average 1.2723358449946178) internal successors, (16548), 13127 states have internal predecessors, (16548), 2820 states have call successors, (2820), 1603 states have call predecessors, (2820), 1603 states have return successors, (2820), 2699 states have call predecessors, (2820), 2820 states have call successors, (2820) [2022-11-25 15:30:47,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17430 states to 17430 states and 22188 transitions. [2022-11-25 15:30:47,827 INFO L78 Accepts]: Start accepts. Automaton has 17430 states and 22188 transitions. Word has length 190 [2022-11-25 15:30:47,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:30:47,828 INFO L495 AbstractCegarLoop]: Abstraction has 17430 states and 22188 transitions. [2022-11-25 15:30:47,828 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 6 states have internal predecessors, (124), 3 states have call successors, (15), 3 states have call predecessors, (15), 4 states have return successors, (15), 4 states have call predecessors, (15), 3 states have call successors, (15) [2022-11-25 15:30:47,828 INFO L276 IsEmpty]: Start isEmpty. Operand 17430 states and 22188 transitions. [2022-11-25 15:30:47,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2022-11-25 15:30:47,836 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:30:47,837 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 4, 4, 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] [2022-11-25 15:30:47,848 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b050e35a-0ebd-4c9f-90ce-59bf7556af81/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-25 15:30:48,043 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b050e35a-0ebd-4c9f-90ce-59bf7556af81/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2022-11-25 15:30:48,043 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 15:30:48,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:30:48,043 INFO L85 PathProgramCache]: Analyzing trace with hash -1498967951, now seen corresponding path program 1 times [2022-11-25 15:30:48,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:30:48,043 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237164393] [2022-11-25 15:30:48,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:30:48,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:30:48,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:30:48,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-25 15:30:48,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:30:48,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-25 15:30:48,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:30:48,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-11-25 15:30:48,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:30:48,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-11-25 15:30:48,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:30:48,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-11-25 15:30:48,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:30:48,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-11-25 15:30:48,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:30:48,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-11-25 15:30:48,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:30:48,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-11-25 15:30:48,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:30:48,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-11-25 15:30:48,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:30:48,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-11-25 15:30:48,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:30:48,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-11-25 15:30:48,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:30:48,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-11-25 15:30:48,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:30:48,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2022-11-25 15:30:48,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:30:48,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2022-11-25 15:30:48,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:30:48,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-11-25 15:30:48,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:30:48,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2022-11-25 15:30:48,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:30:48,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2022-11-25 15:30:48,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:30:48,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2022-11-25 15:30:48,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:30:48,508 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 21 proven. 26 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2022-11-25 15:30:48,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:30:48,509 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237164393] [2022-11-25 15:30:48,509 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1237164393] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 15:30:48,509 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [808731261] [2022-11-25 15:30:48,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:30:48,509 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 15:30:48,510 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b050e35a-0ebd-4c9f-90ce-59bf7556af81/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 15:30:48,511 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b050e35a-0ebd-4c9f-90ce-59bf7556af81/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 15:30:48,523 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b050e35a-0ebd-4c9f-90ce-59bf7556af81/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-25 15:30:48,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:30:48,719 INFO L263 TraceCheckSpWp]: Trace formula consists of 816 conjuncts, 16 conjunts are in the unsatisfiable core [2022-11-25 15:30:48,723 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 15:30:49,032 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 62 proven. 60 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-11-25 15:30:49,032 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 15:30:49,304 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 21 proven. 26 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2022-11-25 15:30:49,304 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [808731261] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 15:30:49,304 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 15:30:49,304 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 12 [2022-11-25 15:30:49,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144394736] [2022-11-25 15:30:49,305 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 15:30:49,305 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-25 15:30:49,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:30:49,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-25 15:30:49,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2022-11-25 15:30:49,307 INFO L87 Difference]: Start difference. First operand 17430 states and 22188 transitions. Second operand has 12 states, 12 states have (on average 15.916666666666666) internal successors, (191), 11 states have internal predecessors, (191), 5 states have call successors, (37), 4 states have call predecessors, (37), 7 states have return successors, (37), 6 states have call predecessors, (37), 5 states have call successors, (37) [2022-11-25 15:30:56,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:30:56,412 INFO L93 Difference]: Finished difference Result 33603 states and 43202 transitions. [2022-11-25 15:30:56,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-25 15:30:56,412 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 15.916666666666666) internal successors, (191), 11 states have internal predecessors, (191), 5 states have call successors, (37), 4 states have call predecessors, (37), 7 states have return successors, (37), 6 states have call predecessors, (37), 5 states have call successors, (37) Word has length 194 [2022-11-25 15:30:56,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:30:56,466 INFO L225 Difference]: With dead ends: 33603 [2022-11-25 15:30:56,466 INFO L226 Difference]: Without dead ends: 19680 [2022-11-25 15:30:56,485 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 450 GetRequests, 421 SyntacticMatches, 4 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=167, Invalid=535, Unknown=0, NotChecked=0, Total=702 [2022-11-25 15:30:56,485 INFO L413 NwaCegarLoop]: 729 mSDtfsCounter, 920 mSDsluCounter, 3031 mSDsCounter, 0 mSdLazyCounter, 672 mSolverCounterSat, 277 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 932 SdHoareTripleChecker+Valid, 3760 SdHoareTripleChecker+Invalid, 949 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 277 IncrementalHoareTripleChecker+Valid, 672 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-25 15:30:56,486 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [932 Valid, 3760 Invalid, 949 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [277 Valid, 672 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-25 15:30:56,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19680 states. [2022-11-25 15:31:01,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19680 to 17430. [2022-11-25 15:31:01,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17430 states, 13006 states have (on average 1.2678763647547286) internal successors, (16490), 13127 states have internal predecessors, (16490), 2820 states have call successors, (2820), 1603 states have call predecessors, (2820), 1603 states have return successors, (2820), 2699 states have call predecessors, (2820), 2820 states have call successors, (2820) [2022-11-25 15:31:01,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17430 states to 17430 states and 22130 transitions. [2022-11-25 15:31:01,468 INFO L78 Accepts]: Start accepts. Automaton has 17430 states and 22130 transitions. Word has length 194 [2022-11-25 15:31:01,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:31:01,468 INFO L495 AbstractCegarLoop]: Abstraction has 17430 states and 22130 transitions. [2022-11-25 15:31:01,469 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 15.916666666666666) internal successors, (191), 11 states have internal predecessors, (191), 5 states have call successors, (37), 4 states have call predecessors, (37), 7 states have return successors, (37), 6 states have call predecessors, (37), 5 states have call successors, (37) [2022-11-25 15:31:01,469 INFO L276 IsEmpty]: Start isEmpty. Operand 17430 states and 22130 transitions. [2022-11-25 15:31:01,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2022-11-25 15:31:01,476 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:31:01,476 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:31:01,484 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b050e35a-0ebd-4c9f-90ce-59bf7556af81/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-25 15:31:01,677 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b050e35a-0ebd-4c9f-90ce-59bf7556af81/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2022-11-25 15:31:01,678 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 15:31:01,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:31:01,678 INFO L85 PathProgramCache]: Analyzing trace with hash -469535662, now seen corresponding path program 1 times [2022-11-25 15:31:01,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:31:01,678 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994962272] [2022-11-25 15:31:01,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:31:01,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:31:01,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:31:02,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-25 15:31:02,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:31:02,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-25 15:31:02,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:31:02,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-11-25 15:31:02,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:31:02,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-11-25 15:31:02,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:31:02,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-11-25 15:31:02,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:31:02,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-11-25 15:31:02,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:31:02,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-11-25 15:31:02,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:31:02,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-11-25 15:31:02,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:31:02,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-11-25 15:31:02,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:31:02,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-11-25 15:31:02,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:31:02,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-11-25 15:31:02,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:31:02,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-11-25 15:31:02,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:31:02,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2022-11-25 15:31:02,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:31:02,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2022-11-25 15:31:02,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:31:02,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-11-25 15:31:02,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:31:02,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2022-11-25 15:31:02,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:31:02,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2022-11-25 15:31:02,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:31:02,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2022-11-25 15:31:02,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:31:02,144 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2022-11-25 15:31:02,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:31:02,144 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994962272] [2022-11-25 15:31:02,145 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [994962272] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:31:02,145 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:31:02,145 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-25 15:31:02,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140859901] [2022-11-25 15:31:02,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:31:02,147 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 15:31:02,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:31:02,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 15:31:02,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-25 15:31:02,149 INFO L87 Difference]: Start difference. First operand 17430 states and 22130 transitions. Second operand has 7 states, 7 states have (on average 16.571428571428573) internal successors, (116), 6 states have internal predecessors, (116), 3 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (18), 3 states have call predecessors, (18), 2 states have call successors, (18) [2022-11-25 15:31:09,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:31:09,485 INFO L93 Difference]: Finished difference Result 34929 states and 45576 transitions. [2022-11-25 15:31:09,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-25 15:31:09,486 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.571428571428573) internal successors, (116), 6 states have internal predecessors, (116), 3 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (18), 3 states have call predecessors, (18), 2 states have call successors, (18) Word has length 194 [2022-11-25 15:31:09,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:31:09,531 INFO L225 Difference]: With dead ends: 34929 [2022-11-25 15:31:09,531 INFO L226 Difference]: Without dead ends: 21157 [2022-11-25 15:31:09,546 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2022-11-25 15:31:09,546 INFO L413 NwaCegarLoop]: 502 mSDtfsCounter, 603 mSDsluCounter, 1600 mSDsCounter, 0 mSdLazyCounter, 372 mSolverCounterSat, 165 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 606 SdHoareTripleChecker+Valid, 2102 SdHoareTripleChecker+Invalid, 537 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 165 IncrementalHoareTripleChecker+Valid, 372 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-25 15:31:09,546 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [606 Valid, 2102 Invalid, 537 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [165 Valid, 372 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-25 15:31:09,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21157 states. [2022-11-25 15:31:14,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21157 to 17418. [2022-11-25 15:31:14,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17418 states, 12994 states have (on average 1.2662767431122057) internal successors, (16454), 13115 states have internal predecessors, (16454), 2820 states have call successors, (2820), 1603 states have call predecessors, (2820), 1603 states have return successors, (2820), 2699 states have call predecessors, (2820), 2820 states have call successors, (2820) [2022-11-25 15:31:14,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17418 states to 17418 states and 22094 transitions. [2022-11-25 15:31:14,453 INFO L78 Accepts]: Start accepts. Automaton has 17418 states and 22094 transitions. Word has length 194 [2022-11-25 15:31:14,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:31:14,454 INFO L495 AbstractCegarLoop]: Abstraction has 17418 states and 22094 transitions. [2022-11-25 15:31:14,454 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.571428571428573) internal successors, (116), 6 states have internal predecessors, (116), 3 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (18), 3 states have call predecessors, (18), 2 states have call successors, (18) [2022-11-25 15:31:14,454 INFO L276 IsEmpty]: Start isEmpty. Operand 17418 states and 22094 transitions. [2022-11-25 15:31:14,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2022-11-25 15:31:14,461 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:31:14,461 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 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, 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] [2022-11-25 15:31:14,461 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2022-11-25 15:31:14,461 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 15:31:14,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:31:14,461 INFO L85 PathProgramCache]: Analyzing trace with hash -66218514, now seen corresponding path program 1 times [2022-11-25 15:31:14,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:31:14,461 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248539511] [2022-11-25 15:31:14,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:31:14,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:31:14,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 15:31:14,514 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 15:31:14,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 15:31:14,673 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-25 15:31:14,673 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-11-25 15:31:14,674 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-25 15:31:14,676 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2022-11-25 15:31:14,682 INFO L445 BasicCegarLoop]: Path program 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] [2022-11-25 15:31:14,688 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-25 15:31:14,871 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 03:31:14 BoogieIcfgContainer [2022-11-25 15:31:14,871 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-25 15:31:14,872 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-25 15:31:14,872 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-25 15:31:14,872 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-25 15:31:14,873 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 03:27:09" (3/4) ... [2022-11-25 15:31:14,876 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-25 15:31:15,091 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b050e35a-0ebd-4c9f-90ce-59bf7556af81/bin/uautomizer-ZsLfNo2U6R/witness.graphml [2022-11-25 15:31:15,092 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-25 15:31:15,092 INFO L158 Benchmark]: Toolchain (without parser) took 247802.08ms. Allocated memory was 157.3MB in the beginning and 4.9GB in the end (delta: 4.8GB). Free memory was 116.7MB in the beginning and 2.1GB in the end (delta: -2.0GB). Peak memory consumption was 2.8GB. Max. memory is 16.1GB. [2022-11-25 15:31:15,093 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 157.3MB. Free memory is still 127.2MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 15:31:15,093 INFO L158 Benchmark]: CACSL2BoogieTranslator took 576.93ms. Allocated memory is still 157.3MB. Free memory was 116.7MB in the beginning and 98.8MB in the end (delta: 17.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-11-25 15:31:15,093 INFO L158 Benchmark]: Boogie Procedure Inliner took 92.87ms. Allocated memory is still 157.3MB. Free memory was 98.8MB in the beginning and 95.3MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-25 15:31:15,094 INFO L158 Benchmark]: Boogie Preprocessor took 78.81ms. Allocated memory is still 157.3MB. Free memory was 95.3MB in the beginning and 92.6MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-25 15:31:15,094 INFO L158 Benchmark]: RCFGBuilder took 989.14ms. Allocated memory is still 157.3MB. Free memory was 92.6MB in the beginning and 60.7MB in the end (delta: 31.9MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2022-11-25 15:31:15,094 INFO L158 Benchmark]: TraceAbstraction took 245833.28ms. Allocated memory was 157.3MB in the beginning and 4.9GB in the end (delta: 4.8GB). Free memory was 60.1MB in the beginning and 2.1GB in the end (delta: -2.1GB). Peak memory consumption was 2.7GB. Max. memory is 16.1GB. [2022-11-25 15:31:15,094 INFO L158 Benchmark]: Witness Printer took 220.11ms. Allocated memory is still 4.9GB. Free memory was 2.1GB in the beginning and 2.1GB in the end (delta: 34.4MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2022-11-25 15:31:15,096 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.27ms. Allocated memory is still 157.3MB. Free memory is still 127.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 576.93ms. Allocated memory is still 157.3MB. Free memory was 116.7MB in the beginning and 98.8MB in the end (delta: 17.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 92.87ms. Allocated memory is still 157.3MB. Free memory was 98.8MB in the beginning and 95.3MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 78.81ms. Allocated memory is still 157.3MB. Free memory was 95.3MB in the beginning and 92.6MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 989.14ms. Allocated memory is still 157.3MB. Free memory was 92.6MB in the beginning and 60.7MB in the end (delta: 31.9MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * TraceAbstraction took 245833.28ms. Allocated memory was 157.3MB in the beginning and 4.9GB in the end (delta: 4.8GB). Free memory was 60.1MB in the beginning and 2.1GB in the end (delta: -2.1GB). Peak memory consumption was 2.7GB. Max. memory is 16.1GB. * Witness Printer took 220.11ms. Allocated memory is still 4.9GB. Free memory was 2.1GB in the beginning and 2.1GB in the end (delta: 34.4MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 619]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L24] msg_t nomsg = (msg_t )-1; [L25] port_t cs1 ; [L26] int8_t cs1_old ; [L27] int8_t cs1_new ; [L28] port_t cs2 ; [L29] int8_t cs2_old ; [L30] int8_t cs2_new ; [L31] port_t s1s2 ; [L32] int8_t s1s2_old ; [L33] int8_t s1s2_new ; [L34] port_t s1s1 ; [L35] int8_t s1s1_old ; [L36] int8_t s1s1_new ; [L37] port_t s2s1 ; [L38] int8_t s2s1_old ; [L39] int8_t s2s1_new ; [L40] port_t s2s2 ; [L41] int8_t s2s2_old ; [L42] int8_t s2s2_new ; [L43] port_t s1p ; [L44] int8_t s1p_old ; [L45] int8_t s1p_new ; [L46] port_t s2p ; [L47] int8_t s2p_old ; [L48] int8_t s2p_new ; [L51] _Bool side1Failed ; [L52] _Bool side2Failed ; [L53] msg_t side1_written ; [L54] msg_t side2_written ; [L60] static _Bool side1Failed_History_0 ; [L61] static _Bool side1Failed_History_1 ; [L62] static _Bool side1Failed_History_2 ; [L63] static _Bool side2Failed_History_0 ; [L64] static _Bool side2Failed_History_1 ; [L65] static _Bool side2Failed_History_2 ; [L66] static int8_t active_side_History_0 ; [L67] static int8_t active_side_History_1 ; [L68] static int8_t active_side_History_2 ; [L69] static msg_t manual_selection_History_0 ; [L70] static msg_t manual_selection_History_1 ; [L71] static msg_t manual_selection_History_2 ; VAL [active_side_History_0=0, active_side_History_1=0, active_side_History_2=0, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L542] int c1 ; [L543] int i2 ; [L546] c1 = 0 [L547] side1Failed = __VERIFIER_nondet_bool() [L548] side2Failed = __VERIFIER_nondet_bool() [L549] side1_written = __VERIFIER_nondet_char() [L550] side2_written = __VERIFIER_nondet_char() [L551] side1Failed_History_0 = __VERIFIER_nondet_bool() [L552] side1Failed_History_1 = __VERIFIER_nondet_bool() [L553] side1Failed_History_2 = __VERIFIER_nondet_bool() [L554] side2Failed_History_0 = __VERIFIER_nondet_bool() [L555] side2Failed_History_1 = __VERIFIER_nondet_bool() [L556] side2Failed_History_2 = __VERIFIER_nondet_bool() [L557] active_side_History_0 = __VERIFIER_nondet_char() [L558] active_side_History_1 = __VERIFIER_nondet_char() [L559] active_side_History_2 = __VERIFIER_nondet_char() [L560] manual_selection_History_0 = __VERIFIER_nondet_char() [L561] manual_selection_History_1 = __VERIFIER_nondet_char() [L562] manual_selection_History_2 = __VERIFIER_nondet_char() [L563] CALL, EXPR init() [L197] COND FALSE !((int )side1Failed_History_0 != 0) VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=0, side1Failed_History_0=0, side2_written=0] [L200] COND FALSE !((int )side2Failed_History_0 != 0) VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=0, side1Failed_History_0=0, side2_written=0, side2Failed_History_0=0] [L203] COND FALSE !((int )active_side_History_0 != -2) VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=0, side1Failed_History_0=0, side2_written=0, side2Failed_History_0=0] [L206] COND FALSE !((int )manual_selection_History_0 != 0) VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=0, side1Failed_History_0=0, side2_written=0, side2Failed_History_0=0] [L209] COND FALSE !((int )side1Failed_History_1 != 0) VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=0, side1Failed_History_0=0, side1Failed_History_1=0, side2_written=0, side2Failed_History_0=0] [L212] COND FALSE !((int )side2Failed_History_1 != 0) VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=0, side1Failed_History_0=0, side1Failed_History_1=0, side2_written=0, side2Failed_History_0=0, side2Failed_History_1=0] [L215] COND FALSE !((int )active_side_History_1 != -2) VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=0, side1Failed_History_0=0, side1Failed_History_1=0, side2_written=0, side2Failed_History_0=0, side2Failed_History_1=0] [L218] COND FALSE !((int )manual_selection_History_1 != 0) VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=0, side1Failed_History_0=0, side1Failed_History_1=0, side2_written=0, side2Failed_History_0=0, side2Failed_History_1=0] [L221] COND FALSE !((int )side1Failed_History_2 != 0) VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed_History_0=0, side2Failed_History_1=0] [L224] COND FALSE !((int )side2Failed_History_2 != 0) VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L227] COND FALSE !((int )active_side_History_2 != -2) VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L230] COND FALSE !((int )manual_selection_History_2 != 0) [L233] return (1); VAL [\result=1, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L563] RET, EXPR init() [L563] i2 = init() [L564] CALL assume_abort_if_not(i2) VAL [\old(cond)=1, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L58] COND FALSE !(!cond) VAL [\old(cond)=1, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cond=1, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L564] RET assume_abort_if_not(i2) VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, c1=0, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, i2=1, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L565] cs1_old = nomsg [L566] cs1_new = nomsg [L567] cs2_old = nomsg [L568] cs2_new = nomsg [L569] s1s2_old = nomsg [L570] s1s2_new = nomsg [L571] s1s1_old = nomsg [L572] s1s1_new = nomsg [L573] s2s1_old = nomsg [L574] s2s1_new = nomsg [L575] s2s2_old = nomsg [L576] s2s2_new = nomsg [L577] s1p_old = nomsg [L578] s1p_new = nomsg [L579] s2p_old = nomsg [L580] s2p_new = nomsg [L581] i2 = 0 VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, c1=0, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, i2=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L582] COND TRUE i2 < 10 [L584] CALL Console_task_each_pals_period() [L251] msg_t manual_selection ; [L252] char tmp ; [L255] tmp = __VERIFIER_nondet_char() [L256] manual_selection = tmp [L257] CALL write_manual_selection_history(manual_selection) [L167] manual_selection_History_2 = manual_selection_History_1 [L168] manual_selection_History_1 = manual_selection_History_0 [L169] manual_selection_History_0 = val VAL [\old(val)=-1, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, val=-1] [L257] RET write_manual_selection_history(manual_selection) [L258] cs1_new = manual_selection != nomsg && cs1_new == nomsg ? manual_selection : cs1_new [L259] cs2_new = manual_selection != nomsg && cs2_new == nomsg ? manual_selection : cs2_new [L260] manual_selection = (msg_t )0 VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection=0, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=-1] [L584] RET Console_task_each_pals_period() [L585] CALL Side1_activestandby_task_each_pals_period() [L266] int8_t side1 ; [L267] int8_t side2 ; [L268] msg_t manual_selection ; [L269] int8_t next_state ; [L272] side1 = nomsg [L273] side2 = nomsg [L274] manual_selection = (msg_t )0 [L275] side1Failed = __VERIFIER_nondet_bool() [L276] CALL write_side1_failed_history(side1Failed) [L77] side1Failed_History_2 = side1Failed_History_1 [L78] side1Failed_History_1 = side1Failed_History_0 [L79] side1Failed_History_0 = val VAL [\old(val)=1, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=0, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, val=1] [L276] RET write_side1_failed_history(side1Failed) [L277] COND TRUE \read(side1Failed) [L278] s1s1_new = nomsg != nomsg && s1s1_new == nomsg ? nomsg : s1s1_new [L279] s1s2_new = nomsg != nomsg && s1s2_new == nomsg ? nomsg : s1s2_new [L280] s1p_new = nomsg != nomsg && s1p_new == nomsg ? nomsg : s1p_new [L281] side1_written = nomsg VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection=0, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2=-1, side2_written=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L585] RET Side1_activestandby_task_each_pals_period() [L586] CALL Side2_activestandby_task_each_pals_period() [L323] int8_t side1 ; [L324] int8_t side2 ; [L325] msg_t manual_selection ; [L326] int8_t next_state ; [L329] side1 = nomsg [L330] side2 = nomsg [L331] manual_selection = (msg_t )0 [L332] side2Failed = __VERIFIER_nondet_bool() [L333] CALL write_side2_failed_history(side2Failed) [L107] side2Failed_History_2 = side2Failed_History_1 [L108] side2Failed_History_1 = side2Failed_History_0 [L109] side2Failed_History_0 = val VAL [\old(val)=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, val=0] [L333] RET write_side2_failed_history(side2Failed) [L334] COND FALSE !(\read(side2Failed)) [L341] side1 = s1s2_old [L342] s1s2_old = nomsg [L343] side2 = s2s2_old [L344] s2s2_old = nomsg [L345] manual_selection = cs2_old [L346] cs2_old = nomsg VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2=-1, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L347] COND TRUE (int )side1 == (int )side2 [L348] next_state = (int8_t )0 VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, next_state=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2=-1, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L371] s2s1_new = next_state != nomsg && s2s1_new == nomsg ? next_state : s2s1_new [L372] s2s2_new = next_state != nomsg && s2s2_new == nomsg ? next_state : s2s2_new [L373] s2p_new = next_state != nomsg && s2p_new == nomsg ? next_state : s2p_new [L374] side2_written = next_state VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, next_state=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=0, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=-1, s2s2=0, s2s2_new=0, s2s2_old=-1, side1=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2=-1, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L586] RET Side2_activestandby_task_each_pals_period() [L587] CALL Pendulum_prism_task_each_pals_period() [L380] int8_t active_side ; [L381] int8_t tmp ; [L382] int8_t side1 ; [L383] int8_t side2 ; VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=0, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=-1, s2s2=0, s2s2_new=0, s2s2_old=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L386] CALL, EXPR read_active_side_history((unsigned char)0) VAL [\old(index)=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=0, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=-1, s2s2=0, s2s2_new=0, s2s2_old=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L148] COND TRUE (int )index == 0 [L149] return (active_side_History_0); VAL [\old(index)=0, \result=-2, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, index=0, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=0, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=-1, s2s2=0, s2s2_new=0, s2s2_old=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L386] RET, EXPR read_active_side_history((unsigned char)0) VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, read_active_side_history((unsigned char)0)=-2, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=0, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=-1, s2s2=0, s2s2_new=0, s2s2_old=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L386] tmp = read_active_side_history((unsigned char)0) [L387] active_side = tmp [L388] side1 = nomsg [L389] side2 = nomsg [L390] side1 = s1p_old [L391] s1p_old = nomsg [L392] side2 = s2p_old [L393] s2p_old = nomsg VAL [active_side=-2, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=0, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=-1, s2s2=0, s2s2_new=0, s2s2_old=-1, side1=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2=-1, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=-2] [L394] COND FALSE !((int )side1 == 1) VAL [active_side=-2, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=0, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=-1, s2s2=0, s2s2_new=0, s2s2_old=-1, side1=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2=-1, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=-2] [L397] COND FALSE !((int )side2 == 1) VAL [active_side=-2, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=0, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=-1, s2s2=0, s2s2_new=0, s2s2_old=-1, side1=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2=-1, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=-2] [L400] COND FALSE !((int )side1 == 0) VAL [active_side=-2, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=0, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=-1, s2s2=0, s2s2_new=0, s2s2_old=-1, side1=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2=-1, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=-2] [L408] COND TRUE (int )side1 == (int )nomsg VAL [active_side=-2, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=0, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=-1, s2s2=0, s2s2_new=0, s2s2_old=-1, side1=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2=-1, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=-2] [L409] COND FALSE !((int )side2 == 0) [L412] active_side = (int8_t )0 VAL [active_side=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=0, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=-1, s2s2=0, s2s2_new=0, s2s2_old=-1, side1=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2=-1, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=-2] [L417] CALL write_active_side_history(active_side) [L137] active_side_History_2 = active_side_History_1 [L138] active_side_History_1 = active_side_History_0 [L139] active_side_History_0 = val VAL [\old(val)=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=0, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=-1, s2s2=0, s2s2_new=0, s2s2_old=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, val=0] [L417] RET write_active_side_history(active_side) [L587] RET Pendulum_prism_task_each_pals_period() [L588] cs1_old = cs1_new [L589] cs1_new = nomsg [L590] cs2_old = cs2_new [L591] cs2_new = nomsg [L592] s1s2_old = s1s2_new [L593] s1s2_new = nomsg [L594] s1s1_old = s1s1_new [L595] s1s1_new = nomsg [L596] s2s1_old = s2s1_new [L597] s2s1_new = nomsg [L598] s2s2_old = s2s2_new [L599] s2s2_new = nomsg [L600] s1p_old = s1p_new [L601] s1p_new = nomsg [L602] s2p_old = s2p_new [L603] s2p_new = nomsg [L604] CALL, EXPR check() [L423] int tmp ; [L424] msg_t tmp___0 ; [L425] _Bool tmp___1 ; [L426] _Bool tmp___2 ; [L427] _Bool tmp___3 ; [L428] _Bool tmp___4 ; [L429] int8_t tmp___5 ; [L430] _Bool tmp___6 ; [L431] _Bool tmp___7 ; [L432] _Bool tmp___8 ; [L433] int8_t tmp___9 ; [L434] _Bool tmp___10 ; [L435] _Bool tmp___11 ; [L436] _Bool tmp___12 ; [L437] msg_t tmp___13 ; [L438] _Bool tmp___14 ; [L439] _Bool tmp___15 ; [L440] _Bool tmp___16 ; [L441] _Bool tmp___17 ; [L442] int8_t tmp___18 ; [L443] int8_t tmp___19 ; [L444] int8_t tmp___20 ; VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L447] COND FALSE !(! side1Failed) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L450] COND TRUE ! side2Failed [L451] tmp = 1 VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1] [L455] CALL assume_abort_if_not((_Bool )tmp) VAL [\old(cond)=1, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L58] COND FALSE !(!cond) VAL [\old(cond)=1, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cond=1, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L455] RET assume_abort_if_not((_Bool )tmp) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1] [L456] CALL, EXPR read_manual_selection_history((unsigned char)1) VAL [\old(index)=1, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L178] COND FALSE !((int )index == 0) VAL [\old(index)=1, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, index=1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L181] COND TRUE (int )index == 1 [L182] return (manual_selection_History_1); VAL [\old(index)=1, \result=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, index=1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L456] RET, EXPR read_manual_selection_history((unsigned char)1) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, read_manual_selection_history((unsigned char)1)=0, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1] [L456] tmp___0 = read_manual_selection_history((unsigned char)1) [L457] COND TRUE ! tmp___0 VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0] [L458] CALL, EXPR read_side1_failed_history((unsigned char)1) VAL [\old(index)=1, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L88] COND FALSE !((int )index == 0) VAL [\old(index)=1, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, index=1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L91] COND TRUE (int )index == 1 [L92] return (side1Failed_History_1); VAL [\old(index)=1, \result=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, index=1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L458] RET, EXPR read_side1_failed_history((unsigned char)1) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, read_side1_failed_history((unsigned char)1)=0, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0] [L458] tmp___1 = read_side1_failed_history((unsigned char)1) [L459] COND TRUE ! tmp___1 VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0, tmp___1=0] [L460] CALL, EXPR read_side1_failed_history((unsigned char)0) VAL [\old(index)=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L88] COND TRUE (int )index == 0 [L89] return (side1Failed_History_0); VAL [\old(index)=0, \result=-255, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, index=0, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L460] RET, EXPR read_side1_failed_history((unsigned char)0) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, read_side1_failed_history((unsigned char)0)=-255, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0, tmp___1=0] [L460] tmp___2 = read_side1_failed_history((unsigned char)0) [L461] COND FALSE !(! tmp___2) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0, tmp___1=0, tmp___2=1] [L486] CALL, EXPR read_side1_failed_history((unsigned char)1) VAL [\old(index)=1, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L88] COND FALSE !((int )index == 0) VAL [\old(index)=1, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, index=1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L91] COND TRUE (int )index == 1 [L92] return (side1Failed_History_1); VAL [\old(index)=1, \result=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, index=1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L486] RET, EXPR read_side1_failed_history((unsigned char)1) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, read_side1_failed_history((unsigned char)1)=0, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0, tmp___1=0, tmp___2=1] [L486] tmp___7 = read_side1_failed_history((unsigned char)1) [L487] COND FALSE !(\read(tmp___7)) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0, tmp___1=0, tmp___2=1, tmp___7=0] [L502] CALL, EXPR read_side1_failed_history((unsigned char)1) VAL [\old(index)=1, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L88] COND FALSE !((int )index == 0) VAL [\old(index)=1, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, index=1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L91] COND TRUE (int )index == 1 [L92] return (side1Failed_History_1); VAL [\old(index)=1, \result=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, index=1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L502] RET, EXPR read_side1_failed_history((unsigned char)1) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, read_side1_failed_history((unsigned char)1)=0, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0, tmp___1=0, tmp___2=1, tmp___7=0] [L502] tmp___11 = read_side1_failed_history((unsigned char)1) [L503] COND TRUE ! tmp___11 VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0, tmp___1=0, tmp___11=0, tmp___2=1, tmp___7=0] [L504] CALL, EXPR read_side2_failed_history((unsigned char)1) VAL [\old(index)=1, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L118] COND FALSE !((int )index == 0) VAL [\old(index)=1, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, index=1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L121] COND TRUE (int )index == 1 [L122] return (side2Failed_History_1); VAL [\old(index)=1, \result=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, index=1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L504] RET, EXPR read_side2_failed_history((unsigned char)1) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, read_side2_failed_history((unsigned char)1)=0, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0, tmp___1=0, tmp___11=0, tmp___2=1, tmp___7=0] [L504] tmp___12 = read_side2_failed_history((unsigned char)1) [L505] COND FALSE !(\read(tmp___12)) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0, tmp___1=0, tmp___11=0, tmp___12=0, tmp___2=1, tmp___7=0] [L518] CALL, EXPR read_active_side_history((unsigned char)2) VAL [\old(index)=2, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L148] COND FALSE !((int )index == 0) VAL [\old(index)=2, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, index=2, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L151] COND FALSE !((int )index == 1) VAL [\old(index)=2, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, index=2, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L154] COND TRUE (int )index == 2 [L155] return (active_side_History_2); VAL [\old(index)=2, \result=-2, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, index=2, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L518] RET, EXPR read_active_side_history((unsigned char)2) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, read_active_side_history((unsigned char)2)=-2, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0, tmp___1=0, tmp___11=0, tmp___12=0, tmp___2=1, tmp___7=0] [L518] tmp___20 = read_active_side_history((unsigned char)2) [L519] COND FALSE !((int )tmp___20 > -2) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0, tmp___1=0, tmp___11=0, tmp___12=0, tmp___2=1, tmp___20=-2, tmp___7=0] [L537] return (1); VAL [\result=1, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0, tmp___1=0, tmp___11=0, tmp___12=0, tmp___2=1, tmp___20=-2, tmp___7=0] [L604] RET, EXPR check() [L604] c1 = check() [L605] CALL assert(c1) VAL [\old(arg)=1, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L617] COND FALSE !(! arg) VAL [\old(arg)=1, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, arg=1, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L605] RET assert(c1) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, c1=1, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, i2=0, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L606] i2 ++ VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, c1=1, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, i2=1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L582] COND TRUE i2 < 10 [L584] CALL Console_task_each_pals_period() [L251] msg_t manual_selection ; [L252] char tmp ; [L255] tmp = __VERIFIER_nondet_char() [L256] manual_selection = tmp [L257] CALL write_manual_selection_history(manual_selection) [L167] manual_selection_History_2 = manual_selection_History_1 [L168] manual_selection_History_1 = manual_selection_History_0 [L169] manual_selection_History_0 = val VAL [\old(val)=4, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=4, manual_selection_History_1=-1, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, val=4] [L257] RET write_manual_selection_history(manual_selection) [L258] cs1_new = manual_selection != nomsg && cs1_new == nomsg ? manual_selection : cs1_new [L259] cs2_new = manual_selection != nomsg && cs2_new == nomsg ? manual_selection : cs2_new [L260] manual_selection = (msg_t )0 VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=4, cs1_old=-1, cs2=0, cs2_new=4, cs2_old=-1, manual_selection=0, manual_selection_History_0=4, manual_selection_History_1=-1, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=4] [L584] RET Console_task_each_pals_period() [L585] CALL Side1_activestandby_task_each_pals_period() [L266] int8_t side1 ; [L267] int8_t side2 ; [L268] msg_t manual_selection ; [L269] int8_t next_state ; [L272] side1 = nomsg [L273] side2 = nomsg [L274] manual_selection = (msg_t )0 [L275] side1Failed = __VERIFIER_nondet_bool() [L276] CALL write_side1_failed_history(side1Failed) [L77] side1Failed_History_2 = side1Failed_History_1 [L78] side1Failed_History_1 = side1Failed_History_0 [L79] side1Failed_History_0 = val VAL [\old(val)=1, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=4, cs1_old=-1, cs2=0, cs2_new=4, cs2_old=-1, manual_selection_History_0=4, manual_selection_History_1=-1, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, val=1] [L276] RET write_side1_failed_history(side1Failed) [L277] COND TRUE \read(side1Failed) [L278] s1s1_new = nomsg != nomsg && s1s1_new == nomsg ? nomsg : s1s1_new [L279] s1s2_new = nomsg != nomsg && s1s2_new == nomsg ? nomsg : s1s2_new [L280] s1p_new = nomsg != nomsg && s1p_new == nomsg ? nomsg : s1p_new [L281] side1_written = nomsg VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=4, cs1_old=-1, cs2=0, cs2_new=4, cs2_old=-1, manual_selection=0, manual_selection_History_0=4, manual_selection_History_1=-1, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2=-1, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L585] RET Side1_activestandby_task_each_pals_period() [L586] CALL Side2_activestandby_task_each_pals_period() [L323] int8_t side1 ; [L324] int8_t side2 ; [L325] msg_t manual_selection ; [L326] int8_t next_state ; [L329] side1 = nomsg [L330] side2 = nomsg [L331] manual_selection = (msg_t )0 [L332] side2Failed = __VERIFIER_nondet_bool() [L333] CALL write_side2_failed_history(side2Failed) [L107] side2Failed_History_2 = side2Failed_History_1 [L108] side2Failed_History_1 = side2Failed_History_0 [L109] side2Failed_History_0 = val VAL [\old(val)=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=4, cs1_old=-1, cs2=0, cs2_new=4, cs2_old=-1, manual_selection_History_0=4, manual_selection_History_1=-1, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, val=0] [L333] RET write_side2_failed_history(side2Failed) [L334] COND FALSE !(\read(side2Failed)) [L341] side1 = s1s2_old [L342] s1s2_old = nomsg [L343] side2 = s2s2_old [L344] s2s2_old = nomsg [L345] manual_selection = cs2_old [L346] cs2_old = nomsg VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=4, cs1_old=-1, cs2=0, cs2_new=4, cs2_old=-1, manual_selection=-1, manual_selection_History_0=4, manual_selection_History_1=-1, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L347] COND FALSE !((int )side1 == (int )side2) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=4, cs1_old=-1, cs2=0, cs2_new=4, cs2_old=-1, manual_selection=-1, manual_selection_History_0=4, manual_selection_History_1=-1, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L350] COND TRUE (int )side1 == (int )nomsg VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=4, cs1_old=-1, cs2=0, cs2_new=4, cs2_old=-1, manual_selection=-1, manual_selection_History_0=4, manual_selection_History_1=-1, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L351] COND TRUE (int )side2 != (int )nomsg [L352] next_state = (int8_t )0 VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=4, cs1_old=-1, cs2=0, cs2_new=4, cs2_old=-1, manual_selection=-1, manual_selection_History_0=4, manual_selection_History_1=-1, manual_selection_History_2=0, next_state=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L371] s2s1_new = next_state != nomsg && s2s1_new == nomsg ? next_state : s2s1_new [L372] s2s2_new = next_state != nomsg && s2s2_new == nomsg ? next_state : s2s2_new [L373] s2p_new = next_state != nomsg && s2p_new == nomsg ? next_state : s2p_new [L374] side2_written = next_state VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=4, cs1_old=-1, cs2=0, cs2_new=4, cs2_old=-1, manual_selection=-1, manual_selection_History_0=4, manual_selection_History_1=-1, manual_selection_History_2=0, next_state=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=-1, side1=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L586] RET Side2_activestandby_task_each_pals_period() [L587] CALL Pendulum_prism_task_each_pals_period() [L380] int8_t active_side ; [L381] int8_t tmp ; [L382] int8_t side1 ; [L383] int8_t side2 ; VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=4, cs1_old=-1, cs2=0, cs2_new=4, cs2_old=-1, manual_selection_History_0=4, manual_selection_History_1=-1, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L386] CALL, EXPR read_active_side_history((unsigned char)0) VAL [\old(index)=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=4, cs1_old=-1, cs2=0, cs2_new=4, cs2_old=-1, manual_selection_History_0=4, manual_selection_History_1=-1, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L148] COND TRUE (int )index == 0 [L149] return (active_side_History_0); VAL [\old(index)=0, \result=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=4, cs1_old=-1, cs2=0, cs2_new=4, cs2_old=-1, index=0, manual_selection_History_0=4, manual_selection_History_1=-1, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L386] RET, EXPR read_active_side_history((unsigned char)0) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=4, cs1_old=-1, cs2=0, cs2_new=4, cs2_old=-1, manual_selection_History_0=4, manual_selection_History_1=-1, manual_selection_History_2=0, nomsg=-1, read_active_side_history((unsigned char)0)=0, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L386] tmp = read_active_side_history((unsigned char)0) [L387] active_side = tmp [L388] side1 = nomsg [L389] side2 = nomsg [L390] side1 = s1p_old [L391] s1p_old = nomsg [L392] side2 = s2p_old [L393] s2p_old = nomsg VAL [active_side=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=4, cs1_old=-1, cs2=0, cs2_new=4, cs2_old=-1, manual_selection_History_0=4, manual_selection_History_1=-1, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=0, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=-1, side1=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=0] [L394] COND FALSE !((int )side1 == 1) VAL [active_side=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=4, cs1_old=-1, cs2=0, cs2_new=4, cs2_old=-1, manual_selection_History_0=4, manual_selection_History_1=-1, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=0, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=-1, side1=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=0] [L397] COND FALSE !((int )side2 == 1) VAL [active_side=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=4, cs1_old=-1, cs2=0, cs2_new=4, cs2_old=-1, manual_selection_History_0=4, manual_selection_History_1=-1, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=0, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=-1, side1=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=0] [L400] COND FALSE !((int )side1 == 0) VAL [active_side=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=4, cs1_old=-1, cs2=0, cs2_new=4, cs2_old=-1, manual_selection_History_0=4, manual_selection_History_1=-1, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=0, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=-1, side1=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=0] [L408] COND TRUE (int )side1 == (int )nomsg VAL [active_side=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=4, cs1_old=-1, cs2=0, cs2_new=4, cs2_old=-1, manual_selection_History_0=4, manual_selection_History_1=-1, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=0, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=-1, side1=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=0] [L409] COND TRUE (int )side2 == 0 [L410] active_side = (int8_t )2 VAL [active_side=2, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=4, cs1_old=-1, cs2=0, cs2_new=4, cs2_old=-1, manual_selection_History_0=4, manual_selection_History_1=-1, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=0, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=-1, side1=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=0] [L417] CALL write_active_side_history(active_side) [L137] active_side_History_2 = active_side_History_1 [L138] active_side_History_1 = active_side_History_0 [L139] active_side_History_0 = val VAL [\old(val)=2, active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=4, cs1_old=-1, cs2=0, cs2_new=4, cs2_old=-1, manual_selection_History_0=4, manual_selection_History_1=-1, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=0, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, val=2] [L417] RET write_active_side_history(active_side) [L587] RET Pendulum_prism_task_each_pals_period() [L588] cs1_old = cs1_new [L589] cs1_new = nomsg [L590] cs2_old = cs2_new [L591] cs2_new = nomsg [L592] s1s2_old = s1s2_new [L593] s1s2_new = nomsg [L594] s1s1_old = s1s1_new [L595] s1s1_new = nomsg [L596] s2s1_old = s2s1_new [L597] s2s1_new = nomsg [L598] s2s2_old = s2s2_new [L599] s2s2_new = nomsg [L600] s1p_old = s1p_new [L601] s1p_new = nomsg [L602] s2p_old = s2p_new [L603] s2p_new = nomsg [L604] CALL, EXPR check() [L423] int tmp ; [L424] msg_t tmp___0 ; [L425] _Bool tmp___1 ; [L426] _Bool tmp___2 ; [L427] _Bool tmp___3 ; [L428] _Bool tmp___4 ; [L429] int8_t tmp___5 ; [L430] _Bool tmp___6 ; [L431] _Bool tmp___7 ; [L432] _Bool tmp___8 ; [L433] int8_t tmp___9 ; [L434] _Bool tmp___10 ; [L435] _Bool tmp___11 ; [L436] _Bool tmp___12 ; [L437] msg_t tmp___13 ; [L438] _Bool tmp___14 ; [L439] _Bool tmp___15 ; [L440] _Bool tmp___16 ; [L441] _Bool tmp___17 ; [L442] int8_t tmp___18 ; [L443] int8_t tmp___19 ; [L444] int8_t tmp___20 ; VAL [active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=4, cs2=0, cs2_new=-1, cs2_old=4, manual_selection_History_0=4, manual_selection_History_1=-1, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L447] COND FALSE !(! side1Failed) VAL [active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=4, cs2=0, cs2_new=-1, cs2_old=4, manual_selection_History_0=4, manual_selection_History_1=-1, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L450] COND TRUE ! side2Failed [L451] tmp = 1 VAL [active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=4, cs2=0, cs2_new=-1, cs2_old=4, manual_selection_History_0=4, manual_selection_History_1=-1, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1] [L455] CALL assume_abort_if_not((_Bool )tmp) VAL [\old(cond)=1, active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=4, cs2=0, cs2_new=-1, cs2_old=4, manual_selection_History_0=4, manual_selection_History_1=-1, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L58] COND FALSE !(!cond) VAL [\old(cond)=1, active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cond=1, cs1=0, cs1_new=-1, cs1_old=4, cs2=0, cs2_new=-1, cs2_old=4, manual_selection_History_0=4, manual_selection_History_1=-1, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L455] RET assume_abort_if_not((_Bool )tmp) VAL [active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=4, cs2=0, cs2_new=-1, cs2_old=4, manual_selection_History_0=4, manual_selection_History_1=-1, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1] [L456] CALL, EXPR read_manual_selection_history((unsigned char)1) VAL [\old(index)=1, active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=4, cs2=0, cs2_new=-1, cs2_old=4, manual_selection_History_0=4, manual_selection_History_1=-1, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L178] COND FALSE !((int )index == 0) VAL [\old(index)=1, active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=4, cs2=0, cs2_new=-1, cs2_old=4, index=1, manual_selection_History_0=4, manual_selection_History_1=-1, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L181] COND TRUE (int )index == 1 [L182] return (manual_selection_History_1); VAL [\old(index)=1, \result=-1, active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=4, cs2=0, cs2_new=-1, cs2_old=4, index=1, manual_selection_History_0=4, manual_selection_History_1=-1, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L456] RET, EXPR read_manual_selection_history((unsigned char)1) VAL [active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=4, cs2=0, cs2_new=-1, cs2_old=4, manual_selection_History_0=4, manual_selection_History_1=-1, manual_selection_History_2=0, nomsg=-1, read_manual_selection_history((unsigned char)1)=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1] [L456] tmp___0 = read_manual_selection_history((unsigned char)1) [L457] COND FALSE !(! tmp___0) VAL [active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=4, cs2=0, cs2_new=-1, cs2_old=4, manual_selection_History_0=4, manual_selection_History_1=-1, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=-1] [L486] CALL, EXPR read_side1_failed_history((unsigned char)1) VAL [\old(index)=1, active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=4, cs2=0, cs2_new=-1, cs2_old=4, manual_selection_History_0=4, manual_selection_History_1=-1, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L88] COND FALSE !((int )index == 0) VAL [\old(index)=1, active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=4, cs2=0, cs2_new=-1, cs2_old=4, index=1, manual_selection_History_0=4, manual_selection_History_1=-1, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L91] COND TRUE (int )index == 1 [L92] return (side1Failed_History_1); VAL [\old(index)=1, \result=-255, active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=4, cs2=0, cs2_new=-1, cs2_old=4, index=1, manual_selection_History_0=4, manual_selection_History_1=-1, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L486] RET, EXPR read_side1_failed_history((unsigned char)1) VAL [active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=4, cs2=0, cs2_new=-1, cs2_old=4, manual_selection_History_0=4, manual_selection_History_1=-1, manual_selection_History_2=0, nomsg=-1, read_side1_failed_history((unsigned char)1)=-255, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=-1] [L486] tmp___7 = read_side1_failed_history((unsigned char)1) [L487] COND TRUE \read(tmp___7) VAL [active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=4, cs2=0, cs2_new=-1, cs2_old=4, manual_selection_History_0=4, manual_selection_History_1=-1, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=-1, tmp___7=1] [L488] CALL, EXPR read_side2_failed_history((unsigned char)1) VAL [\old(index)=1, active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=4, cs2=0, cs2_new=-1, cs2_old=4, manual_selection_History_0=4, manual_selection_History_1=-1, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L118] COND FALSE !((int )index == 0) VAL [\old(index)=1, active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=4, cs2=0, cs2_new=-1, cs2_old=4, index=1, manual_selection_History_0=4, manual_selection_History_1=-1, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L121] COND TRUE (int )index == 1 [L122] return (side2Failed_History_1); VAL [\old(index)=1, \result=0, active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=4, cs2=0, cs2_new=-1, cs2_old=4, index=1, manual_selection_History_0=4, manual_selection_History_1=-1, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L488] RET, EXPR read_side2_failed_history((unsigned char)1) VAL [active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=4, cs2=0, cs2_new=-1, cs2_old=4, manual_selection_History_0=4, manual_selection_History_1=-1, manual_selection_History_2=0, nomsg=-1, read_side2_failed_history((unsigned char)1)=0, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=-1, tmp___7=1] [L488] tmp___8 = read_side2_failed_history((unsigned char)1) [L489] COND TRUE ! tmp___8 VAL [active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=4, cs2=0, cs2_new=-1, cs2_old=4, manual_selection_History_0=4, manual_selection_History_1=-1, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=-1, tmp___7=1, tmp___8=0] [L490] CALL, EXPR read_active_side_history((unsigned char)0) VAL [\old(index)=0, active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=4, cs2=0, cs2_new=-1, cs2_old=4, manual_selection_History_0=4, manual_selection_History_1=-1, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L148] COND TRUE (int )index == 0 [L149] return (active_side_History_0); VAL [\old(index)=0, \result=2, active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=4, cs2=0, cs2_new=-1, cs2_old=4, index=0, manual_selection_History_0=4, manual_selection_History_1=-1, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L490] RET, EXPR read_active_side_history((unsigned char)0) VAL [active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=4, cs2=0, cs2_new=-1, cs2_old=4, manual_selection_History_0=4, manual_selection_History_1=-1, manual_selection_History_2=0, nomsg=-1, read_active_side_history((unsigned char)0)=2, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=-1, tmp___7=1, tmp___8=0] [L490] tmp___5 = read_active_side_history((unsigned char)0) [L491] COND FALSE !(! ((int )tmp___5 == 2)) VAL [active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=4, cs2=0, cs2_new=-1, cs2_old=4, manual_selection_History_0=4, manual_selection_History_1=-1, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=-1, tmp___5=2, tmp___7=1, tmp___8=0] [L494] CALL, EXPR read_side2_failed_history((unsigned char)0) VAL [\old(index)=0, active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=4, cs2=0, cs2_new=-1, cs2_old=4, manual_selection_History_0=4, manual_selection_History_1=-1, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L118] COND TRUE (int )index == 0 [L119] return (side2Failed_History_0); VAL [\old(index)=0, \result=0, active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=4, cs2=0, cs2_new=-1, cs2_old=4, index=0, manual_selection_History_0=4, manual_selection_History_1=-1, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L494] RET, EXPR read_side2_failed_history((unsigned char)0) VAL [active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=4, cs2=0, cs2_new=-1, cs2_old=4, manual_selection_History_0=4, manual_selection_History_1=-1, manual_selection_History_2=0, nomsg=-1, read_side2_failed_history((unsigned char)0)=0, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=-1, tmp___5=2, tmp___7=1, tmp___8=0] [L494] tmp___6 = read_side2_failed_history((unsigned char)0) [L495] COND TRUE ! tmp___6 VAL [active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=4, cs2=0, cs2_new=-1, cs2_old=4, manual_selection_History_0=4, manual_selection_History_1=-1, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=-1, tmp___5=2, tmp___6=0, tmp___7=1, tmp___8=0] [L496] COND TRUE ! ((int )side2_written == 1) [L497] return (0); VAL [\result=0, active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=4, cs2=0, cs2_new=-1, cs2_old=4, manual_selection_History_0=4, manual_selection_History_1=-1, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=-1, tmp___5=2, tmp___6=0, tmp___7=1, tmp___8=0] [L604] RET, EXPR check() [L604] c1 = check() [L605] CALL assert(c1) VAL [\old(arg)=0, active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=4, cs2=0, cs2_new=-1, cs2_old=4, manual_selection_History_0=4, manual_selection_History_1=-1, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L617] COND TRUE ! arg VAL [\old(arg)=0, active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, arg=0, cs1=0, cs1_new=-1, cs1_old=4, cs2=0, cs2_new=-1, cs2_old=4, manual_selection_History_0=4, manual_selection_History_1=-1, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L619] reach_error() VAL [\old(arg)=0, active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, arg=0, cs1=0, cs1_new=-1, cs1_old=4, cs2=0, cs2_new=-1, cs2_old=4, manual_selection_History_0=4, manual_selection_History_1=-1, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 8 procedures, 181 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 245.5s, OverallIterations: 41, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.2s, AutomataDifference: 172.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 35922 SdHoareTripleChecker+Valid, 38.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 35643 mSDsluCounter, 86603 SdHoareTripleChecker+Invalid, 33.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 69693 mSDsCounter, 18236 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 37283 IncrementalHoareTripleChecker+Invalid, 55519 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 18236 mSolverCounterUnsat, 16910 mSDtfsCounter, 37283 mSolverCounterSat, 0.7s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 5137 GetRequests, 4137 SyntacticMatches, 15 SemanticMatches, 985 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62196 ImplicationChecksByTransitivity, 49.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=17446occurred in iteration=36, InterpolantAutomatonStates: 920, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 48.7s AutomataMinimizationTime, 40 MinimizatonAttempts, 93152 StatesRemovedByMinimization, 32 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.6s SsaConstructionTime, 2.2s SatisfiabilityAnalysisTime, 18.2s InterpolantComputationTime, 6289 NumberOfCodeBlocks, 6289 NumberOfCodeBlocksAsserted, 51 NumberOfCheckSat, 7575 ConstructedInterpolants, 0 QuantifiedInterpolants, 26509 SizeOfPredicates, 36 NumberOfNonLiveVariables, 7656 ConjunctsInSsa, 167 ConjunctsInUnsatCore, 59 InterpolantComputations, 32 PerfectInterpolantSequences, 3213/3717 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-11-25 15:31:15,125 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b050e35a-0ebd-4c9f-90ce-59bf7556af81/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE