./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_1.ufo.BOUNDED-10.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6b4ec56b Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11412ca0-d643-4d9b-a0b3-273b10d69dd1/bin/uautomizer-ug76WZFUDN/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11412ca0-d643-4d9b-a0b3-273b10d69dd1/bin/uautomizer-ug76WZFUDN/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11412ca0-d643-4d9b-a0b3-273b10d69dd1/bin/uautomizer-ug76WZFUDN/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11412ca0-d643-4d9b-a0b3-273b10d69dd1/bin/uautomizer-ug76WZFUDN/config/AutomizerReach.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_1.ufo.BOUNDED-10.pals.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11412ca0-d643-4d9b-a0b3-273b10d69dd1/bin/uautomizer-ug76WZFUDN/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11412ca0-d643-4d9b-a0b3-273b10d69dd1/bin/uautomizer-ug76WZFUDN --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 a30aa210ed4a7c8ee647a70aef136aef282e5eccb07388ecda6495e33bc30b6d --- 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-6b4ec56 [2022-11-20 11:46:05,360 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-20 11:46:05,363 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-20 11:46:05,387 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-20 11:46:05,388 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-20 11:46:05,389 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-20 11:46:05,391 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-20 11:46:05,394 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-20 11:46:05,396 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-20 11:46:05,397 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-20 11:46:05,399 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-20 11:46:05,401 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-20 11:46:05,401 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-20 11:46:05,403 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-20 11:46:05,404 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-20 11:46:05,406 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-20 11:46:05,407 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-20 11:46:05,408 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-20 11:46:05,410 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-20 11:46:05,413 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-20 11:46:05,415 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-20 11:46:05,417 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-20 11:46:05,418 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-20 11:46:05,419 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-20 11:46:05,424 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-20 11:46:05,425 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-20 11:46:05,425 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-20 11:46:05,426 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-20 11:46:05,427 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-20 11:46:05,428 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-20 11:46:05,429 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-20 11:46:05,430 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-20 11:46:05,431 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-20 11:46:05,432 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-20 11:46:05,433 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-20 11:46:05,434 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-20 11:46:05,435 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-20 11:46:05,435 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-20 11:46:05,436 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-20 11:46:05,437 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-20 11:46:05,438 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-20 11:46:05,439 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11412ca0-d643-4d9b-a0b3-273b10d69dd1/bin/uautomizer-ug76WZFUDN/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-20 11:46:05,466 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-20 11:46:05,467 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-20 11:46:05,467 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-20 11:46:05,468 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-20 11:46:05,469 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-20 11:46:05,469 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-20 11:46:05,470 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-20 11:46:05,470 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-20 11:46:05,470 INFO L138 SettingsManager]: * Use SBE=true [2022-11-20 11:46:05,471 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-20 11:46:05,471 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-20 11:46:05,471 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-20 11:46:05,472 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-20 11:46:05,472 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-20 11:46:05,472 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-20 11:46:05,472 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-20 11:46:05,473 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-20 11:46:05,473 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-20 11:46:05,473 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-20 11:46:05,474 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-20 11:46:05,474 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-20 11:46:05,474 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-20 11:46:05,474 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-20 11:46:05,475 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-20 11:46:05,475 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 11:46:05,475 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-20 11:46:05,476 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-20 11:46:05,476 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-20 11:46:05,476 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-20 11:46:05,476 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-20 11:46:05,477 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-20 11:46:05,477 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-20 11:46:05,477 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-20 11:46:05,477 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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_11412ca0-d643-4d9b-a0b3-273b10d69dd1/bin/uautomizer-ug76WZFUDN/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_11412ca0-d643-4d9b-a0b3-273b10d69dd1/bin/uautomizer-ug76WZFUDN 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 -> a30aa210ed4a7c8ee647a70aef136aef282e5eccb07388ecda6495e33bc30b6d [2022-11-20 11:46:05,796 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-20 11:46:05,850 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-20 11:46:05,854 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-20 11:46:05,856 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-20 11:46:05,857 INFO L275 PluginConnector]: CDTParser initialized [2022-11-20 11:46:05,858 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11412ca0-d643-4d9b-a0b3-273b10d69dd1/bin/uautomizer-ug76WZFUDN/../../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_1.ufo.BOUNDED-10.pals.c [2022-11-20 11:46:09,857 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-20 11:46:10,215 INFO L351 CDTParser]: Found 1 translation units. [2022-11-20 11:46:10,216 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11412ca0-d643-4d9b-a0b3-273b10d69dd1/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_1.ufo.BOUNDED-10.pals.c [2022-11-20 11:46:10,229 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11412ca0-d643-4d9b-a0b3-273b10d69dd1/bin/uautomizer-ug76WZFUDN/data/e6bfd6a17/7b99a0d46ca748858c755f1a034ecf8a/FLAG6dcfd495b [2022-11-20 11:46:10,248 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11412ca0-d643-4d9b-a0b3-273b10d69dd1/bin/uautomizer-ug76WZFUDN/data/e6bfd6a17/7b99a0d46ca748858c755f1a034ecf8a [2022-11-20 11:46:10,251 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-20 11:46:10,253 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-20 11:46:10,254 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-20 11:46:10,255 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-20 11:46:10,259 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-20 11:46:10,260 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 11:46:10" (1/1) ... [2022-11-20 11:46:10,262 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@672f4fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:46:10, skipping insertion in model container [2022-11-20 11:46:10,262 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 11:46:10" (1/1) ... [2022-11-20 11:46:10,285 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-20 11:46:10,356 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-20 11:46:10,634 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_11412ca0-d643-4d9b-a0b3-273b10d69dd1/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_1.ufo.BOUNDED-10.pals.c[14540,14553] [2022-11-20 11:46:10,640 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 11:46:10,656 INFO L203 MainTranslator]: Completed pre-run [2022-11-20 11:46:10,744 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_11412ca0-d643-4d9b-a0b3-273b10d69dd1/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_1.ufo.BOUNDED-10.pals.c[14540,14553] [2022-11-20 11:46:10,744 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 11:46:10,766 INFO L208 MainTranslator]: Completed translation [2022-11-20 11:46:10,767 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:46:10 WrapperNode [2022-11-20 11:46:10,767 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-20 11:46:10,769 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-20 11:46:10,769 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-20 11:46:10,769 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-20 11:46:10,779 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:46:10" (1/1) ... [2022-11-20 11:46:10,795 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:46:10" (1/1) ... [2022-11-20 11:46:10,846 INFO L138 Inliner]: procedures = 32, calls = 48, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 477 [2022-11-20 11:46:10,847 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-20 11:46:10,848 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-20 11:46:10,848 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-20 11:46:10,848 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-20 11:46:10,862 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:46:10" (1/1) ... [2022-11-20 11:46:10,863 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:46:10" (1/1) ... [2022-11-20 11:46:10,869 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:46:10" (1/1) ... [2022-11-20 11:46:10,870 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:46:10" (1/1) ... [2022-11-20 11:46:10,883 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:46:10" (1/1) ... [2022-11-20 11:46:10,891 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:46:10" (1/1) ... [2022-11-20 11:46:10,895 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:46:10" (1/1) ... [2022-11-20 11:46:10,898 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:46:10" (1/1) ... [2022-11-20 11:46:10,905 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-20 11:46:10,906 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-20 11:46:10,906 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-20 11:46:10,907 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-20 11:46:10,908 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:46:10" (1/1) ... [2022-11-20 11:46:10,916 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 11:46:10,933 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11412ca0-d643-4d9b-a0b3-273b10d69dd1/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:46:10,965 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11412ca0-d643-4d9b-a0b3-273b10d69dd1/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-20 11:46:10,968 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11412ca0-d643-4d9b-a0b3-273b10d69dd1/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-20 11:46:11,021 INFO L130 BoogieDeclarations]: Found specification of procedure read_manual_selection_history [2022-11-20 11:46:11,021 INFO L138 BoogieDeclarations]: Found implementation of procedure read_manual_selection_history [2022-11-20 11:46:11,022 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-20 11:46:11,022 INFO L130 BoogieDeclarations]: Found specification of procedure read_side2_failed_history [2022-11-20 11:46:11,022 INFO L138 BoogieDeclarations]: Found implementation of procedure read_side2_failed_history [2022-11-20 11:46:11,022 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2022-11-20 11:46:11,022 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2022-11-20 11:46:11,023 INFO L130 BoogieDeclarations]: Found specification of procedure flip_the_side [2022-11-20 11:46:11,023 INFO L138 BoogieDeclarations]: Found implementation of procedure flip_the_side [2022-11-20 11:46:11,023 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-11-20 11:46:11,023 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-11-20 11:46:11,024 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-20 11:46:11,024 INFO L130 BoogieDeclarations]: Found specification of procedure read_side1_failed_history [2022-11-20 11:46:11,024 INFO L138 BoogieDeclarations]: Found implementation of procedure read_side1_failed_history [2022-11-20 11:46:11,024 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-20 11:46:11,024 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-20 11:46:11,025 INFO L130 BoogieDeclarations]: Found specification of procedure read_active_side_history [2022-11-20 11:46:11,025 INFO L138 BoogieDeclarations]: Found implementation of procedure read_active_side_history [2022-11-20 11:46:11,203 INFO L235 CfgBuilder]: Building ICFG [2022-11-20 11:46:11,221 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-20 11:46:11,947 INFO L276 CfgBuilder]: Performing block encoding [2022-11-20 11:46:11,958 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-20 11:46:11,959 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-20 11:46:11,962 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 11:46:11 BoogieIcfgContainer [2022-11-20 11:46:11,962 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-20 11:46:11,965 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-20 11:46:11,966 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-20 11:46:11,970 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-20 11:46:11,971 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 11:46:10" (1/3) ... [2022-11-20 11:46:11,972 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6899686d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 11:46:11, skipping insertion in model container [2022-11-20 11:46:11,972 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:46:10" (2/3) ... [2022-11-20 11:46:11,973 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6899686d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 11:46:11, skipping insertion in model container [2022-11-20 11:46:11,973 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 11:46:11" (3/3) ... [2022-11-20 11:46:11,975 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_STARTPALS_ActiveStandby.4_1.ufo.BOUNDED-10.pals.c [2022-11-20 11:46:12,033 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-20 11:46:12,033 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-20 11:46:12,164 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-20 11:46:12,176 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;@5128d53, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-20 11:46:12,176 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-20 11:46:12,182 INFO L276 IsEmpty]: Start isEmpty. Operand has 179 states, 139 states have (on average 1.5467625899280575) internal successors, (215), 140 states have internal predecessors, (215), 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-20 11:46:12,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-20 11:46:12,197 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:46:12,198 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-20 11:46:12,199 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:46:12,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:46:12,206 INFO L85 PathProgramCache]: Analyzing trace with hash -336437783, now seen corresponding path program 1 times [2022-11-20 11:46:12,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:46:12,216 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108804595] [2022-11-20 11:46:12,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:46:12,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:46:12,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:46:12,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-20 11:46:12,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:46:12,487 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-20 11:46:12,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:46:12,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108804595] [2022-11-20 11:46:12,489 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1108804595] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:46:12,489 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:46:12,489 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 11:46:12,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323509667] [2022-11-20 11:46:12,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:46:12,498 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-20 11:46:12,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:46:12,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-20 11:46:12,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-20 11:46:12,565 INFO L87 Difference]: Start difference. First operand has 179 states, 139 states have (on average 1.5467625899280575) internal successors, (215), 140 states have internal predecessors, (215), 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-20 11:46:12,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:46:12,689 INFO L93 Difference]: Finished difference Result 342 states and 554 transitions. [2022-11-20 11:46:12,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-20 11:46:12,692 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-20 11:46:12,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:46:12,706 INFO L225 Difference]: With dead ends: 342 [2022-11-20 11:46:12,706 INFO L226 Difference]: Without dead ends: 175 [2022-11-20 11:46:12,712 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-20 11:46:12,717 INFO L413 NwaCegarLoop]: 274 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, 274 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-20 11:46:12,719 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 274 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 11:46:12,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2022-11-20 11:46:12,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 175. [2022-11-20 11:46:12,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 136 states have (on average 1.5294117647058822) internal successors, (208), 136 states have internal predecessors, (208), 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-20 11:46:12,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 270 transitions. [2022-11-20 11:46:12,798 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 270 transitions. Word has length 28 [2022-11-20 11:46:12,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:46:12,799 INFO L495 AbstractCegarLoop]: Abstraction has 175 states and 270 transitions. [2022-11-20 11:46:12,800 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-20 11:46:12,800 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 270 transitions. [2022-11-20 11:46:12,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-20 11:46:12,802 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:46:12,803 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-20 11:46:12,803 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-20 11:46:12,804 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:46:12,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:46:12,805 INFO L85 PathProgramCache]: Analyzing trace with hash -117583065, now seen corresponding path program 1 times [2022-11-20 11:46:12,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:46:12,806 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910683916] [2022-11-20 11:46:12,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:46:12,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:46:12,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:46:13,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-20 11:46:13,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:46:13,168 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-20 11:46:13,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:46:13,169 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910683916] [2022-11-20 11:46:13,170 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [910683916] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:46:13,170 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:46:13,170 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-20 11:46:13,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684615900] [2022-11-20 11:46:13,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:46:13,172 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 11:46:13,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:46:13,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 11:46:13,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-20 11:46:13,174 INFO L87 Difference]: Start difference. First operand 175 states and 270 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-20 11:46:13,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:46:13,399 INFO L93 Difference]: Finished difference Result 447 states and 697 transitions. [2022-11-20 11:46:13,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 11:46:13,400 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-20 11:46:13,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:46:13,404 INFO L225 Difference]: With dead ends: 447 [2022-11-20 11:46:13,405 INFO L226 Difference]: Without dead ends: 286 [2022-11-20 11:46:13,407 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-20 11:46:13,409 INFO L413 NwaCegarLoop]: 289 mSDtfsCounter, 133 mSDsluCounter, 1105 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 1394 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-20 11:46:13,410 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 1394 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 11:46:13,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2022-11-20 11:46:13,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 175. [2022-11-20 11:46:13,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 136 states have (on average 1.4411764705882353) internal successors, (196), 136 states have internal predecessors, (196), 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-20 11:46:13,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 258 transitions. [2022-11-20 11:46:13,461 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 258 transitions. Word has length 28 [2022-11-20 11:46:13,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:46:13,462 INFO L495 AbstractCegarLoop]: Abstraction has 175 states and 258 transitions. [2022-11-20 11:46:13,463 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-20 11:46:13,463 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 258 transitions. [2022-11-20 11:46:13,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-11-20 11:46:13,467 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:46:13,468 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-20 11:46:13,468 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-20 11:46:13,469 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:46:13,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:46:13,469 INFO L85 PathProgramCache]: Analyzing trace with hash -680629300, now seen corresponding path program 1 times [2022-11-20 11:46:13,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:46:13,470 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034965113] [2022-11-20 11:46:13,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:46:13,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:46:13,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:46:13,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-20 11:46:13,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:46:13,971 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-20 11:46:13,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:46:13,972 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034965113] [2022-11-20 11:46:13,972 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034965113] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:46:13,972 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:46:13,973 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 11:46:13,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469782844] [2022-11-20 11:46:13,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:46:13,974 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 11:46:13,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:46:13,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 11:46:13,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 11:46:13,976 INFO L87 Difference]: Start difference. First operand 175 states and 258 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-20 11:46:14,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:46:14,080 INFO L93 Difference]: Finished difference Result 337 states and 506 transitions. [2022-11-20 11:46:14,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 11:46:14,081 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-20 11:46:14,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:46:14,084 INFO L225 Difference]: With dead ends: 337 [2022-11-20 11:46:14,084 INFO L226 Difference]: Without dead ends: 179 [2022-11-20 11:46:14,086 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-20 11:46:14,088 INFO L413 NwaCegarLoop]: 252 mSDtfsCounter, 5 mSDsluCounter, 494 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 746 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.1s IncrementalHoareTripleChecker+Time [2022-11-20 11:46:14,089 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 746 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 11:46:14,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2022-11-20 11:46:14,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 179. [2022-11-20 11:46:14,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 139 states have (on average 1.4316546762589928) internal successors, (199), 139 states have internal predecessors, (199), 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-20 11:46:14,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 261 transitions. [2022-11-20 11:46:14,140 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 261 transitions. Word has length 39 [2022-11-20 11:46:14,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:46:14,141 INFO L495 AbstractCegarLoop]: Abstraction has 179 states and 261 transitions. [2022-11-20 11:46:14,142 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-20 11:46:14,142 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 261 transitions. [2022-11-20 11:46:14,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-11-20 11:46:14,144 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:46:14,144 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-20 11:46:14,144 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-20 11:46:14,145 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:46:14,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:46:14,145 INFO L85 PathProgramCache]: Analyzing trace with hash -1013800162, now seen corresponding path program 1 times [2022-11-20 11:46:14,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:46:14,146 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337972576] [2022-11-20 11:46:14,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:46:14,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:46:14,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:46:14,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-20 11:46:14,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:46:14,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-20 11:46:14,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:46:14,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-11-20 11:46:14,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:46:14,358 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-20 11:46:14,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:46:14,359 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337972576] [2022-11-20 11:46:14,360 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1337972576] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:46:14,361 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:46:14,362 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 11:46:14,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385462020] [2022-11-20 11:46:14,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:46:14,363 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 11:46:14,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:46:14,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 11:46:14,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 11:46:14,365 INFO L87 Difference]: Start difference. First operand 179 states and 261 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-20 11:46:14,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:46:14,479 INFO L93 Difference]: Finished difference Result 491 states and 726 transitions. [2022-11-20 11:46:14,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 11:46:14,480 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-20 11:46:14,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:46:14,486 INFO L225 Difference]: With dead ends: 491 [2022-11-20 11:46:14,488 INFO L226 Difference]: Without dead ends: 329 [2022-11-20 11:46:14,490 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-20 11:46:14,499 INFO L413 NwaCegarLoop]: 297 mSDtfsCounter, 209 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 546 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-20 11:46:14,500 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [209 Valid, 546 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 11:46:14,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2022-11-20 11:46:14,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 323. [2022-11-20 11:46:14,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 323 states, 246 states have (on average 1.451219512195122) internal successors, (357), 247 states have internal predecessors, (357), 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-20 11:46:14,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 477 transitions. [2022-11-20 11:46:14,589 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 477 transitions. Word has length 55 [2022-11-20 11:46:14,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:46:14,590 INFO L495 AbstractCegarLoop]: Abstraction has 323 states and 477 transitions. [2022-11-20 11:46:14,590 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-20 11:46:14,591 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 477 transitions. [2022-11-20 11:46:14,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-11-20 11:46:14,599 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:46:14,600 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-20 11:46:14,600 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-20 11:46:14,600 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:46:14,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:46:14,601 INFO L85 PathProgramCache]: Analyzing trace with hash 753023036, now seen corresponding path program 1 times [2022-11-20 11:46:14,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:46:14,602 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362745833] [2022-11-20 11:46:14,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:46:14,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:46:14,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:46:14,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-20 11:46:14,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:46:14,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-20 11:46:14,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:46:14,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-20 11:46:14,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:46:14,776 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-20 11:46:14,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:46:14,777 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362745833] [2022-11-20 11:46:14,777 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1362745833] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:46:14,777 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:46:14,779 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 11:46:14,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355541847] [2022-11-20 11:46:14,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:46:14,786 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 11:46:14,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:46:14,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 11:46:14,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 11:46:14,787 INFO L87 Difference]: Start difference. First operand 323 states and 477 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-20 11:46:14,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:46:14,885 INFO L93 Difference]: Finished difference Result 908 states and 1352 transitions. [2022-11-20 11:46:14,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 11:46:14,886 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-20 11:46:14,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:46:14,898 INFO L225 Difference]: With dead ends: 908 [2022-11-20 11:46:14,898 INFO L226 Difference]: Without dead ends: 602 [2022-11-20 11:46:14,900 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-20 11:46:14,908 INFO L413 NwaCegarLoop]: 316 mSDtfsCounter, 211 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 567 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-20 11:46:14,909 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 567 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 11:46:14,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2022-11-20 11:46:15,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 596. [2022-11-20 11:46:15,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 596 states, 447 states have (on average 1.4608501118568233) internal successors, (653), 450 states have internal predecessors, (653), 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-20 11:46:15,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 887 transitions. [2022-11-20 11:46:15,022 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 887 transitions. Word has length 56 [2022-11-20 11:46:15,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:46:15,022 INFO L495 AbstractCegarLoop]: Abstraction has 596 states and 887 transitions. [2022-11-20 11:46:15,023 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-20 11:46:15,023 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 887 transitions. [2022-11-20 11:46:15,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-11-20 11:46:15,028 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:46:15,029 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-20 11:46:15,029 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-20 11:46:15,029 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:46:15,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:46:15,030 INFO L85 PathProgramCache]: Analyzing trace with hash -526840642, now seen corresponding path program 1 times [2022-11-20 11:46:15,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:46:15,031 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426615929] [2022-11-20 11:46:15,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:46:15,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:46:15,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:46:15,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-20 11:46:15,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:46:15,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-20 11:46:15,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:46:15,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-20 11:46:15,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:46:15,232 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-20 11:46:15,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:46:15,233 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426615929] [2022-11-20 11:46:15,234 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426615929] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:46:15,234 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:46:15,234 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-20 11:46:15,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676551196] [2022-11-20 11:46:15,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:46:15,237 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 11:46:15,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:46:15,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 11:46:15,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-20 11:46:15,238 INFO L87 Difference]: Start difference. First operand 596 states and 887 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-20 11:46:15,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:46:15,722 INFO L93 Difference]: Finished difference Result 1625 states and 2473 transitions. [2022-11-20 11:46:15,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 11:46:15,723 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-20 11:46:15,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:46:15,730 INFO L225 Difference]: With dead ends: 1625 [2022-11-20 11:46:15,731 INFO L226 Difference]: Without dead ends: 1046 [2022-11-20 11:46:15,734 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-20 11:46:15,735 INFO L413 NwaCegarLoop]: 245 mSDtfsCounter, 620 mSDsluCounter, 447 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 620 SdHoareTripleChecker+Valid, 692 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 11:46:15,735 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [620 Valid, 692 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-20 11:46:15,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1046 states. [2022-11-20 11:46:15,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1046 to 684. [2022-11-20 11:46:15,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 684 states, 522 states have (on average 1.446360153256705) internal successors, (755), 525 states have internal predecessors, (755), 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-20 11:46:15,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 684 states to 684 states and 1003 transitions. [2022-11-20 11:46:15,867 INFO L78 Accepts]: Start accepts. Automaton has 684 states and 1003 transitions. Word has length 56 [2022-11-20 11:46:15,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:46:15,868 INFO L495 AbstractCegarLoop]: Abstraction has 684 states and 1003 transitions. [2022-11-20 11:46:15,869 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-20 11:46:15,869 INFO L276 IsEmpty]: Start isEmpty. Operand 684 states and 1003 transitions. [2022-11-20 11:46:15,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-11-20 11:46:15,870 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:46:15,871 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-20 11:46:15,871 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-20 11:46:15,871 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:46:15,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:46:15,872 INFO L85 PathProgramCache]: Analyzing trace with hash 139412401, now seen corresponding path program 1 times [2022-11-20 11:46:15,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:46:15,873 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298995244] [2022-11-20 11:46:15,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:46:15,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:46:15,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:46:16,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-20 11:46:16,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:46:16,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-20 11:46:16,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:46:16,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-20 11:46:16,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:46:16,128 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-20 11:46:16,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:46:16,129 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298995244] [2022-11-20 11:46:16,129 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [298995244] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:46:16,129 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:46:16,130 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-20 11:46:16,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724782361] [2022-11-20 11:46:16,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:46:16,131 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 11:46:16,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:46:16,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 11:46:16,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-20 11:46:16,132 INFO L87 Difference]: Start difference. First operand 684 states and 1003 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-20 11:46:16,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:46:16,639 INFO L93 Difference]: Finished difference Result 1625 states and 2465 transitions. [2022-11-20 11:46:16,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 11:46:16,640 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-20 11:46:16,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:46:16,650 INFO L225 Difference]: With dead ends: 1625 [2022-11-20 11:46:16,650 INFO L226 Difference]: Without dead ends: 1046 [2022-11-20 11:46:16,654 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-20 11:46:16,658 INFO L413 NwaCegarLoop]: 246 mSDtfsCounter, 616 mSDsluCounter, 449 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 616 SdHoareTripleChecker+Valid, 695 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 11:46:16,659 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [616 Valid, 695 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-20 11:46:16,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1046 states. [2022-11-20 11:46:16,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1046 to 684. [2022-11-20 11:46:16,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 684 states, 522 states have (on average 1.4386973180076628) internal successors, (751), 525 states have internal predecessors, (751), 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-20 11:46:16,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 684 states to 684 states and 999 transitions. [2022-11-20 11:46:16,819 INFO L78 Accepts]: Start accepts. Automaton has 684 states and 999 transitions. Word has length 57 [2022-11-20 11:46:16,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:46:16,821 INFO L495 AbstractCegarLoop]: Abstraction has 684 states and 999 transitions. [2022-11-20 11:46:16,821 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-20 11:46:16,821 INFO L276 IsEmpty]: Start isEmpty. Operand 684 states and 999 transitions. [2022-11-20 11:46:16,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-20 11:46:16,823 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:46:16,824 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] [2022-11-20 11:46:16,824 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-20 11:46:16,826 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:46:16,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:46:16,827 INFO L85 PathProgramCache]: Analyzing trace with hash -1701327375, now seen corresponding path program 1 times [2022-11-20 11:46:16,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:46:16,828 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341896570] [2022-11-20 11:46:16,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:46:16,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:46:16,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:46:17,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-20 11:46:17,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:46:17,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-20 11:46:17,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:46:17,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-11-20 11:46:17,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:46:17,139 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-20 11:46:17,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:46:17,140 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341896570] [2022-11-20 11:46:17,140 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [341896570] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:46:17,141 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:46:17,141 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 11:46:17,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938247473] [2022-11-20 11:46:17,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:46:17,142 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 11:46:17,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:46:17,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 11:46:17,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 11:46:17,143 INFO L87 Difference]: Start difference. First operand 684 states and 999 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 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-20 11:46:17,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:46:17,273 INFO L93 Difference]: Finished difference Result 1283 states and 1896 transitions. [2022-11-20 11:46:17,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 11:46:17,274 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 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 58 [2022-11-20 11:46:17,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:46:17,279 INFO L225 Difference]: With dead ends: 1283 [2022-11-20 11:46:17,280 INFO L226 Difference]: Without dead ends: 704 [2022-11-20 11:46:17,282 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-20 11:46:17,283 INFO L413 NwaCegarLoop]: 254 mSDtfsCounter, 6 mSDsluCounter, 504 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 758 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-20 11:46:17,284 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 758 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 11:46:17,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 704 states. [2022-11-20 11:46:17,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 704 to 704. [2022-11-20 11:46:17,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 704 states, 538 states have (on average 1.4256505576208178) internal successors, (767), 541 states have internal predecessors, (767), 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-20 11:46:17,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 704 states to 704 states and 1015 transitions. [2022-11-20 11:46:17,383 INFO L78 Accepts]: Start accepts. Automaton has 704 states and 1015 transitions. Word has length 58 [2022-11-20 11:46:17,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:46:17,383 INFO L495 AbstractCegarLoop]: Abstraction has 704 states and 1015 transitions. [2022-11-20 11:46:17,384 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 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-20 11:46:17,384 INFO L276 IsEmpty]: Start isEmpty. Operand 704 states and 1015 transitions. [2022-11-20 11:46:17,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-11-20 11:46:17,386 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:46:17,386 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] [2022-11-20 11:46:17,386 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-20 11:46:17,387 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:46:17,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:46:17,387 INFO L85 PathProgramCache]: Analyzing trace with hash 1426575004, now seen corresponding path program 1 times [2022-11-20 11:46:17,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:46:17,388 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727906876] [2022-11-20 11:46:17,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:46:17,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:46:17,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:46:17,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-20 11:46:17,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:46:17,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-20 11:46:17,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:46:17,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-11-20 11:46:17,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:46:17,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-11-20 11:46:17,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:46:17,683 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-20 11:46:17,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:46:17,683 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727906876] [2022-11-20 11:46:17,684 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1727906876] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:46:17,684 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:46:17,684 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 11:46:17,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19477436] [2022-11-20 11:46:17,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:46:17,686 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 11:46:17,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:46:17,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 11:46:17,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 11:46:17,688 INFO L87 Difference]: Start difference. First operand 704 states and 1015 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 3 states have internal predecessors, (53), 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-20 11:46:17,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:46:17,831 INFO L93 Difference]: Finished difference Result 1323 states and 1940 transitions. [2022-11-20 11:46:17,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 11:46:17,832 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 3 states have internal predecessors, (53), 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 66 [2022-11-20 11:46:17,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:46:17,838 INFO L225 Difference]: With dead ends: 1323 [2022-11-20 11:46:17,839 INFO L226 Difference]: Without dead ends: 724 [2022-11-20 11:46:17,841 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-20 11:46:17,844 INFO L413 NwaCegarLoop]: 251 mSDtfsCounter, 6 mSDsluCounter, 493 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 744 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-20 11:46:17,844 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 744 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 11:46:17,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 724 states. [2022-11-20 11:46:17,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 724 to 724. [2022-11-20 11:46:17,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 724 states, 554 states have (on average 1.4133574007220218) internal successors, (783), 557 states have internal predecessors, (783), 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-20 11:46:17,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 724 states to 724 states and 1031 transitions. [2022-11-20 11:46:17,943 INFO L78 Accepts]: Start accepts. Automaton has 724 states and 1031 transitions. Word has length 66 [2022-11-20 11:46:17,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:46:17,945 INFO L495 AbstractCegarLoop]: Abstraction has 724 states and 1031 transitions. [2022-11-20 11:46:17,945 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 3 states have internal predecessors, (53), 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-20 11:46:17,945 INFO L276 IsEmpty]: Start isEmpty. Operand 724 states and 1031 transitions. [2022-11-20 11:46:17,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-11-20 11:46:17,947 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:46:17,947 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] [2022-11-20 11:46:17,948 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-20 11:46:17,948 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:46:17,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:46:17,949 INFO L85 PathProgramCache]: Analyzing trace with hash 1983388360, now seen corresponding path program 1 times [2022-11-20 11:46:17,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:46:17,949 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449897299] [2022-11-20 11:46:17,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:46:17,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:46:17,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:46:18,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-20 11:46:18,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:46:18,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-20 11:46:18,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:46:18,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-11-20 11:46:18,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:46:18,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-11-20 11:46:18,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:46:18,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-11-20 11:46:18,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:46:18,248 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-20 11:46:18,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:46:18,248 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449897299] [2022-11-20 11:46:18,249 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1449897299] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:46:18,249 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:46:18,249 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 11:46:18,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951460133] [2022-11-20 11:46:18,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:46:18,250 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 11:46:18,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:46:18,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 11:46:18,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 11:46:18,251 INFO L87 Difference]: Start difference. First operand 724 states and 1031 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 3 states have internal predecessors, (59), 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-20 11:46:18,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:46:18,388 INFO L93 Difference]: Finished difference Result 1363 states and 1972 transitions. [2022-11-20 11:46:18,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 11:46:18,389 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 3 states have internal predecessors, (59), 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 74 [2022-11-20 11:46:18,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:46:18,394 INFO L225 Difference]: With dead ends: 1363 [2022-11-20 11:46:18,394 INFO L226 Difference]: Without dead ends: 744 [2022-11-20 11:46:18,397 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-20 11:46:18,397 INFO L413 NwaCegarLoop]: 251 mSDtfsCounter, 6 mSDsluCounter, 493 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 744 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-20 11:46:18,398 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 744 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 11:46:18,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 744 states. [2022-11-20 11:46:18,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 744 to 744. [2022-11-20 11:46:18,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 744 states, 570 states have (on average 1.4017543859649122) internal successors, (799), 573 states have internal predecessors, (799), 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-20 11:46:18,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 744 states to 744 states and 1047 transitions. [2022-11-20 11:46:18,489 INFO L78 Accepts]: Start accepts. Automaton has 744 states and 1047 transitions. Word has length 74 [2022-11-20 11:46:18,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:46:18,489 INFO L495 AbstractCegarLoop]: Abstraction has 744 states and 1047 transitions. [2022-11-20 11:46:18,490 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 3 states have internal predecessors, (59), 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-20 11:46:18,490 INFO L276 IsEmpty]: Start isEmpty. Operand 744 states and 1047 transitions. [2022-11-20 11:46:18,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-11-20 11:46:18,492 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:46:18,492 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] [2022-11-20 11:46:18,492 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-20 11:46:18,492 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:46:18,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:46:18,493 INFO L85 PathProgramCache]: Analyzing trace with hash -413070943, now seen corresponding path program 1 times [2022-11-20 11:46:18,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:46:18,494 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547972393] [2022-11-20 11:46:18,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:46:18,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:46:18,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:46:18,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-20 11:46:18,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:46:18,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-20 11:46:18,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:46:18,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-11-20 11:46:18,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:46:18,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-11-20 11:46:18,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:46:18,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-11-20 11:46:18,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:46:18,682 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-20 11:46:18,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:46:18,683 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547972393] [2022-11-20 11:46:18,683 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547972393] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:46:18,684 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:46:18,684 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 11:46:18,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637397469] [2022-11-20 11:46:18,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:46:18,685 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 11:46:18,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:46:18,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 11:46:18,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 11:46:18,686 INFO L87 Difference]: Start difference. First operand 744 states and 1047 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 3 states have internal predecessors, (59), 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-20 11:46:18,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:46:18,838 INFO L93 Difference]: Finished difference Result 1399 states and 1988 transitions. [2022-11-20 11:46:18,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 11:46:18,839 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 3 states have internal predecessors, (59), 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 74 [2022-11-20 11:46:18,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:46:18,845 INFO L225 Difference]: With dead ends: 1399 [2022-11-20 11:46:18,845 INFO L226 Difference]: Without dead ends: 760 [2022-11-20 11:46:18,848 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-20 11:46:18,849 INFO L413 NwaCegarLoop]: 256 mSDtfsCounter, 5 mSDsluCounter, 497 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 753 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-20 11:46:18,849 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 753 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 11:46:18,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 760 states. [2022-11-20 11:46:18,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 760 to 760. [2022-11-20 11:46:18,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 760 states, 582 states have (on average 1.3934707903780068) internal successors, (811), 585 states have internal predecessors, (811), 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-20 11:46:18,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 760 states to 760 states and 1059 transitions. [2022-11-20 11:46:18,941 INFO L78 Accepts]: Start accepts. Automaton has 760 states and 1059 transitions. Word has length 74 [2022-11-20 11:46:18,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:46:18,942 INFO L495 AbstractCegarLoop]: Abstraction has 760 states and 1059 transitions. [2022-11-20 11:46:18,942 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 3 states have internal predecessors, (59), 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-20 11:46:18,942 INFO L276 IsEmpty]: Start isEmpty. Operand 760 states and 1059 transitions. [2022-11-20 11:46:18,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-11-20 11:46:18,945 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:46:18,945 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] [2022-11-20 11:46:18,945 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-20 11:46:18,945 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:46:18,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:46:18,946 INFO L85 PathProgramCache]: Analyzing trace with hash -2001058616, now seen corresponding path program 1 times [2022-11-20 11:46:18,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:46:18,947 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247409249] [2022-11-20 11:46:18,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:46:18,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:46:19,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:46:19,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-20 11:46:19,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:46:19,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-20 11:46:19,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:46:19,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-11-20 11:46:19,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:46:19,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-11-20 11:46:19,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:46:19,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-11-20 11:46:19,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:46:19,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-11-20 11:46:19,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:46:19,250 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-20 11:46:19,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:46:19,251 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247409249] [2022-11-20 11:46:19,251 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247409249] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:46:19,251 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:46:19,252 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 11:46:19,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580938826] [2022-11-20 11:46:19,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:46:19,253 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 11:46:19,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:46:19,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 11:46:19,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 11:46:19,254 INFO L87 Difference]: Start difference. First operand 760 states and 1059 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, (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-20 11:46:19,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:46:19,415 INFO L93 Difference]: Finished difference Result 1439 states and 2024 transitions. [2022-11-20 11:46:19,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 11:46:19,416 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, (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 82 [2022-11-20 11:46:19,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:46:19,423 INFO L225 Difference]: With dead ends: 1439 [2022-11-20 11:46:19,423 INFO L226 Difference]: Without dead ends: 784 [2022-11-20 11:46:19,426 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-20 11:46:19,427 INFO L413 NwaCegarLoop]: 255 mSDtfsCounter, 7 mSDsluCounter, 500 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 755 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-20 11:46:19,428 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 755 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 11:46:19,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 784 states. [2022-11-20 11:46:19,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 784 to 784. [2022-11-20 11:46:19,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 784 states, 602 states have (on average 1.3803986710963456) internal successors, (831), 605 states have internal predecessors, (831), 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-20 11:46:19,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 1079 transitions. [2022-11-20 11:46:19,565 INFO L78 Accepts]: Start accepts. Automaton has 784 states and 1079 transitions. Word has length 82 [2022-11-20 11:46:19,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:46:19,565 INFO L495 AbstractCegarLoop]: Abstraction has 784 states and 1079 transitions. [2022-11-20 11:46:19,566 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, (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-20 11:46:19,566 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 1079 transitions. [2022-11-20 11:46:19,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-11-20 11:46:19,570 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:46:19,571 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] [2022-11-20 11:46:19,571 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-20 11:46:19,571 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:46:19,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:46:19,572 INFO L85 PathProgramCache]: Analyzing trace with hash -1222405877, now seen corresponding path program 1 times [2022-11-20 11:46:19,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:46:19,572 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358566873] [2022-11-20 11:46:19,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:46:19,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:46:19,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:46:19,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-20 11:46:19,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:46:19,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-20 11:46:19,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:46:19,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-11-20 11:46:19,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:46:19,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-11-20 11:46:19,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:46:19,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-11-20 11:46:19,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:46:19,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-11-20 11:46:19,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:46:19,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-11-20 11:46:19,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:46:19,998 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-20 11:46:19,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:46:19,998 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358566873] [2022-11-20 11:46:19,999 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1358566873] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:46:19,999 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:46:19,999 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-20 11:46:19,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115048442] [2022-11-20 11:46:20,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:46:20,000 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 11:46:20,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:46:20,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 11:46:20,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-20 11:46:20,001 INFO L87 Difference]: Start difference. First operand 784 states and 1079 transitions. Second operand has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 6 states have internal predecessors, (64), 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-20 11:46:20,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:46:20,555 INFO L93 Difference]: Finished difference Result 2291 states and 3197 transitions. [2022-11-20 11:46:20,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-20 11:46:20,557 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 6 states have internal predecessors, (64), 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 85 [2022-11-20 11:46:20,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:46:20,568 INFO L225 Difference]: With dead ends: 2291 [2022-11-20 11:46:20,569 INFO L226 Difference]: Without dead ends: 1612 [2022-11-20 11:46:20,572 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-20 11:46:20,573 INFO L413 NwaCegarLoop]: 343 mSDtfsCounter, 323 mSDsluCounter, 1554 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 341 SdHoareTripleChecker+Valid, 1897 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-20 11:46:20,574 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [341 Valid, 1897 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 11:46:20,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1612 states. [2022-11-20 11:46:20,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1612 to 1068. [2022-11-20 11:46:20,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1068 states, 813 states have (on average 1.3690036900369005) internal successors, (1113), 818 states have internal predecessors, (1113), 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-20 11:46:20,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1068 states to 1068 states and 1457 transitions. [2022-11-20 11:46:20,752 INFO L78 Accepts]: Start accepts. Automaton has 1068 states and 1457 transitions. Word has length 85 [2022-11-20 11:46:20,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:46:20,752 INFO L495 AbstractCegarLoop]: Abstraction has 1068 states and 1457 transitions. [2022-11-20 11:46:20,753 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 6 states have internal predecessors, (64), 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-20 11:46:20,753 INFO L276 IsEmpty]: Start isEmpty. Operand 1068 states and 1457 transitions. [2022-11-20 11:46:20,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-11-20 11:46:20,755 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:46:20,756 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] [2022-11-20 11:46:20,756 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-20 11:46:20,756 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:46:20,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:46:20,757 INFO L85 PathProgramCache]: Analyzing trace with hash -1993110303, now seen corresponding path program 1 times [2022-11-20 11:46:20,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:46:20,758 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947452437] [2022-11-20 11:46:20,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:46:20,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:46:20,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:46:21,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-20 11:46:21,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:46:21,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-20 11:46:21,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:46:21,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-11-20 11:46:21,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:46:21,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-11-20 11:46:21,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:46:21,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-11-20 11:46:21,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:46:21,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-11-20 11:46:21,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:46:21,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-11-20 11:46:21,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:46:21,176 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-20 11:46:21,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:46:21,177 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947452437] [2022-11-20 11:46:21,177 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1947452437] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:46:21,177 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:46:21,177 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-20 11:46:21,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928674950] [2022-11-20 11:46:21,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:46:21,178 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-20 11:46:21,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:46:21,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-20 11:46:21,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-20 11:46:21,180 INFO L87 Difference]: Start difference. First operand 1068 states and 1457 transitions. Second operand has 8 states, 6 states have (on average 10.666666666666666) internal successors, (64), 7 states have internal predecessors, (64), 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-20 11:46:21,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:46:21,620 INFO L93 Difference]: Finished difference Result 1492 states and 2133 transitions. [2022-11-20 11:46:21,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-20 11:46:21,621 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 10.666666666666666) internal successors, (64), 7 states have internal predecessors, (64), 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 88 [2022-11-20 11:46:21,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:46:21,630 INFO L225 Difference]: With dead ends: 1492 [2022-11-20 11:46:21,631 INFO L226 Difference]: Without dead ends: 1490 [2022-11-20 11:46:21,632 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-20 11:46:21,633 INFO L413 NwaCegarLoop]: 440 mSDtfsCounter, 320 mSDsluCounter, 2058 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 346 SdHoareTripleChecker+Valid, 2498 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.2s IncrementalHoareTripleChecker+Time [2022-11-20 11:46:21,634 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [346 Valid, 2498 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 11:46:21,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1490 states. [2022-11-20 11:46:21,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1490 to 1076. [2022-11-20 11:46:21,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1076 states, 817 states have (on average 1.3671970624235006) internal successors, (1117), 824 states have internal predecessors, (1117), 174 states have call successors, (174), 84 states have call predecessors, (174), 84 states have return successors, (174), 167 states have call predecessors, (174), 174 states have call successors, (174) [2022-11-20 11:46:21,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1076 states to 1076 states and 1465 transitions. [2022-11-20 11:46:21,854 INFO L78 Accepts]: Start accepts. Automaton has 1076 states and 1465 transitions. Word has length 88 [2022-11-20 11:46:21,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:46:21,855 INFO L495 AbstractCegarLoop]: Abstraction has 1076 states and 1465 transitions. [2022-11-20 11:46:21,855 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 10.666666666666666) internal successors, (64), 7 states have internal predecessors, (64), 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-20 11:46:21,855 INFO L276 IsEmpty]: Start isEmpty. Operand 1076 states and 1465 transitions. [2022-11-20 11:46:21,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-11-20 11:46:21,857 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:46:21,859 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] [2022-11-20 11:46:21,859 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-20 11:46:21,859 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:46:21,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:46:21,860 INFO L85 PathProgramCache]: Analyzing trace with hash 593545677, now seen corresponding path program 1 times [2022-11-20 11:46:21,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:46:21,861 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365037486] [2022-11-20 11:46:21,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:46:21,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:46:21,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:46:22,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-20 11:46:22,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:46:22,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-20 11:46:22,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:46:22,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-11-20 11:46:22,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:46:22,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-11-20 11:46:22,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:46:22,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-11-20 11:46:22,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:46:22,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-11-20 11:46:22,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:46:22,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-11-20 11:46:22,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:46:22,094 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-20 11:46:22,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:46:22,095 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365037486] [2022-11-20 11:46:22,095 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365037486] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:46:22,095 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:46:22,096 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 11:46:22,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670555283] [2022-11-20 11:46:22,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:46:22,097 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 11:46:22,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:46:22,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 11:46:22,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 11:46:22,099 INFO L87 Difference]: Start difference. First operand 1076 states and 1465 transitions. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 3 states have internal predecessors, (68), 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-20 11:46:22,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:46:22,287 INFO L93 Difference]: Finished difference Result 2003 states and 2748 transitions. [2022-11-20 11:46:22,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 11:46:22,287 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 3 states have internal predecessors, (68), 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 89 [2022-11-20 11:46:22,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:46:22,294 INFO L225 Difference]: With dead ends: 2003 [2022-11-20 11:46:22,294 INFO L226 Difference]: Without dead ends: 1100 [2022-11-20 11:46:22,299 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-20 11:46:22,300 INFO L413 NwaCegarLoop]: 256 mSDtfsCounter, 5 mSDsluCounter, 497 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 753 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-20 11:46:22,301 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 753 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 11:46:22,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1100 states. [2022-11-20 11:46:22,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1100 to 1100. [2022-11-20 11:46:22,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1100 states, 835 states have (on average 1.3592814371257484) internal successors, (1135), 842 states have internal predecessors, (1135), 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-20 11:46:22,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1100 states to 1100 states and 1483 transitions. [2022-11-20 11:46:22,531 INFO L78 Accepts]: Start accepts. Automaton has 1100 states and 1483 transitions. Word has length 89 [2022-11-20 11:46:22,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:46:22,532 INFO L495 AbstractCegarLoop]: Abstraction has 1100 states and 1483 transitions. [2022-11-20 11:46:22,533 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 3 states have internal predecessors, (68), 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-20 11:46:22,533 INFO L276 IsEmpty]: Start isEmpty. Operand 1100 states and 1483 transitions. [2022-11-20 11:46:22,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-11-20 11:46:22,539 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:46:22,540 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] [2022-11-20 11:46:22,540 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-20 11:46:22,541 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:46:22,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:46:22,541 INFO L85 PathProgramCache]: Analyzing trace with hash 365385979, now seen corresponding path program 1 times [2022-11-20 11:46:22,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:46:22,542 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608006044] [2022-11-20 11:46:22,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:46:22,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:46:22,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:46:22,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-20 11:46:22,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:46:22,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-20 11:46:22,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:46:22,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-11-20 11:46:22,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:46:22,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-11-20 11:46:22,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:46:22,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-11-20 11:46:22,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:46:22,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-11-20 11:46:22,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:46:22,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-11-20 11:46:22,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:46:22,806 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-20 11:46:22,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:46:22,807 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608006044] [2022-11-20 11:46:22,807 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1608006044] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:46:22,808 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:46:22,808 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-20 11:46:22,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435293377] [2022-11-20 11:46:22,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:46:22,809 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 11:46:22,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:46:22,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 11:46:22,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-20 11:46:22,810 INFO L87 Difference]: Start difference. First operand 1100 states and 1483 transitions. Second operand has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 6 states have internal predecessors, (67), 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-20 11:46:23,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:46:23,239 INFO L93 Difference]: Finished difference Result 2166 states and 2964 transitions. [2022-11-20 11:46:23,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-20 11:46:23,240 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 6 states have internal predecessors, (67), 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 91 [2022-11-20 11:46:23,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:46:23,248 INFO L225 Difference]: With dead ends: 2166 [2022-11-20 11:46:23,249 INFO L226 Difference]: Without dead ends: 1321 [2022-11-20 11:46:23,252 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 18 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-20 11:46:23,253 INFO L413 NwaCegarLoop]: 336 mSDtfsCounter, 360 mSDsluCounter, 1521 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 365 SdHoareTripleChecker+Valid, 1857 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.2s IncrementalHoareTripleChecker+Time [2022-11-20 11:46:23,253 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [365 Valid, 1857 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 11:46:23,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1321 states. [2022-11-20 11:46:23,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1321 to 1105. [2022-11-20 11:46:23,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1105 states, 851 states have (on average 1.3490011750881317) internal successors, (1148), 863 states have internal predecessors, (1148), 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-20 11:46:23,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1105 states to 1105 states and 1472 transitions. [2022-11-20 11:46:23,470 INFO L78 Accepts]: Start accepts. Automaton has 1105 states and 1472 transitions. Word has length 91 [2022-11-20 11:46:23,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:46:23,471 INFO L495 AbstractCegarLoop]: Abstraction has 1105 states and 1472 transitions. [2022-11-20 11:46:23,471 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 6 states have internal predecessors, (67), 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-20 11:46:23,471 INFO L276 IsEmpty]: Start isEmpty. Operand 1105 states and 1472 transitions. [2022-11-20 11:46:23,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-11-20 11:46:23,473 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:46:23,473 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] [2022-11-20 11:46:23,474 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-20 11:46:23,474 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:46:23,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:46:23,475 INFO L85 PathProgramCache]: Analyzing trace with hash 1553183217, now seen corresponding path program 1 times [2022-11-20 11:46:23,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:46:23,475 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46301913] [2022-11-20 11:46:23,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:46:23,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:46:23,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:46:23,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-20 11:46:23,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:46:23,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-20 11:46:23,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:46:23,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-11-20 11:46:23,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:46:23,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-11-20 11:46:23,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:46:23,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-11-20 11:46:23,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:46:23,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-11-20 11:46:23,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:46:23,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-11-20 11:46:23,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:46:23,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-11-20 11:46:23,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:46:23,889 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-20 11:46:23,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:46:23,892 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46301913] [2022-11-20 11:46:23,892 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [46301913] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:46:23,893 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:46:23,893 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-20 11:46:23,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992500001] [2022-11-20 11:46:23,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:46:23,894 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 11:46:23,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:46:23,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 11:46:23,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-20 11:46:23,895 INFO L87 Difference]: Start difference. First operand 1105 states and 1472 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, (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-20 11:46:24,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:46:24,419 INFO L93 Difference]: Finished difference Result 2235 states and 3053 transitions. [2022-11-20 11:46:24,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-20 11:46:24,420 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, (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 93 [2022-11-20 11:46:24,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:46:24,428 INFO L225 Difference]: With dead ends: 2235 [2022-11-20 11:46:24,428 INFO L226 Difference]: Without dead ends: 1365 [2022-11-20 11:46:24,431 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-20 11:46:24,432 INFO L413 NwaCegarLoop]: 366 mSDtfsCounter, 285 mSDsluCounter, 1641 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 299 SdHoareTripleChecker+Valid, 2007 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.2s IncrementalHoareTripleChecker+Time [2022-11-20 11:46:24,432 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [299 Valid, 2007 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 11:46:24,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1365 states. [2022-11-20 11:46:24,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1365 to 995. [2022-11-20 11:46:24,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 995 states, 768 states have (on average 1.3515625) internal successors, (1038), 778 states have internal predecessors, (1038), 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-20 11:46:24,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 995 states to 995 states and 1328 transitions. [2022-11-20 11:46:24,610 INFO L78 Accepts]: Start accepts. Automaton has 995 states and 1328 transitions. Word has length 93 [2022-11-20 11:46:24,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:46:24,611 INFO L495 AbstractCegarLoop]: Abstraction has 995 states and 1328 transitions. [2022-11-20 11:46:24,611 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, (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-20 11:46:24,612 INFO L276 IsEmpty]: Start isEmpty. Operand 995 states and 1328 transitions. [2022-11-20 11:46:24,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-11-20 11:46:24,613 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:46:24,613 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] [2022-11-20 11:46:24,614 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-20 11:46:24,614 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:46:24,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:46:24,615 INFO L85 PathProgramCache]: Analyzing trace with hash -2008252193, now seen corresponding path program 1 times [2022-11-20 11:46:24,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:46:24,615 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770568542] [2022-11-20 11:46:24,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:46:24,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:46:24,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:46:24,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-20 11:46:24,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:46:24,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-20 11:46:24,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:46:24,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-11-20 11:46:24,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:46:24,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-11-20 11:46:24,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:46:24,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-11-20 11:46:24,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:46:24,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-11-20 11:46:24,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:46:25,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-11-20 11:46:25,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:46:25,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-11-20 11:46:25,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:46:25,034 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-20 11:46:25,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:46:25,034 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770568542] [2022-11-20 11:46:25,035 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [770568542] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:46:25,035 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:46:25,035 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-20 11:46:25,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512157978] [2022-11-20 11:46:25,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:46:25,036 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-20 11:46:25,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:46:25,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-20 11:46:25,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-20 11:46:25,037 INFO L87 Difference]: Start difference. First operand 995 states and 1328 transitions. Second operand has 8 states, 8 states have (on average 8.875) internal successors, (71), 7 states have internal predecessors, (71), 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-20 11:46:26,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:46:26,282 INFO L93 Difference]: Finished difference Result 2294 states and 3142 transitions. [2022-11-20 11:46:26,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-20 11:46:26,283 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.875) internal successors, (71), 7 states have internal predecessors, (71), 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 94 [2022-11-20 11:46:26,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:46:26,292 INFO L225 Difference]: With dead ends: 2294 [2022-11-20 11:46:26,292 INFO L226 Difference]: Without dead ends: 1454 [2022-11-20 11:46:26,295 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-20 11:46:26,296 INFO L413 NwaCegarLoop]: 421 mSDtfsCounter, 768 mSDsluCounter, 1624 mSDsCounter, 0 mSdLazyCounter, 503 mSolverCounterSat, 125 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 774 SdHoareTripleChecker+Valid, 2045 SdHoareTripleChecker+Invalid, 628 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 125 IncrementalHoareTripleChecker+Valid, 503 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-20 11:46:26,297 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [774 Valid, 2045 Invalid, 628 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [125 Valid, 503 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-20 11:46:26,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1454 states. [2022-11-20 11:46:26,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1454 to 1011. [2022-11-20 11:46:26,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1011 states, 776 states have (on average 1.3286082474226804) internal successors, (1031), 787 states have internal predecessors, (1031), 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-20 11:46:26,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1011 states to 1011 states and 1327 transitions. [2022-11-20 11:46:26,594 INFO L78 Accepts]: Start accepts. Automaton has 1011 states and 1327 transitions. Word has length 94 [2022-11-20 11:46:26,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:46:26,595 INFO L495 AbstractCegarLoop]: Abstraction has 1011 states and 1327 transitions. [2022-11-20 11:46:26,595 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.875) internal successors, (71), 7 states have internal predecessors, (71), 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-20 11:46:26,595 INFO L276 IsEmpty]: Start isEmpty. Operand 1011 states and 1327 transitions. [2022-11-20 11:46:26,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2022-11-20 11:46:26,598 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:46:26,598 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] [2022-11-20 11:46:26,598 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-20 11:46:26,599 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:46:26,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:46:26,599 INFO L85 PathProgramCache]: Analyzing trace with hash -881975596, now seen corresponding path program 1 times [2022-11-20 11:46:26,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:46:26,600 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398227815] [2022-11-20 11:46:26,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:46:26,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:46:26,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:46:26,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-20 11:46:26,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:46:26,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-20 11:46:26,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:46:26,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-20 11:46:26,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:46:26,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-20 11:46:26,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:46:26,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-11-20 11:46:26,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:46:26,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-11-20 11:46:26,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:46:26,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-11-20 11:46:26,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:46:26,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-11-20 11:46:26,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:46:26,836 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-20 11:46:26,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:46:26,837 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398227815] [2022-11-20 11:46:26,838 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [398227815] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:46:26,838 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:46:26,838 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 11:46:26,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572141840] [2022-11-20 11:46:26,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:46:26,839 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 11:46:26,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:46:26,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 11:46:26,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 11:46:26,841 INFO L87 Difference]: Start difference. First operand 1011 states and 1327 transitions. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 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-20 11:46:27,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:46:27,511 INFO L93 Difference]: Finished difference Result 2858 states and 3825 transitions. [2022-11-20 11:46:27,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 11:46:27,512 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 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 95 [2022-11-20 11:46:27,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:46:27,524 INFO L225 Difference]: With dead ends: 2858 [2022-11-20 11:46:27,524 INFO L226 Difference]: Without dead ends: 2053 [2022-11-20 11:46:27,527 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-20 11:46:27,528 INFO L413 NwaCegarLoop]: 447 mSDtfsCounter, 369 mSDsluCounter, 638 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 369 SdHoareTripleChecker+Valid, 1085 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.2s IncrementalHoareTripleChecker+Time [2022-11-20 11:46:27,528 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [369 Valid, 1085 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 11:46:27,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2053 states. [2022-11-20 11:46:27,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2053 to 1748. [2022-11-20 11:46:27,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1748 states, 1323 states have (on average 1.3227513227513228) internal successors, (1750), 1342 states have internal predecessors, (1750), 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-20 11:46:27,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1748 states to 1748 states and 2294 transitions. [2022-11-20 11:46:27,871 INFO L78 Accepts]: Start accepts. Automaton has 1748 states and 2294 transitions. Word has length 95 [2022-11-20 11:46:27,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:46:27,872 INFO L495 AbstractCegarLoop]: Abstraction has 1748 states and 2294 transitions. [2022-11-20 11:46:27,872 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 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-20 11:46:27,872 INFO L276 IsEmpty]: Start isEmpty. Operand 1748 states and 2294 transitions. [2022-11-20 11:46:27,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-11-20 11:46:27,874 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:46:27,876 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-20 11:46:27,876 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-20 11:46:27,877 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:46:27,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:46:27,877 INFO L85 PathProgramCache]: Analyzing trace with hash -859536375, now seen corresponding path program 1 times [2022-11-20 11:46:27,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:46:27,878 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092507022] [2022-11-20 11:46:27,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:46:27,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:46:27,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:46:28,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-20 11:46:28,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:46:28,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-20 11:46:28,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:46:28,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-20 11:46:28,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:46:28,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-20 11:46:28,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:46:28,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-11-20 11:46:28,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:46:28,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-11-20 11:46:28,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:46:28,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-11-20 11:46:28,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:46:28,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-11-20 11:46:28,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:46:28,352 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-20 11:46:28,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:46:28,352 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092507022] [2022-11-20 11:46:28,353 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1092507022] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:46:28,353 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:46:28,353 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-20 11:46:28,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948722207] [2022-11-20 11:46:28,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:46:28,354 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 11:46:28,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:46:28,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 11:46:28,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-20 11:46:28,356 INFO L87 Difference]: Start difference. First operand 1748 states and 2294 transitions. Second operand has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 6 states have internal predecessors, (74), 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-20 11:46:29,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:46:29,859 INFO L93 Difference]: Finished difference Result 3885 states and 5222 transitions. [2022-11-20 11:46:29,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-20 11:46:29,860 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 6 states have internal predecessors, (74), 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 97 [2022-11-20 11:46:29,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:46:29,874 INFO L225 Difference]: With dead ends: 3885 [2022-11-20 11:46:29,874 INFO L226 Difference]: Without dead ends: 2421 [2022-11-20 11:46:29,879 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-20 11:46:29,881 INFO L413 NwaCegarLoop]: 462 mSDtfsCounter, 684 mSDsluCounter, 1526 mSDsCounter, 0 mSdLazyCounter, 397 mSolverCounterSat, 195 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 687 SdHoareTripleChecker+Valid, 1988 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.7s IncrementalHoareTripleChecker+Time [2022-11-20 11:46:29,881 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [687 Valid, 1988 Invalid, 592 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [195 Valid, 397 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-20 11:46:29,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2421 states. [2022-11-20 11:46:30,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2421 to 1775. [2022-11-20 11:46:30,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1775 states, 1337 states have (on average 1.3163799551234106) internal successors, (1760), 1357 states have internal predecessors, (1760), 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-20 11:46:30,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1775 states to 1775 states and 2320 transitions. [2022-11-20 11:46:30,329 INFO L78 Accepts]: Start accepts. Automaton has 1775 states and 2320 transitions. Word has length 97 [2022-11-20 11:46:30,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:46:30,330 INFO L495 AbstractCegarLoop]: Abstraction has 1775 states and 2320 transitions. [2022-11-20 11:46:30,330 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 6 states have internal predecessors, (74), 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-20 11:46:30,330 INFO L276 IsEmpty]: Start isEmpty. Operand 1775 states and 2320 transitions. [2022-11-20 11:46:30,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-11-20 11:46:30,333 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:46:30,333 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-20 11:46:30,333 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-20 11:46:30,334 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:46:30,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:46:30,334 INFO L85 PathProgramCache]: Analyzing trace with hash -1682651474, now seen corresponding path program 1 times [2022-11-20 11:46:30,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:46:30,335 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506269263] [2022-11-20 11:46:30,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:46:30,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:46:30,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:46:30,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-20 11:46:30,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:46:30,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-20 11:46:30,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:46:30,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-20 11:46:30,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:46:30,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-11-20 11:46:30,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:46:30,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-11-20 11:46:30,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:46:30,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-11-20 11:46:30,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:46:30,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-11-20 11:46:30,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:46:30,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-11-20 11:46:30,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:46:30,538 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-20 11:46:30,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:46:30,539 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506269263] [2022-11-20 11:46:30,539 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [506269263] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:46:30,539 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:46:30,540 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 11:46:30,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856803066] [2022-11-20 11:46:30,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:46:30,542 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 11:46:30,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:46:30,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 11:46:30,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 11:46:30,544 INFO L87 Difference]: Start difference. First operand 1775 states and 2320 transitions. Second operand has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 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-20 11:46:31,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:46:31,544 INFO L93 Difference]: Finished difference Result 4618 states and 6091 transitions. [2022-11-20 11:46:31,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 11:46:31,545 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 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 99 [2022-11-20 11:46:31,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:46:31,566 INFO L225 Difference]: With dead ends: 4618 [2022-11-20 11:46:31,566 INFO L226 Difference]: Without dead ends: 3170 [2022-11-20 11:46:31,573 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-20 11:46:31,574 INFO L413 NwaCegarLoop]: 463 mSDtfsCounter, 396 mSDsluCounter, 672 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 396 SdHoareTripleChecker+Valid, 1135 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-20 11:46:31,574 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [396 Valid, 1135 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 11:46:31,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3170 states. [2022-11-20 11:46:32,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3170 to 2786. [2022-11-20 11:46:32,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2786 states, 2073 states have (on average 1.3077665219488663) internal successors, (2711), 2104 states have internal predecessors, (2711), 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-20 11:46:32,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2786 states to 2786 states and 3631 transitions. [2022-11-20 11:46:32,316 INFO L78 Accepts]: Start accepts. Automaton has 2786 states and 3631 transitions. Word has length 99 [2022-11-20 11:46:32,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:46:32,317 INFO L495 AbstractCegarLoop]: Abstraction has 2786 states and 3631 transitions. [2022-11-20 11:46:32,318 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 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-20 11:46:32,319 INFO L276 IsEmpty]: Start isEmpty. Operand 2786 states and 3631 transitions. [2022-11-20 11:46:32,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-11-20 11:46:32,323 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:46:32,323 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-20 11:46:32,323 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-11-20 11:46:32,324 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:46:32,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:46:32,325 INFO L85 PathProgramCache]: Analyzing trace with hash 341094078, now seen corresponding path program 1 times [2022-11-20 11:46:32,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:46:32,325 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729088483] [2022-11-20 11:46:32,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:46:32,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:46:32,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:46:32,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-20 11:46:32,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:46:32,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-20 11:46:32,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:46:32,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-11-20 11:46:32,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:46:32,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-11-20 11:46:32,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:46:32,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-11-20 11:46:32,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:46:32,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-11-20 11:46:32,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:46:32,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-11-20 11:46:32,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:46:32,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-11-20 11:46:32,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:46:32,500 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-20 11:46:32,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:46:32,501 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729088483] [2022-11-20 11:46:32,501 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1729088483] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:46:32,501 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:46:32,501 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 11:46:32,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684851665] [2022-11-20 11:46:32,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:46:32,502 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 11:46:32,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:46:32,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 11:46:32,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 11:46:32,504 INFO L87 Difference]: Start difference. First operand 2786 states and 3631 transitions. Second operand has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 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-20 11:46:33,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:46:33,496 INFO L93 Difference]: Finished difference Result 6608 states and 8673 transitions. [2022-11-20 11:46:33,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 11:46:33,497 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 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 99 [2022-11-20 11:46:33,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:46:33,551 INFO L225 Difference]: With dead ends: 6608 [2022-11-20 11:46:33,551 INFO L226 Difference]: Without dead ends: 4265 [2022-11-20 11:46:33,561 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-20 11:46:33,562 INFO L413 NwaCegarLoop]: 471 mSDtfsCounter, 370 mSDsluCounter, 651 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 370 SdHoareTripleChecker+Valid, 1122 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-20 11:46:33,563 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [370 Valid, 1122 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 11:46:33,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4265 states. [2022-11-20 11:46:34,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4265 to 3993. [2022-11-20 11:46:34,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3993 states, 2956 states have (on average 1.30446549391069) internal successors, (3856), 3000 states have internal predecessors, (3856), 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-20 11:46:34,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3993 states to 3993 states and 5200 transitions. [2022-11-20 11:46:34,388 INFO L78 Accepts]: Start accepts. Automaton has 3993 states and 5200 transitions. Word has length 99 [2022-11-20 11:46:34,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:46:34,389 INFO L495 AbstractCegarLoop]: Abstraction has 3993 states and 5200 transitions. [2022-11-20 11:46:34,389 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 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-20 11:46:34,389 INFO L276 IsEmpty]: Start isEmpty. Operand 3993 states and 5200 transitions. [2022-11-20 11:46:34,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-11-20 11:46:34,392 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:46:34,393 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] [2022-11-20 11:46:34,393 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-11-20 11:46:34,393 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:46:34,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:46:34,394 INFO L85 PathProgramCache]: Analyzing trace with hash 1099513161, now seen corresponding path program 1 times [2022-11-20 11:46:34,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:46:34,394 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462534377] [2022-11-20 11:46:34,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:46:34,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:46:34,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:46:34,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-20 11:46:34,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:46:34,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-20 11:46:34,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:46:34,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-20 11:46:34,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:46:34,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-11-20 11:46:34,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:46:34,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-11-20 11:46:34,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:46:34,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-11-20 11:46:34,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:46:34,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-11-20 11:46:34,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:46:34,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-11-20 11:46:34,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:46:34,544 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-20 11:46:34,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:46:34,545 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462534377] [2022-11-20 11:46:34,545 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1462534377] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:46:34,545 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:46:34,545 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 11:46:34,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767211336] [2022-11-20 11:46:34,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:46:34,547 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 11:46:34,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:46:34,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 11:46:34,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 11:46:34,548 INFO L87 Difference]: Start difference. First operand 3993 states and 5200 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 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-20 11:46:35,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:46:35,920 INFO L93 Difference]: Finished difference Result 9013 states and 12170 transitions. [2022-11-20 11:46:35,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 11:46:35,923 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 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 100 [2022-11-20 11:46:35,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:46:35,953 INFO L225 Difference]: With dead ends: 9013 [2022-11-20 11:46:35,954 INFO L226 Difference]: Without dead ends: 5362 [2022-11-20 11:46:35,963 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-20 11:46:35,964 INFO L413 NwaCegarLoop]: 404 mSDtfsCounter, 120 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 627 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 11:46:35,966 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 627 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 11:46:35,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5362 states. [2022-11-20 11:46:36,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5362 to 3999. [2022-11-20 11:46:36,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3999 states, 2962 states have (on average 1.3038487508440244) internal successors, (3862), 3006 states have internal predecessors, (3862), 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-20 11:46:36,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3999 states to 3999 states and 5206 transitions. [2022-11-20 11:46:36,870 INFO L78 Accepts]: Start accepts. Automaton has 3999 states and 5206 transitions. Word has length 100 [2022-11-20 11:46:36,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:46:36,870 INFO L495 AbstractCegarLoop]: Abstraction has 3999 states and 5206 transitions. [2022-11-20 11:46:36,871 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 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-20 11:46:36,871 INFO L276 IsEmpty]: Start isEmpty. Operand 3999 states and 5206 transitions. [2022-11-20 11:46:36,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-11-20 11:46:36,874 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:46:36,874 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-20 11:46:36,875 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-11-20 11:46:36,875 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:46:36,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:46:36,875 INFO L85 PathProgramCache]: Analyzing trace with hash -917596551, now seen corresponding path program 1 times [2022-11-20 11:46:36,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:46:36,876 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149285902] [2022-11-20 11:46:36,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:46:36,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:46:36,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:46:37,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-20 11:46:37,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:46:37,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-20 11:46:37,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:46:37,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-11-20 11:46:37,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:46:37,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-11-20 11:46:37,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:46:37,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-11-20 11:46:37,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:46:37,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-11-20 11:46:37,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:46:37,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-11-20 11:46:37,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:46:37,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-11-20 11:46:37,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:46:37,075 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-20 11:46:37,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:46:37,076 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149285902] [2022-11-20 11:46:37,076 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1149285902] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:46:37,076 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:46:37,076 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 11:46:37,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142310659] [2022-11-20 11:46:37,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:46:37,081 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 11:46:37,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:46:37,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 11:46:37,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 11:46:37,082 INFO L87 Difference]: Start difference. First operand 3999 states and 5206 transitions. Second operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 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-20 11:46:38,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:46:38,077 INFO L93 Difference]: Finished difference Result 8411 states and 11204 transitions. [2022-11-20 11:46:38,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 11:46:38,077 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), 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 101 [2022-11-20 11:46:38,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:46:38,096 INFO L225 Difference]: With dead ends: 8411 [2022-11-20 11:46:38,096 INFO L226 Difference]: Without dead ends: 4484 [2022-11-20 11:46:38,107 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-20 11:46:38,108 INFO L413 NwaCegarLoop]: 289 mSDtfsCounter, 250 mSDsluCounter, 487 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 275 SdHoareTripleChecker+Valid, 776 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-20 11:46:38,108 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [275 Valid, 776 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 11:46:38,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4484 states. [2022-11-20 11:46:39,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4484 to 3652. [2022-11-20 11:46:39,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3652 states, 2698 states have (on average 1.312824314306894) internal successors, (3542), 2732 states have internal predecessors, (3542), 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-20 11:46:39,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3652 states to 3652 states and 4782 transitions. [2022-11-20 11:46:39,062 INFO L78 Accepts]: Start accepts. Automaton has 3652 states and 4782 transitions. Word has length 101 [2022-11-20 11:46:39,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:46:39,063 INFO L495 AbstractCegarLoop]: Abstraction has 3652 states and 4782 transitions. [2022-11-20 11:46:39,063 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), 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-20 11:46:39,063 INFO L276 IsEmpty]: Start isEmpty. Operand 3652 states and 4782 transitions. [2022-11-20 11:46:39,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2022-11-20 11:46:39,066 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:46:39,066 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-20 11:46:39,069 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-11-20 11:46:39,069 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:46:39,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:46:39,070 INFO L85 PathProgramCache]: Analyzing trace with hash 1897671897, now seen corresponding path program 1 times [2022-11-20 11:46:39,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:46:39,070 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322672815] [2022-11-20 11:46:39,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:46:39,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:46:39,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:46:39,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-20 11:46:39,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:46:39,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-20 11:46:39,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:46:39,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-20 11:46:39,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:46:39,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-11-20 11:46:39,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:46:39,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-11-20 11:46:39,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:46:39,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-11-20 11:46:39,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:46:39,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-11-20 11:46:39,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:46:39,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-11-20 11:46:39,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:46:39,186 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-20 11:46:39,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:46:39,186 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322672815] [2022-11-20 11:46:39,187 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [322672815] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:46:39,187 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:46:39,187 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 11:46:39,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706412309] [2022-11-20 11:46:39,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:46:39,188 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 11:46:39,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:46:39,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 11:46:39,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 11:46:39,190 INFO L87 Difference]: Start difference. First operand 3652 states and 4782 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-20 11:46:40,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:46:40,344 INFO L93 Difference]: Finished difference Result 8011 states and 10764 transitions. [2022-11-20 11:46:40,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 11:46:40,345 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-20 11:46:40,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:46:40,364 INFO L225 Difference]: With dead ends: 8011 [2022-11-20 11:46:40,365 INFO L226 Difference]: Without dead ends: 4534 [2022-11-20 11:46:40,373 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-20 11:46:40,374 INFO L413 NwaCegarLoop]: 387 mSDtfsCounter, 120 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 608 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 11:46:40,375 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 608 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 11:46:40,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4534 states. [2022-11-20 11:46:41,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4534 to 3662. [2022-11-20 11:46:41,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3662 states, 2708 states have (on average 1.3116691285081241) internal successors, (3552), 2742 states have internal predecessors, (3552), 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-20 11:46:41,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3662 states to 3662 states and 4792 transitions. [2022-11-20 11:46:41,099 INFO L78 Accepts]: Start accepts. Automaton has 3662 states and 4792 transitions. Word has length 102 [2022-11-20 11:46:41,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:46:41,100 INFO L495 AbstractCegarLoop]: Abstraction has 3662 states and 4792 transitions. [2022-11-20 11:46:41,100 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-20 11:46:41,101 INFO L276 IsEmpty]: Start isEmpty. Operand 3662 states and 4792 transitions. [2022-11-20 11:46:41,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2022-11-20 11:46:41,103 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:46:41,103 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-20 11:46:41,103 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-11-20 11:46:41,104 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:46:41,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:46:41,104 INFO L85 PathProgramCache]: Analyzing trace with hash -184950786, now seen corresponding path program 1 times [2022-11-20 11:46:41,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:46:41,105 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264498916] [2022-11-20 11:46:41,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:46:41,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:46:41,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:46:41,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-20 11:46:41,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:46:41,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-20 11:46:41,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:46:41,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-20 11:46:41,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:46:41,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-11-20 11:46:41,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:46:41,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-11-20 11:46:41,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:46:41,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-11-20 11:46:41,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:46:41,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-11-20 11:46:41,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:46:41,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-11-20 11:46:41,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:46:41,331 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-20 11:46:41,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:46:41,331 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264498916] [2022-11-20 11:46:41,332 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1264498916] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:46:41,332 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:46:41,332 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 11:46:41,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306449281] [2022-11-20 11:46:41,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:46:41,334 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 11:46:41,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:46:41,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 11:46:41,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 11:46:41,336 INFO L87 Difference]: Start difference. First operand 3662 states and 4792 transitions. Second operand has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 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-20 11:46:42,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:46:42,362 INFO L93 Difference]: Finished difference Result 7997 states and 10736 transitions. [2022-11-20 11:46:42,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 11:46:42,363 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 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-20 11:46:42,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:46:42,383 INFO L225 Difference]: With dead ends: 7997 [2022-11-20 11:46:42,383 INFO L226 Difference]: Without dead ends: 4450 [2022-11-20 11:46:42,393 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-20 11:46:42,394 INFO L413 NwaCegarLoop]: 300 mSDtfsCounter, 198 mSDsluCounter, 493 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 793 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-20 11:46:42,396 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [223 Valid, 793 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 11:46:42,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4450 states. [2022-11-20 11:46:43,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4450 to 2753. [2022-11-20 11:46:43,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2753 states, 2033 states have (on average 1.3044761436301033) internal successors, (2652), 2052 states have internal predecessors, (2652), 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-20 11:46:43,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2753 states to 2753 states and 3590 transitions. [2022-11-20 11:46:43,092 INFO L78 Accepts]: Start accepts. Automaton has 2753 states and 3590 transitions. Word has length 102 [2022-11-20 11:46:43,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:46:43,092 INFO L495 AbstractCegarLoop]: Abstraction has 2753 states and 3590 transitions. [2022-11-20 11:46:43,093 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 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-20 11:46:43,093 INFO L276 IsEmpty]: Start isEmpty. Operand 2753 states and 3590 transitions. [2022-11-20 11:46:43,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2022-11-20 11:46:43,099 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:46:43,099 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] [2022-11-20 11:46:43,100 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-11-20 11:46:43,100 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:46:43,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:46:43,101 INFO L85 PathProgramCache]: Analyzing trace with hash 1480765435, now seen corresponding path program 1 times [2022-11-20 11:46:43,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:46:43,101 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912913442] [2022-11-20 11:46:43,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:46:43,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:46:43,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:46:43,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-20 11:46:43,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:46:43,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-20 11:46:43,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:46:43,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-11-20 11:46:43,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:46:43,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-11-20 11:46:43,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:46:43,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-11-20 11:46:43,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:46:43,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-11-20 11:46:43,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:46:43,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-11-20 11:46:43,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:46:43,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-11-20 11:46:43,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:46:43,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-11-20 11:46:43,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:46:43,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-11-20 11:46:43,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:46:43,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-11-20 11:46:43,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:46:43,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-11-20 11:46:43,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:46:43,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-11-20 11:46:43,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:46:43,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-11-20 11:46:43,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:46:43,619 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-20 11:46:43,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:46:43,619 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912913442] [2022-11-20 11:46:43,620 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [912913442] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:46:43,620 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [885341329] [2022-11-20 11:46:43,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:46:43,620 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:46:43,621 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11412ca0-d643-4d9b-a0b3-273b10d69dd1/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:46:43,627 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11412ca0-d643-4d9b-a0b3-273b10d69dd1/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:46:43,669 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11412ca0-d643-4d9b-a0b3-273b10d69dd1/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-20 11:46:43,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:46:43,905 INFO L263 TraceCheckSpWp]: Trace formula consists of 699 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-20 11:46:43,925 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:46:44,251 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-20 11:46:44,251 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:46:44,523 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-20 11:46:44,523 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [885341329] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 11:46:44,524 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 11:46:44,524 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2022-11-20 11:46:44,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196168982] [2022-11-20 11:46:44,524 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 11:46:44,525 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-20 11:46:44,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:46:44,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-20 11:46:44,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2022-11-20 11:46:44,527 INFO L87 Difference]: Start difference. First operand 2753 states and 3590 transitions. Second operand has 13 states, 13 states have (on average 15.076923076923077) internal successors, (196), 12 states have internal predecessors, (196), 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-20 11:46:51,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:46:51,625 INFO L93 Difference]: Finished difference Result 9028 states and 12624 transitions. [2022-11-20 11:46:51,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-11-20 11:46:51,626 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 15.076923076923077) internal successors, (196), 12 states have internal predecessors, (196), 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 152 [2022-11-20 11:46:51,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:46:51,656 INFO L225 Difference]: With dead ends: 9028 [2022-11-20 11:46:51,656 INFO L226 Difference]: Without dead ends: 6517 [2022-11-20 11:46:51,664 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 376 GetRequests, 333 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 499 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=383, Invalid=1509, Unknown=0, NotChecked=0, Total=1892 [2022-11-20 11:46:51,666 INFO L413 NwaCegarLoop]: 288 mSDtfsCounter, 3193 mSDsluCounter, 2008 mSDsCounter, 0 mSdLazyCounter, 1323 mSolverCounterSat, 1215 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3193 SdHoareTripleChecker+Valid, 2296 SdHoareTripleChecker+Invalid, 2538 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1215 IncrementalHoareTripleChecker+Valid, 1323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2022-11-20 11:46:51,666 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3193 Valid, 2296 Invalid, 2538 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1215 Valid, 1323 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2022-11-20 11:46:51,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6517 states. [2022-11-20 11:46:52,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6517 to 3504. [2022-11-20 11:46:52,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3504 states, 2595 states have (on average 1.2967244701348748) internal successors, (3365), 2619 states have internal predecessors, (3365), 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-20 11:46:52,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3504 states to 3504 states and 4535 transitions. [2022-11-20 11:46:52,680 INFO L78 Accepts]: Start accepts. Automaton has 3504 states and 4535 transitions. Word has length 152 [2022-11-20 11:46:52,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:46:52,680 INFO L495 AbstractCegarLoop]: Abstraction has 3504 states and 4535 transitions. [2022-11-20 11:46:52,681 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 15.076923076923077) internal successors, (196), 12 states have internal predecessors, (196), 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-20 11:46:52,681 INFO L276 IsEmpty]: Start isEmpty. Operand 3504 states and 4535 transitions. [2022-11-20 11:46:52,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2022-11-20 11:46:52,689 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:46:52,689 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] [2022-11-20 11:46:52,712 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11412ca0-d643-4d9b-a0b3-273b10d69dd1/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-20 11:46:52,913 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11412ca0-d643-4d9b-a0b3-273b10d69dd1/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-11-20 11:46:52,913 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:46:52,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:46:52,914 INFO L85 PathProgramCache]: Analyzing trace with hash 235563646, now seen corresponding path program 1 times [2022-11-20 11:46:52,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:46:52,914 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072414081] [2022-11-20 11:46:52,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:46:52,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:46:52,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:46:53,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-20 11:46:53,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:46:53,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-20 11:46:53,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:46:53,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-11-20 11:46:53,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:46:53,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-11-20 11:46:53,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:46:53,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-11-20 11:46:53,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:46:53,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-11-20 11:46:53,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:46:53,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-11-20 11:46:53,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:46:53,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-11-20 11:46:53,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:46:53,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-11-20 11:46:53,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:46:53,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-11-20 11:46:53,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:46:53,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-11-20 11:46:53,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:46:53,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-11-20 11:46:53,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:46:53,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-11-20 11:46:53,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:46:53,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-11-20 11:46:53,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:46:53,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2022-11-20 11:46:53,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:46:53,187 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-20 11:46:53,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:46:53,188 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072414081] [2022-11-20 11:46:53,188 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072414081] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:46:53,189 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:46:53,189 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-20 11:46:53,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666723500] [2022-11-20 11:46:53,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:46:53,190 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 11:46:53,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:46:53,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 11:46:53,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-20 11:46:53,191 INFO L87 Difference]: Start difference. First operand 3504 states and 4535 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 6 states have internal predecessors, (91), 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-20 11:46:56,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:46:56,323 INFO L93 Difference]: Finished difference Result 12002 states and 16257 transitions. [2022-11-20 11:46:56,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-20 11:46:56,327 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 6 states have internal predecessors, (91), 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 161 [2022-11-20 11:46:56,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:46:56,369 INFO L225 Difference]: With dead ends: 12002 [2022-11-20 11:46:56,370 INFO L226 Difference]: Without dead ends: 8846 [2022-11-20 11:46:56,380 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-20 11:46:56,381 INFO L413 NwaCegarLoop]: 429 mSDtfsCounter, 640 mSDsluCounter, 1917 mSDsCounter, 0 mSdLazyCounter, 261 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 659 SdHoareTripleChecker+Valid, 2346 SdHoareTripleChecker+Invalid, 365 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 11:46:56,382 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [659 Valid, 2346 Invalid, 365 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 261 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-20 11:46:56,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8846 states. [2022-11-20 11:46:58,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8846 to 6262. [2022-11-20 11:46:58,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6262 states, 4585 states have (on average 1.299454743729553) internal successors, (5958), 4631 states have internal predecessors, (5958), 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-20 11:46:58,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6262 states to 6262 states and 8148 transitions. [2022-11-20 11:46:58,051 INFO L78 Accepts]: Start accepts. Automaton has 6262 states and 8148 transitions. Word has length 161 [2022-11-20 11:46:58,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:46:58,052 INFO L495 AbstractCegarLoop]: Abstraction has 6262 states and 8148 transitions. [2022-11-20 11:46:58,053 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 6 states have internal predecessors, (91), 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-20 11:46:58,053 INFO L276 IsEmpty]: Start isEmpty. Operand 6262 states and 8148 transitions. [2022-11-20 11:46:58,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2022-11-20 11:46:58,066 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:46:58,066 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] [2022-11-20 11:46:58,067 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-11-20 11:46:58,067 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:46:58,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:46:58,068 INFO L85 PathProgramCache]: Analyzing trace with hash -165466816, now seen corresponding path program 1 times [2022-11-20 11:46:58,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:46:58,068 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442745110] [2022-11-20 11:46:58,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:46:58,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:46:58,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:46:58,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-20 11:46:58,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:46:58,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-20 11:46:58,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:46:58,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-20 11:46:58,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:46:58,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-20 11:46:58,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:46:58,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-11-20 11:46:58,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:46:58,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-11-20 11:46:58,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:46:58,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-11-20 11:46:58,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:46:58,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-11-20 11:46:58,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:46:58,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-11-20 11:46:58,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:46:58,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-11-20 11:46:58,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:46:58,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-11-20 11:46:58,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:46:58,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-11-20 11:46:58,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:46:58,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-11-20 11:46:58,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:46:58,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-11-20 11:46:58,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:46:58,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2022-11-20 11:46:58,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:46:58,792 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-20 11:46:58,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:46:58,792 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442745110] [2022-11-20 11:46:58,793 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1442745110] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:46:58,793 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1193996375] [2022-11-20 11:46:58,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:46:58,793 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:46:58,794 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11412ca0-d643-4d9b-a0b3-273b10d69dd1/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:46:58,795 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11412ca0-d643-4d9b-a0b3-273b10d69dd1/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:46:58,821 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11412ca0-d643-4d9b-a0b3-273b10d69dd1/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-20 11:46:59,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:46:59,069 INFO L263 TraceCheckSpWp]: Trace formula consists of 735 conjuncts, 16 conjunts are in the unsatisfiable core [2022-11-20 11:46:59,078 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:46:59,478 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-20 11:46:59,478 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:46:59,797 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-20 11:46:59,797 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1193996375] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 11:46:59,797 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 11:46:59,798 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 16 [2022-11-20 11:46:59,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684185339] [2022-11-20 11:46:59,798 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 11:46:59,799 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-11-20 11:46:59,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:46:59,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-11-20 11:46:59,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2022-11-20 11:46:59,800 INFO L87 Difference]: Start difference. First operand 6262 states and 8148 transitions. Second operand has 16 states, 16 states have (on average 12.75) internal successors, (204), 14 states have internal predecessors, (204), 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-20 11:47:18,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:47:18,864 INFO L93 Difference]: Finished difference Result 28932 states and 38820 transitions. [2022-11-20 11:47:18,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2022-11-20 11:47:18,865 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 12.75) internal successors, (204), 14 states have internal predecessors, (204), 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 161 [2022-11-20 11:47:18,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:47:18,976 INFO L225 Difference]: With dead ends: 28932 [2022-11-20 11:47:18,976 INFO L226 Difference]: Without dead ends: 22943 [2022-11-20 11:47:19,000 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 526 GetRequests, 408 SyntacticMatches, 1 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5081 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=1835, Invalid=12207, Unknown=0, NotChecked=0, Total=14042 [2022-11-20 11:47:19,001 INFO L413 NwaCegarLoop]: 1444 mSDtfsCounter, 6131 mSDsluCounter, 10776 mSDsCounter, 0 mSdLazyCounter, 5458 mSolverCounterSat, 4388 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6131 SdHoareTripleChecker+Valid, 12220 SdHoareTripleChecker+Invalid, 9846 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.2s SdHoareTripleChecker+Time, 4388 IncrementalHoareTripleChecker+Valid, 5458 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.2s IncrementalHoareTripleChecker+Time [2022-11-20 11:47:19,001 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6131 Valid, 12220 Invalid, 9846 Unknown, 0 Unchecked, 0.2s Time], IncrementalHoareTripleChecker [4388 Valid, 5458 Invalid, 0 Unknown, 0 Unchecked, 8.2s Time] [2022-11-20 11:47:19,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22943 states. [2022-11-20 11:47:21,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22943 to 8315. [2022-11-20 11:47:21,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8315 states, 6122 states have (on average 1.2963083959490362) internal successors, (7936), 6180 states have internal predecessors, (7936), 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-20 11:47:21,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8315 states to 8315 states and 10782 transitions. [2022-11-20 11:47:21,744 INFO L78 Accepts]: Start accepts. Automaton has 8315 states and 10782 transitions. Word has length 161 [2022-11-20 11:47:21,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:47:21,745 INFO L495 AbstractCegarLoop]: Abstraction has 8315 states and 10782 transitions. [2022-11-20 11:47:21,746 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 12.75) internal successors, (204), 14 states have internal predecessors, (204), 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-20 11:47:21,746 INFO L276 IsEmpty]: Start isEmpty. Operand 8315 states and 10782 transitions. [2022-11-20 11:47:21,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2022-11-20 11:47:21,763 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:47:21,763 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, 1] [2022-11-20 11:47:21,778 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11412ca0-d643-4d9b-a0b3-273b10d69dd1/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-20 11:47:21,971 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11412ca0-d643-4d9b-a0b3-273b10d69dd1/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-11-20 11:47:21,971 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:47:21,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:47:21,972 INFO L85 PathProgramCache]: Analyzing trace with hash -1794708943, now seen corresponding path program 1 times [2022-11-20 11:47:21,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:47:21,972 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917680683] [2022-11-20 11:47:21,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:47:21,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:47:22,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:47:22,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-20 11:47:22,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:47:22,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-20 11:47:22,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:47:22,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-11-20 11:47:22,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:47:22,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-20 11:47:22,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:47:22,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-11-20 11:47:22,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:47:22,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-11-20 11:47:22,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:47:22,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-11-20 11:47:22,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:47:22,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-11-20 11:47:22,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:47:22,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-11-20 11:47:22,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:47:22,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-11-20 11:47:22,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:47:22,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-11-20 11:47:22,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:47:22,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-11-20 11:47:22,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:47:22,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2022-11-20 11:47:22,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:47:22,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-11-20 11:47:22,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:47:22,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-11-20 11:47:22,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:47:22,415 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 25 proven. 2 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2022-11-20 11:47:22,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:47:22,415 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917680683] [2022-11-20 11:47:22,416 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1917680683] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:47:22,416 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [824383707] [2022-11-20 11:47:22,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:47:22,416 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:47:22,417 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11412ca0-d643-4d9b-a0b3-273b10d69dd1/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:47:22,418 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11412ca0-d643-4d9b-a0b3-273b10d69dd1/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:47:22,438 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11412ca0-d643-4d9b-a0b3-273b10d69dd1/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-20 11:47:22,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:47:22,682 INFO L263 TraceCheckSpWp]: Trace formula consists of 737 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-20 11:47:22,688 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:47:22,793 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-20 11:47:22,793 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:47:22,930 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-20 11:47:22,930 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [824383707] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-20 11:47:22,930 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-20 11:47:22,931 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7, 7] total 13 [2022-11-20 11:47:22,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100614309] [2022-11-20 11:47:22,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:47:22,932 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 11:47:22,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:47:22,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 11:47:22,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2022-11-20 11:47:22,934 INFO L87 Difference]: Start difference. First operand 8315 states and 10782 transitions. Second operand has 5 states, 4 states have (on average 22.5) internal successors, (90), 5 states have internal predecessors, (90), 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-20 11:47:24,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:47:24,861 INFO L93 Difference]: Finished difference Result 13602 states and 17687 transitions. [2022-11-20 11:47:24,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 11:47:24,862 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 22.5) internal successors, (90), 5 states have internal predecessors, (90), 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 164 [2022-11-20 11:47:24,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:47:24,889 INFO L225 Difference]: With dead ends: 13602 [2022-11-20 11:47:24,889 INFO L226 Difference]: Without dead ends: 5482 [2022-11-20 11:47:24,906 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 363 GetRequests, 352 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2022-11-20 11:47:24,907 INFO L413 NwaCegarLoop]: 255 mSDtfsCounter, 2 mSDsluCounter, 752 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1007 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-20 11:47:24,907 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1007 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 11:47:24,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5482 states. [2022-11-20 11:47:26,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5482 to 5248. [2022-11-20 11:47:26,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5248 states, 3866 states have (on average 1.2961717537506467) internal successors, (5011), 3900 states have internal predecessors, (5011), 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-20 11:47:26,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5248 states to 5248 states and 6813 transitions. [2022-11-20 11:47:26,494 INFO L78 Accepts]: Start accepts. Automaton has 5248 states and 6813 transitions. Word has length 164 [2022-11-20 11:47:26,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:47:26,495 INFO L495 AbstractCegarLoop]: Abstraction has 5248 states and 6813 transitions. [2022-11-20 11:47:26,495 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 22.5) internal successors, (90), 5 states have internal predecessors, (90), 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-20 11:47:26,495 INFO L276 IsEmpty]: Start isEmpty. Operand 5248 states and 6813 transitions. [2022-11-20 11:47:26,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2022-11-20 11:47:26,511 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:47:26,511 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 11:47:26,526 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11412ca0-d643-4d9b-a0b3-273b10d69dd1/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-20 11:47:26,719 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11412ca0-d643-4d9b-a0b3-273b10d69dd1/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:47:26,719 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:47:26,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:47:26,720 INFO L85 PathProgramCache]: Analyzing trace with hash -796702960, now seen corresponding path program 1 times [2022-11-20 11:47:26,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:47:26,720 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045037493] [2022-11-20 11:47:26,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:47:26,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:47:26,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:47:27,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-20 11:47:27,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:47:27,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-20 11:47:27,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:47:27,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-11-20 11:47:27,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:47:27,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-20 11:47:27,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:47:27,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-11-20 11:47:27,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:47:27,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-11-20 11:47:27,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:47:27,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-11-20 11:47:27,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:47:27,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-11-20 11:47:27,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:47:27,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-11-20 11:47:27,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:47:27,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-11-20 11:47:27,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:47:27,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-11-20 11:47:27,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:47:27,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-11-20 11:47:27,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:47:27,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-11-20 11:47:27,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:47:27,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2022-11-20 11:47:27,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:47:27,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2022-11-20 11:47:27,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:47:27,928 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-20 11:47:27,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:47:27,928 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045037493] [2022-11-20 11:47:27,928 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2045037493] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:47:27,929 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1822158484] [2022-11-20 11:47:27,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:47:27,929 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:47:27,931 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11412ca0-d643-4d9b-a0b3-273b10d69dd1/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:47:27,933 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11412ca0-d643-4d9b-a0b3-273b10d69dd1/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:47:27,946 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11412ca0-d643-4d9b-a0b3-273b10d69dd1/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-20 11:47:28,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:47:28,205 INFO L263 TraceCheckSpWp]: Trace formula consists of 754 conjuncts, 47 conjunts are in the unsatisfiable core [2022-11-20 11:47:28,211 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:47:29,696 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 68 proven. 13 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-20 11:47:29,696 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:47:30,994 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-20 11:47:30,995 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1822158484] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 11:47:30,995 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 11:47:30,995 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 11] total 26 [2022-11-20 11:47:30,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053144501] [2022-11-20 11:47:30,996 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 11:47:30,998 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-11-20 11:47:30,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:47:30,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-11-20 11:47:30,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=539, Unknown=0, NotChecked=0, Total=650 [2022-11-20 11:47:31,000 INFO L87 Difference]: Start difference. First operand 5248 states and 6813 transitions. Second operand has 26 states, 26 states have (on average 9.807692307692308) internal successors, (255), 26 states have internal predecessors, (255), 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-20 11:47:56,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:47:56,396 INFO L93 Difference]: Finished difference Result 15929 states and 21827 transitions. [2022-11-20 11:47:56,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2022-11-20 11:47:56,396 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 9.807692307692308) internal successors, (255), 26 states have internal predecessors, (255), 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 165 [2022-11-20 11:47:56,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:47:56,448 INFO L225 Difference]: With dead ends: 15929 [2022-11-20 11:47:56,448 INFO L226 Difference]: Without dead ends: 10928 [2022-11-20 11:47:56,464 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 473 GetRequests, 351 SyntacticMatches, 2 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5254 ImplicationChecksByTransitivity, 15.5s TimeCoverageRelationStatistics Valid=2021, Invalid=12741, Unknown=0, NotChecked=0, Total=14762 [2022-11-20 11:47:56,464 INFO L413 NwaCegarLoop]: 717 mSDtfsCounter, 4343 mSDsluCounter, 5449 mSDsCounter, 0 mSdLazyCounter, 4300 mSolverCounterSat, 2368 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4343 SdHoareTripleChecker+Valid, 6166 SdHoareTripleChecker+Invalid, 6668 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 2368 IncrementalHoareTripleChecker+Valid, 4300 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.5s IncrementalHoareTripleChecker+Time [2022-11-20 11:47:56,465 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4343 Valid, 6166 Invalid, 6668 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [2368 Valid, 4300 Invalid, 0 Unknown, 0 Unchecked, 6.5s Time] [2022-11-20 11:47:56,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10928 states. [2022-11-20 11:47:58,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10928 to 6131. [2022-11-20 11:47:58,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6131 states, 4529 states have (on average 1.2941046588650917) internal successors, (5861), 4568 states have internal predecessors, (5861), 1037 states have call successors, (1037), 564 states have call predecessors, (1037), 564 states have return successors, (1037), 998 states have call predecessors, (1037), 1037 states have call successors, (1037) [2022-11-20 11:47:58,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6131 states to 6131 states and 7935 transitions. [2022-11-20 11:47:58,444 INFO L78 Accepts]: Start accepts. Automaton has 6131 states and 7935 transitions. Word has length 165 [2022-11-20 11:47:58,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:47:58,445 INFO L495 AbstractCegarLoop]: Abstraction has 6131 states and 7935 transitions. [2022-11-20 11:47:58,446 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 9.807692307692308) internal successors, (255), 26 states have internal predecessors, (255), 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-20 11:47:58,446 INFO L276 IsEmpty]: Start isEmpty. Operand 6131 states and 7935 transitions. [2022-11-20 11:47:58,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2022-11-20 11:47:58,456 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:47:58,456 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] [2022-11-20 11:47:58,471 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11412ca0-d643-4d9b-a0b3-273b10d69dd1/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-20 11:47:58,664 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11412ca0-d643-4d9b-a0b3-273b10d69dd1/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:47:58,664 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:47:58,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:47:58,665 INFO L85 PathProgramCache]: Analyzing trace with hash -949234152, now seen corresponding path program 1 times [2022-11-20 11:47:58,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:47:58,665 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928321120] [2022-11-20 11:47:58,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:47:58,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:47:58,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:47:59,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-20 11:47:59,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:47:59,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-20 11:47:59,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:47:59,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-11-20 11:47:59,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:47:59,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-20 11:47:59,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:47:59,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-11-20 11:47:59,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:47:59,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-11-20 11:47:59,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:47:59,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-11-20 11:47:59,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:47:59,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-11-20 11:47:59,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:47:59,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-11-20 11:47:59,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:47:59,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-11-20 11:47:59,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:47:59,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-11-20 11:47:59,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:47:59,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-11-20 11:47:59,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:47:59,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-11-20 11:47:59,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:47:59,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-11-20 11:47:59,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:47:59,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2022-11-20 11:47:59,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:47:59,695 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 23 proven. 9 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2022-11-20 11:47:59,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:47:59,695 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928321120] [2022-11-20 11:47:59,695 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [928321120] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:47:59,696 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [465219756] [2022-11-20 11:47:59,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:47:59,696 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:47:59,696 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11412ca0-d643-4d9b-a0b3-273b10d69dd1/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:47:59,699 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11412ca0-d643-4d9b-a0b3-273b10d69dd1/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:47:59,733 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11412ca0-d643-4d9b-a0b3-273b10d69dd1/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-20 11:47:59,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:47:59,974 INFO L263 TraceCheckSpWp]: Trace formula consists of 755 conjuncts, 43 conjunts are in the unsatisfiable core [2022-11-20 11:47:59,980 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:48:01,407 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 67 proven. 17 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-20 11:48:01,407 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:48:02,936 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 16 proven. 16 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2022-11-20 11:48:02,937 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [465219756] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 11:48:02,937 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 11:48:02,937 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 11] total 26 [2022-11-20 11:48:02,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745316999] [2022-11-20 11:48:02,937 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 11:48:02,938 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-11-20 11:48:02,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:48:02,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-11-20 11:48:02,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=545, Unknown=0, NotChecked=0, Total=650 [2022-11-20 11:48:02,940 INFO L87 Difference]: Start difference. First operand 6131 states and 7935 transitions. Second operand has 26 states, 26 states have (on average 9.961538461538462) internal successors, (259), 26 states have internal predecessors, (259), 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-20 11:48:29,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:48:29,501 INFO L93 Difference]: Finished difference Result 17443 states and 23898 transitions. [2022-11-20 11:48:29,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2022-11-20 11:48:29,502 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 9.961538461538462) internal successors, (259), 26 states have internal predecessors, (259), 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 166 [2022-11-20 11:48:29,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:48:29,543 INFO L225 Difference]: With dead ends: 17443 [2022-11-20 11:48:29,543 INFO L226 Difference]: Without dead ends: 11650 [2022-11-20 11:48:29,557 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 468 GetRequests, 353 SyntacticMatches, 2 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4352 ImplicationChecksByTransitivity, 12.8s TimeCoverageRelationStatistics Valid=1784, Invalid=11326, Unknown=0, NotChecked=0, Total=13110 [2022-11-20 11:48:29,558 INFO L413 NwaCegarLoop]: 1038 mSDtfsCounter, 2904 mSDsluCounter, 9675 mSDsCounter, 0 mSdLazyCounter, 7365 mSolverCounterSat, 2484 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2904 SdHoareTripleChecker+Valid, 10713 SdHoareTripleChecker+Invalid, 9849 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 2484 IncrementalHoareTripleChecker+Valid, 7365 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.5s IncrementalHoareTripleChecker+Time [2022-11-20 11:48:29,558 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2904 Valid, 10713 Invalid, 9849 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [2484 Valid, 7365 Invalid, 0 Unknown, 0 Unchecked, 9.5s Time] [2022-11-20 11:48:29,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11650 states. [2022-11-20 11:48:31,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11650 to 6308. [2022-11-20 11:48:31,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6308 states, 4688 states have (on average 1.2937286689419796) internal successors, (6065), 4727 states have internal predecessors, (6065), 1046 states have call successors, (1046), 573 states have call predecessors, (1046), 573 states have return successors, (1046), 1007 states have call predecessors, (1046), 1046 states have call successors, (1046) [2022-11-20 11:48:31,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6308 states to 6308 states and 8157 transitions. [2022-11-20 11:48:31,640 INFO L78 Accepts]: Start accepts. Automaton has 6308 states and 8157 transitions. Word has length 166 [2022-11-20 11:48:31,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:48:31,641 INFO L495 AbstractCegarLoop]: Abstraction has 6308 states and 8157 transitions. [2022-11-20 11:48:31,641 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 9.961538461538462) internal successors, (259), 26 states have internal predecessors, (259), 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-20 11:48:31,641 INFO L276 IsEmpty]: Start isEmpty. Operand 6308 states and 8157 transitions. [2022-11-20 11:48:31,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2022-11-20 11:48:31,649 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:48:31,650 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 11:48:31,658 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11412ca0-d643-4d9b-a0b3-273b10d69dd1/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-20 11:48:31,857 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11412ca0-d643-4d9b-a0b3-273b10d69dd1/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:48:31,858 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:48:31,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:48:31,858 INFO L85 PathProgramCache]: Analyzing trace with hash -1701596757, now seen corresponding path program 1 times [2022-11-20 11:48:31,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:48:31,858 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487171822] [2022-11-20 11:48:31,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:48:31,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:48:31,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:48:32,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-20 11:48:32,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:48:32,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-20 11:48:32,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:48:32,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-11-20 11:48:32,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:48:32,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-20 11:48:32,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:48:32,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-11-20 11:48:32,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:48:32,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-11-20 11:48:32,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:48:32,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-11-20 11:48:32,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:48:32,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-11-20 11:48:32,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:48:32,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-11-20 11:48:32,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:48:32,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-11-20 11:48:32,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:48:32,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-11-20 11:48:32,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:48:32,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-11-20 11:48:32,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:48:32,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-11-20 11:48:32,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:48:32,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-11-20 11:48:32,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:48:32,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2022-11-20 11:48:32,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:48:32,204 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 24 proven. 2 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2022-11-20 11:48:32,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:48:32,205 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487171822] [2022-11-20 11:48:32,205 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1487171822] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:48:32,205 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [108777166] [2022-11-20 11:48:32,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:48:32,205 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:48:32,206 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11412ca0-d643-4d9b-a0b3-273b10d69dd1/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:48:32,207 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11412ca0-d643-4d9b-a0b3-273b10d69dd1/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:48:32,231 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11412ca0-d643-4d9b-a0b3-273b10d69dd1/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-20 11:48:32,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:48:32,468 INFO L263 TraceCheckSpWp]: Trace formula consists of 756 conjuncts, 11 conjunts are in the unsatisfiable core [2022-11-20 11:48:32,473 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:48:32,729 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 47 proven. 4 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-11-20 11:48:32,729 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:48:32,988 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 24 proven. 2 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2022-11-20 11:48:32,988 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [108777166] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 11:48:32,989 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 11:48:32,989 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 9 [2022-11-20 11:48:32,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894183651] [2022-11-20 11:48:32,989 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 11:48:32,990 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-20 11:48:32,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:48:32,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-20 11:48:32,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-11-20 11:48:32,992 INFO L87 Difference]: Start difference. First operand 6308 states and 8157 transitions. Second operand has 9 states, 9 states have (on average 16.0) internal successors, (144), 8 states have internal predecessors, (144), 3 states have call successors, (28), 4 states have call predecessors, (28), 7 states have return successors, (29), 4 states have call predecessors, (29), 3 states have call successors, (29) [2022-11-20 11:48:36,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:48:36,007 INFO L93 Difference]: Finished difference Result 14880 states and 19933 transitions. [2022-11-20 11:48:36,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-20 11:48:36,008 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 16.0) internal successors, (144), 8 states have internal predecessors, (144), 3 states have call successors, (28), 4 states have call predecessors, (28), 7 states have return successors, (29), 4 states have call predecessors, (29), 3 states have call successors, (29) Word has length 167 [2022-11-20 11:48:36,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:48:36,036 INFO L225 Difference]: With dead ends: 14880 [2022-11-20 11:48:36,037 INFO L226 Difference]: Without dead ends: 8746 [2022-11-20 11:48:36,046 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 373 GetRequests, 359 SyntacticMatches, 4 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2022-11-20 11:48:36,047 INFO L413 NwaCegarLoop]: 370 mSDtfsCounter, 219 mSDsluCounter, 2346 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 244 SdHoareTripleChecker+Valid, 2716 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 11:48:36,047 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [244 Valid, 2716 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 11:48:36,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8746 states. [2022-11-20 11:48:37,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8746 to 6308. [2022-11-20 11:48:37,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6308 states, 4688 states have (on average 1.293088737201365) internal successors, (6062), 4727 states have internal predecessors, (6062), 1046 states have call successors, (1046), 573 states have call predecessors, (1046), 573 states have return successors, (1046), 1007 states have call predecessors, (1046), 1046 states have call successors, (1046) [2022-11-20 11:48:37,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6308 states to 6308 states and 8154 transitions. [2022-11-20 11:48:37,987 INFO L78 Accepts]: Start accepts. Automaton has 6308 states and 8154 transitions. Word has length 167 [2022-11-20 11:48:37,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:48:37,987 INFO L495 AbstractCegarLoop]: Abstraction has 6308 states and 8154 transitions. [2022-11-20 11:48:37,988 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 16.0) internal successors, (144), 8 states have internal predecessors, (144), 3 states have call successors, (28), 4 states have call predecessors, (28), 7 states have return successors, (29), 4 states have call predecessors, (29), 3 states have call successors, (29) [2022-11-20 11:48:37,988 INFO L276 IsEmpty]: Start isEmpty. Operand 6308 states and 8154 transitions. [2022-11-20 11:48:37,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2022-11-20 11:48:37,996 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:48:37,996 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 11:48:38,007 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11412ca0-d643-4d9b-a0b3-273b10d69dd1/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-20 11:48:38,207 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11412ca0-d643-4d9b-a0b3-273b10d69dd1/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:48:38,207 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:48:38,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:48:38,207 INFO L85 PathProgramCache]: Analyzing trace with hash -955308677, now seen corresponding path program 1 times [2022-11-20 11:48:38,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:48:38,208 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606199166] [2022-11-20 11:48:38,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:48:38,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:48:38,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:48:38,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-20 11:48:38,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:48:38,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-20 11:48:38,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:48:38,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-11-20 11:48:38,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:48:38,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-20 11:48:38,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:48:38,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-11-20 11:48:38,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:48:38,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-11-20 11:48:38,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:48:38,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-11-20 11:48:38,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:48:38,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-11-20 11:48:38,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:48:38,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-11-20 11:48:38,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:48:38,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-11-20 11:48:38,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:48:38,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-11-20 11:48:38,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:48:38,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-11-20 11:48:38,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:48:38,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-11-20 11:48:38,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:48:38,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-11-20 11:48:38,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:48:38,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2022-11-20 11:48:38,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:48:38,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2022-11-20 11:48:38,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:48:38,599 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 24 proven. 6 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2022-11-20 11:48:38,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:48:38,600 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606199166] [2022-11-20 11:48:38,600 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [606199166] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:48:38,600 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2097636955] [2022-11-20 11:48:38,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:48:38,601 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:48:38,601 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11412ca0-d643-4d9b-a0b3-273b10d69dd1/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:48:38,602 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11412ca0-d643-4d9b-a0b3-273b10d69dd1/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:48:38,612 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11412ca0-d643-4d9b-a0b3-273b10d69dd1/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-20 11:48:38,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:48:38,853 INFO L263 TraceCheckSpWp]: Trace formula consists of 774 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-20 11:48:38,856 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:48:39,023 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 62 proven. 4 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-11-20 11:48:39,024 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:48:39,231 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 24 proven. 6 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2022-11-20 11:48:39,232 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2097636955] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 11:48:39,232 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 11:48:39,232 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 9 [2022-11-20 11:48:39,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304370187] [2022-11-20 11:48:39,233 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 11:48:39,233 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-20 11:48:39,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:48:39,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-20 11:48:39,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-11-20 11:48:39,235 INFO L87 Difference]: Start difference. First operand 6308 states and 8154 transitions. Second operand has 9 states, 9 states have (on average 16.666666666666668) internal successors, (150), 8 states have internal predecessors, (150), 3 states have call successors, (30), 4 states have call predecessors, (30), 7 states have return successors, (31), 4 states have call predecessors, (31), 3 states have call successors, (31) [2022-11-20 11:48:42,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:48:42,931 INFO L93 Difference]: Finished difference Result 14882 states and 19932 transitions. [2022-11-20 11:48:42,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-20 11:48:42,932 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 16.666666666666668) internal successors, (150), 8 states have internal predecessors, (150), 3 states have call successors, (30), 4 states have call predecessors, (30), 7 states have return successors, (31), 4 states have call predecessors, (31), 3 states have call successors, (31) Word has length 175 [2022-11-20 11:48:42,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:48:42,959 INFO L225 Difference]: With dead ends: 14882 [2022-11-20 11:48:42,959 INFO L226 Difference]: Without dead ends: 8748 [2022-11-20 11:48:42,969 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 391 GetRequests, 379 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2022-11-20 11:48:42,970 INFO L413 NwaCegarLoop]: 371 mSDtfsCounter, 213 mSDsluCounter, 1986 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 2357 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 11:48:42,970 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 2357 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 11:48:42,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8748 states. [2022-11-20 11:48:44,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8748 to 6308. [2022-11-20 11:48:44,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6308 states, 4688 states have (on average 1.2924488054607508) internal successors, (6059), 4727 states have internal predecessors, (6059), 1046 states have call successors, (1046), 573 states have call predecessors, (1046), 573 states have return successors, (1046), 1007 states have call predecessors, (1046), 1046 states have call successors, (1046) [2022-11-20 11:48:44,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6308 states to 6308 states and 8151 transitions. [2022-11-20 11:48:44,938 INFO L78 Accepts]: Start accepts. Automaton has 6308 states and 8151 transitions. Word has length 175 [2022-11-20 11:48:44,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:48:44,939 INFO L495 AbstractCegarLoop]: Abstraction has 6308 states and 8151 transitions. [2022-11-20 11:48:44,939 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 16.666666666666668) internal successors, (150), 8 states have internal predecessors, (150), 3 states have call successors, (30), 4 states have call predecessors, (30), 7 states have return successors, (31), 4 states have call predecessors, (31), 3 states have call successors, (31) [2022-11-20 11:48:44,940 INFO L276 IsEmpty]: Start isEmpty. Operand 6308 states and 8151 transitions. [2022-11-20 11:48:44,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2022-11-20 11:48:44,947 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:48:44,948 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 11:48:44,957 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11412ca0-d643-4d9b-a0b3-273b10d69dd1/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-20 11:48:45,155 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11412ca0-d643-4d9b-a0b3-273b10d69dd1/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2022-11-20 11:48:45,156 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:48:45,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:48:45,156 INFO L85 PathProgramCache]: Analyzing trace with hash -1961151993, now seen corresponding path program 1 times [2022-11-20 11:48:45,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:48:45,157 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317332538] [2022-11-20 11:48:45,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:48:45,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:48:45,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 11:48:45,280 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 11:48:45,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 11:48:45,540 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-20 11:48:45,540 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-20 11:48:45,542 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-20 11:48:45,549 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-11-20 11:48:45,559 INFO L444 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] [2022-11-20 11:48:45,567 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-20 11:48:45,879 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 11:48:45 BoogieIcfgContainer [2022-11-20 11:48:45,879 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-20 11:48:45,879 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-20 11:48:45,880 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-20 11:48:45,880 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-20 11:48:45,881 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 11:46:11" (3/4) ... [2022-11-20 11:48:45,883 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-20 11:48:46,144 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11412ca0-d643-4d9b-a0b3-273b10d69dd1/bin/uautomizer-ug76WZFUDN/witness.graphml [2022-11-20 11:48:46,145 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-20 11:48:46,146 INFO L158 Benchmark]: Toolchain (without parser) took 155892.66ms. Allocated memory was 140.5MB in the beginning and 2.4GB in the end (delta: 2.3GB). Free memory was 110.3MB in the beginning and 2.3GB in the end (delta: -2.2GB). Peak memory consumption was 84.5MB. Max. memory is 16.1GB. [2022-11-20 11:48:46,146 INFO L158 Benchmark]: CDTParser took 0.43ms. Allocated memory is still 109.1MB. Free memory is still 63.7MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-20 11:48:46,149 INFO L158 Benchmark]: CACSL2BoogieTranslator took 513.24ms. Allocated memory is still 140.5MB. Free memory was 109.9MB in the beginning and 92.7MB in the end (delta: 17.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-11-20 11:48:46,152 INFO L158 Benchmark]: Boogie Procedure Inliner took 78.44ms. Allocated memory is still 140.5MB. Free memory was 92.7MB in the beginning and 89.3MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-20 11:48:46,157 INFO L158 Benchmark]: Boogie Preprocessor took 57.38ms. Allocated memory is still 140.5MB. Free memory was 89.3MB in the beginning and 86.8MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-20 11:48:46,158 INFO L158 Benchmark]: RCFGBuilder took 1056.42ms. Allocated memory is still 140.5MB. Free memory was 86.8MB in the beginning and 55.0MB in the end (delta: 31.8MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2022-11-20 11:48:46,159 INFO L158 Benchmark]: TraceAbstraction took 153913.66ms. Allocated memory was 140.5MB in the beginning and 2.4GB in the end (delta: 2.3GB). Free memory was 54.2MB in the beginning and 2.3GB in the end (delta: -2.3GB). Peak memory consumption was 1.4GB. Max. memory is 16.1GB. [2022-11-20 11:48:46,160 INFO L158 Benchmark]: Witness Printer took 265.28ms. Allocated memory is still 2.4GB. Free memory was 2.3GB in the beginning and 2.3GB in the end (delta: 31.5MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2022-11-20 11:48:46,163 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.43ms. Allocated memory is still 109.1MB. Free memory is still 63.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 513.24ms. Allocated memory is still 140.5MB. Free memory was 109.9MB in the beginning and 92.7MB in the end (delta: 17.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 78.44ms. Allocated memory is still 140.5MB. Free memory was 92.7MB in the beginning and 89.3MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 57.38ms. Allocated memory is still 140.5MB. Free memory was 89.3MB in the beginning and 86.8MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1056.42ms. Allocated memory is still 140.5MB. Free memory was 86.8MB in the beginning and 55.0MB in the end (delta: 31.8MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * TraceAbstraction took 153913.66ms. Allocated memory was 140.5MB in the beginning and 2.4GB in the end (delta: 2.3GB). Free memory was 54.2MB in the beginning and 2.3GB in the end (delta: -2.3GB). Peak memory consumption was 1.4GB. Max. memory is 16.1GB. * Witness Printer took 265.28ms. Allocated memory is still 2.4GB. Free memory was 2.3GB in the beginning and 2.3GB in the end (delta: 31.5MB). Peak memory consumption was 31.5MB. 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: 611]: 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] [L534] int c1 ; [L535] int i2 ; [L538] c1 = 0 [L539] side1Failed = __VERIFIER_nondet_bool() [L540] side2Failed = __VERIFIER_nondet_bool() [L541] side1_written = __VERIFIER_nondet_char() [L542] side2_written = __VERIFIER_nondet_char() [L543] side1Failed_History_0 = __VERIFIER_nondet_bool() [L544] side1Failed_History_1 = __VERIFIER_nondet_bool() [L545] side1Failed_History_2 = __VERIFIER_nondet_bool() [L546] side2Failed_History_0 = __VERIFIER_nondet_bool() [L547] side2Failed_History_1 = __VERIFIER_nondet_bool() [L548] side2Failed_History_2 = __VERIFIER_nondet_bool() [L549] active_side_History_0 = __VERIFIER_nondet_char() [L550] active_side_History_1 = __VERIFIER_nondet_char() [L551] active_side_History_2 = __VERIFIER_nondet_char() [L552] manual_selection_History_0 = __VERIFIER_nondet_char() [L553] manual_selection_History_1 = __VERIFIER_nondet_char() [L554] manual_selection_History_2 = __VERIFIER_nondet_char() [L555] 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] [L555] RET, EXPR init() [L555] i2 = init() [L556] 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] [L556] 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] [L557] cs1_old = nomsg [L558] cs1_new = nomsg [L559] cs2_old = nomsg [L560] cs2_new = nomsg [L561] s1s2_old = nomsg [L562] s1s2_new = nomsg [L563] s1s1_old = nomsg [L564] s1s1_new = nomsg [L565] s2s1_old = nomsg [L566] s2s1_new = nomsg [L567] s2s2_old = nomsg [L568] s2s2_new = nomsg [L569] s1p_old = nomsg [L570] s1p_new = nomsg [L571] s2p_old = nomsg [L572] s2p_new = nomsg [L573] 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] [L574] COND TRUE i2 < 10 [L576] 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] [L576] RET Console_task_each_pals_period() [L577] 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)=-255, 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=-255] [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] [L577] RET Side1_activestandby_task_each_pals_period() [L578] 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] [L578] RET Side2_activestandby_task_each_pals_period() [L579] 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) [L407] 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] [L409] 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] [L409] RET write_active_side_history(active_side) [L579] RET Pendulum_prism_task_each_pals_period() [L580] cs1_old = cs1_new [L581] cs1_new = nomsg [L582] cs2_old = cs2_new [L583] cs2_new = nomsg [L584] s1s2_old = s1s2_new [L585] s1s2_new = nomsg [L586] s1s1_old = s1s1_new [L587] s1s1_new = nomsg [L588] s2s1_old = s2s1_new [L589] s2s1_new = nomsg [L590] s2s2_old = s2s2_new [L591] s2s2_new = nomsg [L592] s1p_old = s1p_new [L593] s1p_new = nomsg [L594] s2p_old = s2p_new [L595] s2p_new = nomsg [L596] CALL, EXPR check() [L415] int tmp ; [L416] msg_t tmp___0 ; [L417] _Bool tmp___1 ; [L418] _Bool tmp___2 ; [L419] _Bool tmp___3 ; [L420] _Bool tmp___4 ; [L421] int8_t tmp___5 ; [L422] _Bool tmp___6 ; [L423] _Bool tmp___7 ; [L424] _Bool tmp___8 ; [L425] int8_t tmp___9 ; [L426] _Bool tmp___10 ; [L427] _Bool tmp___11 ; [L428] _Bool tmp___12 ; [L429] msg_t tmp___13 ; [L430] _Bool tmp___14 ; [L431] _Bool tmp___15 ; [L432] _Bool tmp___16 ; [L433] _Bool tmp___17 ; [L434] int8_t tmp___18 ; [L435] int8_t tmp___19 ; [L436] 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] [L439] 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] [L442] COND TRUE ! side2Failed [L443] 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] [L447] 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] [L447] 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] [L448] 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] [L448] 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] [L448] tmp___0 = read_manual_selection_history((unsigned char)1) [L449] 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] [L450] 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] [L450] 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] [L450] tmp___1 = read_side1_failed_history((unsigned char)1) [L451] 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] [L452] 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] [L452] 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] [L452] tmp___2 = read_side1_failed_history((unsigned char)0) [L453] 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] [L478] 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] [L478] 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] [L478] tmp___7 = read_side1_failed_history((unsigned char)1) [L479] 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] [L494] 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] [L494] 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] [L494] tmp___11 = read_side1_failed_history((unsigned char)1) [L495] 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] [L496] 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] [L496] 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] [L496] tmp___12 = read_side2_failed_history((unsigned char)1) [L497] 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] [L510] 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] [L510] 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] [L510] tmp___20 = read_active_side_history((unsigned char)2) [L511] 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] [L529] 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] [L596] RET, EXPR check() [L596] c1 = check() [L597] 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] [L609] 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] [L597] 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] [L598] 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] [L574] COND TRUE i2 < 10 [L576] 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=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=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=-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=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=0, manual_selection_History_0=-1, 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=-1] [L576] RET Console_task_each_pals_period() [L577] 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)=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=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=0, side1Failed_History_0=0, 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] [L276] RET write_side1_failed_history(side1Failed) [L277] COND FALSE !(\read(side1Failed)) [L284] side1 = s1s1_old [L285] s1s1_old = nomsg [L286] side2 = s2s1_old [L287] s2s1_old = nomsg [L288] manual_selection = cs1_old [L289] cs1_old = nomsg 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=1, manual_selection_History_0=-1, 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=-1, s2s2=0, s2s2_new=-1, s2s2_old=0, side1=-1, side1_written=-1, side1Failed=0, side1Failed_History_0=0, 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] [L290] 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=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=1, manual_selection=1, manual_selection_History_0=-1, 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=-1, s2s2=0, s2s2_new=-1, s2s2_old=0, side1=-1, side1_written=-1, side1Failed=0, side1Failed_History_0=0, 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] [L293] 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=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=1, manual_selection=1, manual_selection_History_0=-1, 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=-1, s2s2=0, s2s2_new=-1, s2s2_old=0, side1=-1, side1_written=-1, side1Failed=0, side1Failed_History_0=0, 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] [L294] COND TRUE (int )side2 != (int )nomsg [L295] 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=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=1, manual_selection=1, manual_selection_History_0=-1, 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=-1, s2s2=0, s2s2_new=-1, s2s2_old=0, side1=-1, side1_written=-1, side1Failed=0, side1Failed_History_0=0, 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] [L314] s1s1_new = next_state != nomsg && s1s1_new == nomsg ? next_state : s1s1_new [L315] s1s2_new = next_state != nomsg && s1s2_new == nomsg ? next_state : s1s2_new [L316] s1p_new = next_state != nomsg && s1p_new == nomsg ? next_state : s1p_new [L317] side1_written = next_state 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=1, manual_selection_History_0=-1, manual_selection_History_1=1, manual_selection_History_2=0, next_state=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=-1, s1s1=0, s1s1_new=0, s1s1_old=-1, s1s2=0, s1s2_new=0, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=0, side1=-1, side1_written=0, side1Failed=0, side1Failed_History_0=0, 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] [L577] RET Side1_activestandby_task_each_pals_period() [L578] 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)=257, 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=1, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=-1, s1s1=0, s1s1_new=0, s1s1_old=-1, s1s2=0, s1s2_new=0, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0, val=257] [L333] RET write_side2_failed_history(side2Failed) [L334] COND TRUE \read(side2Failed) [L335] s2s1_new = nomsg != nomsg && s2s1_new == nomsg ? nomsg : s2s1_new [L336] s2s2_new = nomsg != nomsg && s2s2_new == nomsg ? nomsg : s2s2_new [L337] s2p_new = nomsg != nomsg && s2p_new == nomsg ? nomsg : s2p_new [L338] side2_written = nomsg 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=0, manual_selection_History_0=-1, manual_selection_History_1=1, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=-1, s1s1=0, s1s1_new=0, s1s1_old=-1, s1s2=0, s1s2_new=0, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=0, side1=-1, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2=-1, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0] [L578] RET Side2_activestandby_task_each_pals_period() [L579] 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=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=1, manual_selection_History_0=-1, manual_selection_History_1=1, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=-1, s1s1=0, s1s1_new=0, s1s1_old=-1, s1s2=0, s1s2_new=0, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, 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=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=1, manual_selection_History_0=-1, manual_selection_History_1=1, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=-1, s1s1=0, s1s1_new=0, s1s1_old=-1, s1s2=0, s1s2_new=0, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, 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=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=1, index=0, manual_selection_History_0=-1, manual_selection_History_1=1, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=-1, s1s1=0, s1s1_new=0, s1s1_old=-1, s1s2=0, s1s2_new=0, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, 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=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=1, manual_selection_History_0=-1, manual_selection_History_1=1, manual_selection_History_2=0, nomsg=-1, read_active_side_history((unsigned char)0)=0, s1p=0, s1p_new=0, s1p_old=-1, s1s1=0, s1s1_new=0, s1s1_old=-1, s1s2=0, s1s2_new=0, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, 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=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=1, manual_selection_History_0=-1, manual_selection_History_1=1, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=-1, s1s1=0, s1s1_new=0, s1s1_old=-1, s1s2=0, s1s2_new=0, 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=0, side1=-1, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, 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=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=1, manual_selection_History_0=-1, manual_selection_History_1=1, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=-1, s1s1=0, s1s1_new=0, s1s1_old=-1, s1s2=0, s1s2_new=0, 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=0, side1=-1, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, 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=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=1, manual_selection_History_0=-1, manual_selection_History_1=1, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=-1, s1s1=0, s1s1_new=0, s1s1_old=-1, s1s2=0, s1s2_new=0, 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=0, side1=-1, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0, tmp=0] [L400] COND FALSE !((int )side1 == 0) [L407] active_side = (int8_t )0 VAL [active_side=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=1, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=-1, s1s1=0, s1s1_new=0, s1s1_old=-1, s1s2=0, s1s2_new=0, 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=0, side1=-1, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0, tmp=0] [L409] 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=0, 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=1, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=-1, s1s1=0, s1s1_new=0, s1s1_old=-1, s1s2=0, s1s2_new=0, 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=0, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0, val=0] [L409] RET write_active_side_history(active_side) [L579] RET Pendulum_prism_task_each_pals_period() [L580] cs1_old = cs1_new [L581] cs1_new = nomsg [L582] cs2_old = cs2_new [L583] cs2_new = nomsg [L584] s1s2_old = s1s2_new [L585] s1s2_new = nomsg [L586] s1s1_old = s1s1_new [L587] s1s1_new = nomsg [L588] s2s1_old = s2s1_new [L589] s2s1_new = nomsg [L590] s2s2_old = s2s2_new [L591] s2s2_new = nomsg [L592] s1p_old = s1p_new [L593] s1p_new = nomsg [L594] s2p_old = s2p_new [L595] s2p_new = nomsg [L596] CALL, EXPR check() [L415] int tmp ; [L416] msg_t tmp___0 ; [L417] _Bool tmp___1 ; [L418] _Bool tmp___2 ; [L419] _Bool tmp___3 ; [L420] _Bool tmp___4 ; [L421] int8_t tmp___5 ; [L422] _Bool tmp___6 ; [L423] _Bool tmp___7 ; [L424] _Bool tmp___8 ; [L425] int8_t tmp___9 ; [L426] _Bool tmp___10 ; [L427] _Bool tmp___11 ; [L428] _Bool tmp___12 ; [L429] msg_t tmp___13 ; [L430] _Bool tmp___14 ; [L431] _Bool tmp___15 ; [L432] _Bool tmp___16 ; [L433] _Bool tmp___17 ; [L434] int8_t tmp___18 ; [L435] int8_t tmp___19 ; [L436] int8_t tmp___20 ; VAL [active_side_History_0=0, active_side_History_1=0, 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=1, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, 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=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0] [L439] COND TRUE ! side1Failed [L440] tmp = 1 VAL [active_side_History_0=0, active_side_History_1=0, 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=1, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, 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=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1] [L447] CALL assume_abort_if_not((_Bool )tmp) VAL [\old(cond)=1, active_side_History_0=0, active_side_History_1=0, 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=1, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, 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=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, 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=0, 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=1, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, 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=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0] [L447] RET assume_abort_if_not((_Bool )tmp) VAL [active_side_History_0=0, active_side_History_1=0, 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=1, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, 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=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1] [L448] CALL, EXPR read_manual_selection_history((unsigned char)1) VAL [\old(index)=1, active_side_History_0=0, active_side_History_1=0, 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=1, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, 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=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, 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=0, 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=1, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, 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=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, 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=0, active_side_History_1=0, 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=1, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, 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=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0] [L448] RET, EXPR read_manual_selection_history((unsigned char)1) VAL [active_side_History_0=0, active_side_History_1=0, 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=1, manual_selection_History_2=0, nomsg=-1, read_manual_selection_history((unsigned char)1)=1, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, 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=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1] [L448] tmp___0 = read_manual_selection_history((unsigned char)1) [L449] COND FALSE !(! tmp___0) VAL [active_side_History_0=0, active_side_History_1=0, 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=1, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, 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=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=1] [L478] CALL, EXPR read_side1_failed_history((unsigned char)1) VAL [\old(index)=1, active_side_History_0=0, active_side_History_1=0, 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=1, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, 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=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, 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=0, 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=1, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, 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=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, 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=0, active_side_History_1=0, 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=1, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, 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=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0] [L478] RET, EXPR read_side1_failed_history((unsigned char)1) VAL [active_side_History_0=0, active_side_History_1=0, 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=1, manual_selection_History_2=0, nomsg=-1, read_side1_failed_history((unsigned char)1)=-255, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, 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=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=1] [L478] tmp___7 = read_side1_failed_history((unsigned char)1) [L479] COND TRUE \read(tmp___7) VAL [active_side_History_0=0, active_side_History_1=0, 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=1, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, 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=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=1, tmp___7=1] [L480] CALL, EXPR read_side2_failed_history((unsigned char)1) VAL [\old(index)=1, active_side_History_0=0, active_side_History_1=0, 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=1, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, 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=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, 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=0, 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=1, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, 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=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, 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=0, 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=1, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, 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=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0] [L480] RET, EXPR read_side2_failed_history((unsigned char)1) VAL [active_side_History_0=0, active_side_History_1=0, 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=1, manual_selection_History_2=0, nomsg=-1, read_side2_failed_history((unsigned char)1)=0, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, 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=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=1, tmp___7=1] [L480] tmp___8 = read_side2_failed_history((unsigned char)1) [L481] COND TRUE ! tmp___8 VAL [active_side_History_0=0, active_side_History_1=0, 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=1, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, 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=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=1, tmp___7=1, tmp___8=0] [L482] CALL, EXPR read_active_side_history((unsigned char)0) VAL [\old(index)=0, active_side_History_0=0, active_side_History_1=0, 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=1, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, 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=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, 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=0, 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=1, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, 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=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0] [L482] RET, EXPR read_active_side_history((unsigned char)0) VAL [active_side_History_0=0, active_side_History_1=0, 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=1, manual_selection_History_2=0, nomsg=-1, read_active_side_history((unsigned char)0)=0, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, 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=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=1, tmp___7=1, tmp___8=0] [L482] tmp___5 = read_active_side_history((unsigned char)0) [L483] COND TRUE ! ((int )tmp___5 == 2) [L484] return (0); VAL [\result=0, active_side_History_0=0, active_side_History_1=0, 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=1, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, 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=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=1, tmp___5=0, tmp___7=1, tmp___8=0] [L596] RET, EXPR check() [L596] c1 = check() [L597] CALL assert(c1) VAL [\old(arg)=0, active_side_History_0=0, active_side_History_1=0, 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=1, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, 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=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0] [L609] COND TRUE ! arg VAL [\old(arg)=0, active_side_History_0=0, active_side_History_1=0, active_side_History_2=-2, arg=0, 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=1, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, 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=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0] [L611] reach_error() VAL [\old(arg)=0, active_side_History_0=0, active_side_History_1=0, active_side_History_2=-2, arg=0, 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=1, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, 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=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 8 procedures, 179 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 153.4s, OverallIterations: 35, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.2s, AutomataDifference: 105.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 24305 SdHoareTripleChecker+Valid, 31.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 24037 mSDsluCounter, 67680 SdHoareTripleChecker+Invalid, 26.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 54197 mSDsCounter, 11410 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 21297 IncrementalHoareTripleChecker+Invalid, 32707 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 11410 mSolverCounterUnsat, 13483 mSDtfsCounter, 21297 mSolverCounterSat, 0.7s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3514 GetRequests, 2950 SyntacticMatches, 12 SemanticMatches, 552 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15280 ImplicationChecksByTransitivity, 33.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8315occurred in iteration=29, InterpolantAutomatonStates: 521, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 23.0s AutomataMinimizationTime, 34 MinimizatonAttempts, 44681 StatesRemovedByMinimization, 26 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.6s SsaConstructionTime, 2.6s SatisfiabilityAnalysisTime, 18.3s InterpolantComputationTime, 4651 NumberOfCodeBlocks, 4651 NumberOfCodeBlocksAsserted, 42 NumberOfCheckSat, 5571 ConstructedInterpolants, 0 QuantifiedInterpolants, 18075 SizeOfPredicates, 30 NumberOfNonLiveVariables, 5210 ConjunctsInSsa, 149 ConjunctsInUnsatCore, 48 InterpolantComputations, 28 PerfectInterpolantSequences, 2020/2228 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-20 11:48:46,207 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11412ca0-d643-4d9b-a0b3-273b10d69dd1/bin/uautomizer-ug76WZFUDN/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