./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_2.ufo.UNBOUNDED.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version b5237d83 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45a6a48e-927b-43c1-a242-2685973c4754/bin/uautomizer-vX5HgA9Q3a/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45a6a48e-927b-43c1-a242-2685973c4754/bin/uautomizer-vX5HgA9Q3a/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45a6a48e-927b-43c1-a242-2685973c4754/bin/uautomizer-vX5HgA9Q3a/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45a6a48e-927b-43c1-a242-2685973c4754/bin/uautomizer-vX5HgA9Q3a/config/AutomizerReach.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_2.ufo.UNBOUNDED.pals.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45a6a48e-927b-43c1-a242-2685973c4754/bin/uautomizer-vX5HgA9Q3a/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45a6a48e-927b-43c1-a242-2685973c4754/bin/uautomizer-vX5HgA9Q3a --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 01a21536345230b7194ff5017879c469eb8be909ba72352bb81feb2f101a934f --- 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-b5237d8 [2022-11-21 16:15:07,623 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-21 16:15:07,625 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-21 16:15:07,656 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-21 16:15:07,656 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-21 16:15:07,657 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-21 16:15:07,658 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-21 16:15:07,660 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-21 16:15:07,661 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-21 16:15:07,662 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-21 16:15:07,663 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-21 16:15:07,664 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-21 16:15:07,665 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-21 16:15:07,666 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-21 16:15:07,667 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-21 16:15:07,668 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-21 16:15:07,668 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-21 16:15:07,669 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-21 16:15:07,671 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-21 16:15:07,673 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-21 16:15:07,674 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-21 16:15:07,675 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-21 16:15:07,677 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-21 16:15:07,677 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-21 16:15:07,681 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-21 16:15:07,682 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-21 16:15:07,682 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-21 16:15:07,683 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-21 16:15:07,684 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-21 16:15:07,685 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-21 16:15:07,685 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-21 16:15:07,686 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-21 16:15:07,687 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-21 16:15:07,688 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-21 16:15:07,689 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-21 16:15:07,689 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-21 16:15:07,690 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-21 16:15:07,690 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-21 16:15:07,691 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-21 16:15:07,692 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-21 16:15:07,693 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-21 16:15:07,693 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45a6a48e-927b-43c1-a242-2685973c4754/bin/uautomizer-vX5HgA9Q3a/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-21 16:15:07,718 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-21 16:15:07,719 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-21 16:15:07,719 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-21 16:15:07,719 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-21 16:15:07,720 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-21 16:15:07,720 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-21 16:15:07,721 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-21 16:15:07,721 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-21 16:15:07,721 INFO L138 SettingsManager]: * Use SBE=true [2022-11-21 16:15:07,722 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-21 16:15:07,722 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-21 16:15:07,722 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-21 16:15:07,722 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-21 16:15:07,723 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-21 16:15:07,723 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-21 16:15:07,723 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-21 16:15:07,724 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-21 16:15:07,724 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-21 16:15:07,724 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-21 16:15:07,724 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-21 16:15:07,725 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-21 16:15:07,725 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-21 16:15:07,725 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-21 16:15:07,725 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-21 16:15:07,726 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-21 16:15:07,726 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-21 16:15:07,726 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-21 16:15:07,726 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-21 16:15:07,727 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-21 16:15:07,727 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-21 16:15:07,727 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-21 16:15:07,727 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-21 16:15:07,728 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-21 16:15:07,728 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_45a6a48e-927b-43c1-a242-2685973c4754/bin/uautomizer-vX5HgA9Q3a/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_45a6a48e-927b-43c1-a242-2685973c4754/bin/uautomizer-vX5HgA9Q3a 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 -> 01a21536345230b7194ff5017879c469eb8be909ba72352bb81feb2f101a934f [2022-11-21 16:15:07,976 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-21 16:15:07,996 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-21 16:15:07,999 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-21 16:15:08,000 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-21 16:15:08,000 INFO L275 PluginConnector]: CDTParser initialized [2022-11-21 16:15:08,001 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45a6a48e-927b-43c1-a242-2685973c4754/bin/uautomizer-vX5HgA9Q3a/../../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_2.ufo.UNBOUNDED.pals.c [2022-11-21 16:15:11,014 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-21 16:15:11,322 INFO L351 CDTParser]: Found 1 translation units. [2022-11-21 16:15:11,323 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45a6a48e-927b-43c1-a242-2685973c4754/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_2.ufo.UNBOUNDED.pals.c [2022-11-21 16:15:11,332 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45a6a48e-927b-43c1-a242-2685973c4754/bin/uautomizer-vX5HgA9Q3a/data/f65c2de6c/d1c69713aa494c1aa06e3517f23d4eb1/FLAG24469c30d [2022-11-21 16:15:11,346 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45a6a48e-927b-43c1-a242-2685973c4754/bin/uautomizer-vX5HgA9Q3a/data/f65c2de6c/d1c69713aa494c1aa06e3517f23d4eb1 [2022-11-21 16:15:11,349 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-21 16:15:11,350 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-21 16:15:11,352 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-21 16:15:11,352 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-21 16:15:11,356 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-21 16:15:11,356 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 04:15:11" (1/1) ... [2022-11-21 16:15:11,358 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@66bf4578 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:15:11, skipping insertion in model container [2022-11-21 16:15:11,358 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 04:15:11" (1/1) ... [2022-11-21 16:15:11,365 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-21 16:15:11,399 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-21 16:15:11,745 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_45a6a48e-927b-43c1-a242-2685973c4754/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_2.ufo.UNBOUNDED.pals.c[14684,14697] [2022-11-21 16:15:11,749 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-21 16:15:11,760 INFO L203 MainTranslator]: Completed pre-run [2022-11-21 16:15:11,819 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_45a6a48e-927b-43c1-a242-2685973c4754/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_2.ufo.UNBOUNDED.pals.c[14684,14697] [2022-11-21 16:15:11,820 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-21 16:15:11,835 INFO L208 MainTranslator]: Completed translation [2022-11-21 16:15:11,836 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:15:11 WrapperNode [2022-11-21 16:15:11,836 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-21 16:15:11,837 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-21 16:15:11,837 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-21 16:15:11,837 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-21 16:15:11,845 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:15:11" (1/1) ... [2022-11-21 16:15:11,855 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:15:11" (1/1) ... [2022-11-21 16:15:11,895 INFO L138 Inliner]: procedures = 32, calls = 48, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 479 [2022-11-21 16:15:11,895 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-21 16:15:11,896 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-21 16:15:11,896 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-21 16:15:11,896 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-21 16:15:11,906 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:15:11" (1/1) ... [2022-11-21 16:15:11,906 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:15:11" (1/1) ... [2022-11-21 16:15:11,912 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:15:11" (1/1) ... [2022-11-21 16:15:11,912 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:15:11" (1/1) ... [2022-11-21 16:15:11,923 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:15:11" (1/1) ... [2022-11-21 16:15:11,929 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:15:11" (1/1) ... [2022-11-21 16:15:11,932 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:15:11" (1/1) ... [2022-11-21 16:15:11,935 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:15:11" (1/1) ... [2022-11-21 16:15:11,939 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-21 16:15:11,940 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-21 16:15:11,941 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-21 16:15:11,941 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-21 16:15:11,942 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:15:11" (1/1) ... [2022-11-21 16:15:11,948 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-21 16:15:11,960 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45a6a48e-927b-43c1-a242-2685973c4754/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:15:11,973 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45a6a48e-927b-43c1-a242-2685973c4754/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-21 16:15:11,987 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45a6a48e-927b-43c1-a242-2685973c4754/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-21 16:15:12,028 INFO L130 BoogieDeclarations]: Found specification of procedure read_manual_selection_history [2022-11-21 16:15:12,028 INFO L138 BoogieDeclarations]: Found implementation of procedure read_manual_selection_history [2022-11-21 16:15:12,028 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-21 16:15:12,028 INFO L130 BoogieDeclarations]: Found specification of procedure read_side2_failed_history [2022-11-21 16:15:12,029 INFO L138 BoogieDeclarations]: Found implementation of procedure read_side2_failed_history [2022-11-21 16:15:12,029 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2022-11-21 16:15:12,031 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2022-11-21 16:15:12,031 INFO L130 BoogieDeclarations]: Found specification of procedure flip_the_side [2022-11-21 16:15:12,032 INFO L138 BoogieDeclarations]: Found implementation of procedure flip_the_side [2022-11-21 16:15:12,032 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-11-21 16:15:12,032 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-11-21 16:15:12,032 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-21 16:15:12,032 INFO L130 BoogieDeclarations]: Found specification of procedure read_side1_failed_history [2022-11-21 16:15:12,032 INFO L138 BoogieDeclarations]: Found implementation of procedure read_side1_failed_history [2022-11-21 16:15:12,033 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-21 16:15:12,033 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-21 16:15:12,033 INFO L130 BoogieDeclarations]: Found specification of procedure read_active_side_history [2022-11-21 16:15:12,033 INFO L138 BoogieDeclarations]: Found implementation of procedure read_active_side_history [2022-11-21 16:15:12,207 INFO L235 CfgBuilder]: Building ICFG [2022-11-21 16:15:12,210 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-21 16:15:12,869 INFO L276 CfgBuilder]: Performing block encoding [2022-11-21 16:15:12,877 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-21 16:15:12,878 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-21 16:15:12,880 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 04:15:12 BoogieIcfgContainer [2022-11-21 16:15:12,880 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-21 16:15:12,883 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-21 16:15:12,883 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-21 16:15:12,887 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-21 16:15:12,887 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 04:15:11" (1/3) ... [2022-11-21 16:15:12,888 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32e38e30 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 04:15:12, skipping insertion in model container [2022-11-21 16:15:12,888 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:15:11" (2/3) ... [2022-11-21 16:15:12,888 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32e38e30 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 04:15:12, skipping insertion in model container [2022-11-21 16:15:12,888 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 04:15:12" (3/3) ... [2022-11-21 16:15:12,890 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_STARTPALS_ActiveStandby.4_2.ufo.UNBOUNDED.pals.c [2022-11-21 16:15:12,909 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-21 16:15:12,910 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-21 16:15:12,967 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-21 16:15:12,974 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;@504cd24f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-21 16:15:12,974 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-21 16:15:12,978 INFO L276 IsEmpty]: Start isEmpty. Operand has 180 states, 140 states have (on average 1.5571428571428572) internal successors, (218), 142 states have internal predecessors, (218), 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-21 16:15:12,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-21 16:15:12,987 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:15:12,988 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-21 16:15:12,988 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:15:12,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:15:12,993 INFO L85 PathProgramCache]: Analyzing trace with hash 1699901086, now seen corresponding path program 1 times [2022-11-21 16:15:13,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:15:13,001 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854103137] [2022-11-21 16:15:13,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:15:13,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:15:13,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:13,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-21 16:15:13,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:13,240 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-21 16:15:13,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:15:13,241 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854103137] [2022-11-21 16:15:13,242 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [854103137] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:15:13,242 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:15:13,242 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-21 16:15:13,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119158202] [2022-11-21 16:15:13,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:15:13,250 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-21 16:15:13,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:15:13,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-21 16:15:13,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-21 16:15:13,325 INFO L87 Difference]: Start difference. First operand has 180 states, 140 states have (on average 1.5571428571428572) internal successors, (218), 142 states have internal predecessors, (218), 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-21 16:15:13,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:15:13,445 INFO L93 Difference]: Finished difference Result 340 states and 557 transitions. [2022-11-21 16:15:13,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-21 16:15:13,451 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-21 16:15:13,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:15:13,463 INFO L225 Difference]: With dead ends: 340 [2022-11-21 16:15:13,463 INFO L226 Difference]: Without dead ends: 176 [2022-11-21 16:15:13,467 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-21 16:15:13,471 INFO L413 NwaCegarLoop]: 273 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, 273 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-21 16:15:13,472 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 273 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-21 16:15:13,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2022-11-21 16:15:13,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 176. [2022-11-21 16:15:13,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 137 states have (on average 1.5401459854014599) internal successors, (211), 138 states have internal predecessors, (211), 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-21 16:15:13,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 273 transitions. [2022-11-21 16:15:13,529 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 273 transitions. Word has length 28 [2022-11-21 16:15:13,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:15:13,530 INFO L495 AbstractCegarLoop]: Abstraction has 176 states and 273 transitions. [2022-11-21 16:15:13,530 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-21 16:15:13,530 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 273 transitions. [2022-11-21 16:15:13,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-21 16:15:13,532 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:15:13,533 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-21 16:15:13,533 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-21 16:15:13,533 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:15:13,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:15:13,534 INFO L85 PathProgramCache]: Analyzing trace with hash 1918755804, now seen corresponding path program 1 times [2022-11-21 16:15:13,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:15:13,535 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641978817] [2022-11-21 16:15:13,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:15:13,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:15:13,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:13,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-21 16:15:13,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:13,848 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-21 16:15:13,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:15:13,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641978817] [2022-11-21 16:15:13,849 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1641978817] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:15:13,849 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:15:13,849 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-21 16:15:13,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909167633] [2022-11-21 16:15:13,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:15:13,851 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-21 16:15:13,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:15:13,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-21 16:15:13,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-21 16:15:13,852 INFO L87 Difference]: Start difference. First operand 176 states and 273 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-21 16:15:13,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:15:13,981 INFO L93 Difference]: Finished difference Result 338 states and 520 transitions. [2022-11-21 16:15:13,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-21 16:15:13,982 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-21 16:15:13,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:15:13,984 INFO L225 Difference]: With dead ends: 338 [2022-11-21 16:15:13,984 INFO L226 Difference]: Without dead ends: 176 [2022-11-21 16:15:13,985 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-21 16:15:13,987 INFO L413 NwaCegarLoop]: 269 mSDtfsCounter, 137 mSDsluCounter, 891 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 1160 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 16:15:13,987 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 1160 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 16:15:13,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2022-11-21 16:15:14,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 176. [2022-11-21 16:15:14,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 137 states have (on average 1.4525547445255473) internal successors, (199), 138 states have internal predecessors, (199), 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-21 16:15:14,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 261 transitions. [2022-11-21 16:15:14,009 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 261 transitions. Word has length 28 [2022-11-21 16:15:14,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:15:14,009 INFO L495 AbstractCegarLoop]: Abstraction has 176 states and 261 transitions. [2022-11-21 16:15:14,009 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-21 16:15:14,010 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 261 transitions. [2022-11-21 16:15:14,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-11-21 16:15:14,011 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:15:14,011 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-21 16:15:14,011 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-21 16:15:14,012 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:15:14,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:15:14,012 INFO L85 PathProgramCache]: Analyzing trace with hash 1355709569, now seen corresponding path program 1 times [2022-11-21 16:15:14,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:15:14,013 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520223853] [2022-11-21 16:15:14,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:15:14,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:15:14,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:14,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-21 16:15:14,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:14,347 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-21 16:15:14,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:15:14,347 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520223853] [2022-11-21 16:15:14,347 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [520223853] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:15:14,347 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:15:14,348 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-21 16:15:14,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354099315] [2022-11-21 16:15:14,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:15:14,348 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-21 16:15:14,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:15:14,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-21 16:15:14,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-21 16:15:14,349 INFO L87 Difference]: Start difference. First operand 176 states and 261 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-21 16:15:14,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:15:14,407 INFO L93 Difference]: Finished difference Result 339 states and 512 transitions. [2022-11-21 16:15:14,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-21 16:15:14,407 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-21 16:15:14,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:15:14,409 INFO L225 Difference]: With dead ends: 339 [2022-11-21 16:15:14,410 INFO L226 Difference]: Without dead ends: 180 [2022-11-21 16:15:14,411 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-21 16:15:14,412 INFO L413 NwaCegarLoop]: 255 mSDtfsCounter, 5 mSDsluCounter, 500 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 755 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-21 16:15:14,413 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 755 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-21 16:15:14,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2022-11-21 16:15:14,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 180. [2022-11-21 16:15:14,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 140 states have (on average 1.4428571428571428) internal successors, (202), 141 states have internal predecessors, (202), 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-21 16:15:14,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 264 transitions. [2022-11-21 16:15:14,434 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 264 transitions. Word has length 39 [2022-11-21 16:15:14,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:15:14,434 INFO L495 AbstractCegarLoop]: Abstraction has 180 states and 264 transitions. [2022-11-21 16:15:14,434 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-21 16:15:14,435 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 264 transitions. [2022-11-21 16:15:14,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-11-21 16:15:14,436 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:15:14,437 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-21 16:15:14,437 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-21 16:15:14,437 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:15:14,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:15:14,438 INFO L85 PathProgramCache]: Analyzing trace with hash -2086587661, now seen corresponding path program 1 times [2022-11-21 16:15:14,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:15:14,438 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900745334] [2022-11-21 16:15:14,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:15:14,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:15:14,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:14,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-21 16:15:14,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:14,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-21 16:15:14,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:14,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-11-21 16:15:14,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:14,530 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-21 16:15:14,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:15:14,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900745334] [2022-11-21 16:15:14,530 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [900745334] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:15:14,531 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:15:14,531 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-21 16:15:14,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266458995] [2022-11-21 16:15:14,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:15:14,532 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 16:15:14,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:15:14,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 16:15:14,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 16:15:14,533 INFO L87 Difference]: Start difference. First operand 180 states and 264 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-21 16:15:14,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:15:14,615 INFO L93 Difference]: Finished difference Result 494 states and 735 transitions. [2022-11-21 16:15:14,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 16:15:14,631 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-21 16:15:14,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:15:14,634 INFO L225 Difference]: With dead ends: 494 [2022-11-21 16:15:14,634 INFO L226 Difference]: Without dead ends: 331 [2022-11-21 16:15:14,635 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-21 16:15:14,636 INFO L413 NwaCegarLoop]: 300 mSDtfsCounter, 212 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 552 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-21 16:15:14,637 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [212 Valid, 552 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-21 16:15:14,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2022-11-21 16:15:14,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 326. [2022-11-21 16:15:14,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 326 states, 249 states have (on average 1.461847389558233) internal successors, (364), 251 states have internal predecessors, (364), 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-21 16:15:14,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 484 transitions. [2022-11-21 16:15:14,740 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 484 transitions. Word has length 55 [2022-11-21 16:15:14,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:15:14,740 INFO L495 AbstractCegarLoop]: Abstraction has 326 states and 484 transitions. [2022-11-21 16:15:14,741 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-21 16:15:14,741 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 484 transitions. [2022-11-21 16:15:14,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-11-21 16:15:14,745 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:15:14,745 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-21 16:15:14,746 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-21 16:15:14,746 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:15:14,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:15:14,746 INFO L85 PathProgramCache]: Analyzing trace with hash 651939805, now seen corresponding path program 1 times [2022-11-21 16:15:14,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:15:14,747 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302682484] [2022-11-21 16:15:14,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:15:14,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:15:14,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:14,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-21 16:15:14,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:14,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-21 16:15:14,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:14,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-21 16:15:14,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:14,827 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-21 16:15:14,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:15:14,827 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302682484] [2022-11-21 16:15:14,828 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [302682484] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:15:14,828 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:15:14,829 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-21 16:15:14,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026558854] [2022-11-21 16:15:14,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:15:14,837 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 16:15:14,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:15:14,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 16:15:14,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 16:15:14,838 INFO L87 Difference]: Start difference. First operand 326 states and 484 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-21 16:15:14,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:15:14,926 INFO L93 Difference]: Finished difference Result 917 states and 1373 transitions. [2022-11-21 16:15:14,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 16:15:14,928 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-21 16:15:14,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:15:14,939 INFO L225 Difference]: With dead ends: 917 [2022-11-21 16:15:14,939 INFO L226 Difference]: Without dead ends: 608 [2022-11-21 16:15:14,940 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-21 16:15:14,945 INFO L413 NwaCegarLoop]: 319 mSDtfsCounter, 214 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 573 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-21 16:15:14,946 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 573 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-21 16:15:14,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2022-11-21 16:15:15,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 602. [2022-11-21 16:15:15,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 602 states, 453 states have (on average 1.4724061810154525) internal successors, (667), 457 states have internal predecessors, (667), 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-21 16:15:15,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 901 transitions. [2022-11-21 16:15:15,028 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 901 transitions. Word has length 56 [2022-11-21 16:15:15,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:15:15,029 INFO L495 AbstractCegarLoop]: Abstraction has 602 states and 901 transitions. [2022-11-21 16:15:15,029 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-21 16:15:15,029 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 901 transitions. [2022-11-21 16:15:15,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-11-21 16:15:15,037 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:15:15,037 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-21 16:15:15,037 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-21 16:15:15,038 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:15:15,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:15:15,038 INFO L85 PathProgramCache]: Analyzing trace with hash -627923873, now seen corresponding path program 1 times [2022-11-21 16:15:15,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:15:15,039 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569168804] [2022-11-21 16:15:15,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:15:15,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:15:15,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:15,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-21 16:15:15,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:15,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-21 16:15:15,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:15,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-21 16:15:15,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:15,206 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-21 16:15:15,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:15:15,207 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569168804] [2022-11-21 16:15:15,207 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1569168804] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:15:15,207 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:15:15,207 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-21 16:15:15,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711345779] [2022-11-21 16:15:15,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:15:15,209 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-21 16:15:15,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:15:15,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-21 16:15:15,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-21 16:15:15,211 INFO L87 Difference]: Start difference. First operand 602 states and 901 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-21 16:15:15,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:15:15,679 INFO L93 Difference]: Finished difference Result 1639 states and 2507 transitions. [2022-11-21 16:15:15,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-21 16:15:15,680 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-21 16:15:15,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:15:15,689 INFO L225 Difference]: With dead ends: 1639 [2022-11-21 16:15:15,689 INFO L226 Difference]: Without dead ends: 1054 [2022-11-21 16:15:15,691 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-21 16:15:15,697 INFO L413 NwaCegarLoop]: 246 mSDtfsCounter, 633 mSDsluCounter, 445 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 633 SdHoareTripleChecker+Valid, 691 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-21 16:15:15,698 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [633 Valid, 691 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-21 16:15:15,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1054 states. [2022-11-21 16:15:15,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1054 to 690. [2022-11-21 16:15:15,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 690 states, 528 states have (on average 1.456439393939394) internal successors, (769), 531 states have internal predecessors, (769), 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-21 16:15:15,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 690 states to 690 states and 1017 transitions. [2022-11-21 16:15:15,806 INFO L78 Accepts]: Start accepts. Automaton has 690 states and 1017 transitions. Word has length 56 [2022-11-21 16:15:15,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:15:15,806 INFO L495 AbstractCegarLoop]: Abstraction has 690 states and 1017 transitions. [2022-11-21 16:15:15,807 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-21 16:15:15,807 INFO L276 IsEmpty]: Start isEmpty. Operand 690 states and 1017 transitions. [2022-11-21 16:15:15,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-11-21 16:15:15,808 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:15:15,808 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-21 16:15:15,809 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-21 16:15:15,809 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:15:15,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:15:15,810 INFO L85 PathProgramCache]: Analyzing trace with hash 707313810, now seen corresponding path program 1 times [2022-11-21 16:15:15,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:15:15,810 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932068763] [2022-11-21 16:15:15,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:15:15,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:15:15,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:15,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-21 16:15:15,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:15,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-21 16:15:15,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:15,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-21 16:15:15,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:16,001 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-21 16:15:16,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:15:16,002 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932068763] [2022-11-21 16:15:16,002 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [932068763] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:15:16,002 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:15:16,002 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-21 16:15:16,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229017120] [2022-11-21 16:15:16,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:15:16,003 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-21 16:15:16,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:15:16,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-21 16:15:16,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-21 16:15:16,004 INFO L87 Difference]: Start difference. First operand 690 states and 1017 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-21 16:15:16,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:15:16,379 INFO L93 Difference]: Finished difference Result 1643 states and 2507 transitions. [2022-11-21 16:15:16,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-21 16:15:16,380 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-21 16:15:16,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:15:16,385 INFO L225 Difference]: With dead ends: 1643 [2022-11-21 16:15:16,386 INFO L226 Difference]: Without dead ends: 1058 [2022-11-21 16:15:16,388 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-21 16:15:16,389 INFO L413 NwaCegarLoop]: 246 mSDtfsCounter, 630 mSDsluCounter, 447 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 630 SdHoareTripleChecker+Valid, 693 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-21 16:15:16,389 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [630 Valid, 693 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-21 16:15:16,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1058 states. [2022-11-21 16:15:16,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1058 to 698. [2022-11-21 16:15:16,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 698 states, 536 states have (on average 1.4496268656716418) internal successors, (777), 539 states have internal predecessors, (777), 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-21 16:15:16,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 698 states to 698 states and 1025 transitions. [2022-11-21 16:15:16,475 INFO L78 Accepts]: Start accepts. Automaton has 698 states and 1025 transitions. Word has length 57 [2022-11-21 16:15:16,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:15:16,475 INFO L495 AbstractCegarLoop]: Abstraction has 698 states and 1025 transitions. [2022-11-21 16:15:16,476 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-21 16:15:16,476 INFO L276 IsEmpty]: Start isEmpty. Operand 698 states and 1025 transitions. [2022-11-21 16:15:16,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-11-21 16:15:16,477 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:15:16,477 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:15:16,478 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-21 16:15:16,478 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:15:16,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:15:16,478 INFO L85 PathProgramCache]: Analyzing trace with hash -1187610108, now seen corresponding path program 1 times [2022-11-21 16:15:16,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:15:16,479 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443918212] [2022-11-21 16:15:16,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:15:16,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:15:16,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:16,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-21 16:15:16,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:16,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-21 16:15:16,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:16,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-21 16:15:16,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:16,614 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-21 16:15:16,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:15:16,615 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443918212] [2022-11-21 16:15:16,615 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1443918212] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:15:16,616 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:15:16,616 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-21 16:15:16,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537875183] [2022-11-21 16:15:16,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:15:16,617 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-21 16:15:16,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:15:16,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-21 16:15:16,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-21 16:15:16,618 INFO L87 Difference]: Start difference. First operand 698 states and 1025 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-21 16:15:16,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:15:16,987 INFO L93 Difference]: Finished difference Result 1643 states and 2499 transitions. [2022-11-21 16:15:16,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-21 16:15:16,988 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 59 [2022-11-21 16:15:16,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:15:16,993 INFO L225 Difference]: With dead ends: 1643 [2022-11-21 16:15:16,994 INFO L226 Difference]: Without dead ends: 1058 [2022-11-21 16:15:16,996 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-21 16:15:16,996 INFO L413 NwaCegarLoop]: 272 mSDtfsCounter, 186 mSDsluCounter, 388 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 660 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-21 16:15:16,997 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 660 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-21 16:15:16,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1058 states. [2022-11-21 16:15:17,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1058 to 698. [2022-11-21 16:15:17,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 698 states, 536 states have (on average 1.4421641791044777) internal successors, (773), 539 states have internal predecessors, (773), 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-21 16:15:17,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 698 states to 698 states and 1021 transitions. [2022-11-21 16:15:17,085 INFO L78 Accepts]: Start accepts. Automaton has 698 states and 1021 transitions. Word has length 59 [2022-11-21 16:15:17,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:15:17,085 INFO L495 AbstractCegarLoop]: Abstraction has 698 states and 1021 transitions. [2022-11-21 16:15:17,086 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-21 16:15:17,086 INFO L276 IsEmpty]: Start isEmpty. Operand 698 states and 1021 transitions. [2022-11-21 16:15:17,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-11-21 16:15:17,087 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:15:17,087 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:15:17,087 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-21 16:15:17,088 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:15:17,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:15:17,088 INFO L85 PathProgramCache]: Analyzing trace with hash -1980797779, now seen corresponding path program 1 times [2022-11-21 16:15:17,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:15:17,088 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028899726] [2022-11-21 16:15:17,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:15:17,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:15:17,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:17,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-21 16:15:17,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:17,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-21 16:15:17,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:17,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-11-21 16:15:17,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:17,273 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-21 16:15:17,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:15:17,273 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028899726] [2022-11-21 16:15:17,274 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1028899726] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:15:17,274 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:15:17,274 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-21 16:15:17,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897025195] [2022-11-21 16:15:17,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:15:17,275 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-21 16:15:17,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:15:17,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-21 16:15:17,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-21 16:15:17,276 INFO L87 Difference]: Start difference. First operand 698 states and 1021 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 3 states have internal predecessors, (49), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-21 16:15:17,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:15:17,380 INFO L93 Difference]: Finished difference Result 1303 states and 1932 transitions. [2022-11-21 16:15:17,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-21 16:15:17,381 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 3 states have internal predecessors, (49), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 60 [2022-11-21 16:15:17,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:15:17,384 INFO L225 Difference]: With dead ends: 1303 [2022-11-21 16:15:17,384 INFO L226 Difference]: Without dead ends: 718 [2022-11-21 16:15:17,386 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-21 16:15:17,387 INFO L413 NwaCegarLoop]: 257 mSDtfsCounter, 6 mSDsluCounter, 510 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 767 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-21 16:15:17,387 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 767 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-21 16:15:17,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 718 states. [2022-11-21 16:15:17,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 718 to 718. [2022-11-21 16:15:17,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 718 states, 552 states have (on average 1.4293478260869565) internal successors, (789), 555 states have internal predecessors, (789), 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-21 16:15:17,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 718 states to 718 states and 1037 transitions. [2022-11-21 16:15:17,465 INFO L78 Accepts]: Start accepts. Automaton has 718 states and 1037 transitions. Word has length 60 [2022-11-21 16:15:17,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:15:17,465 INFO L495 AbstractCegarLoop]: Abstraction has 718 states and 1037 transitions. [2022-11-21 16:15:17,466 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 3 states have internal predecessors, (49), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-21 16:15:17,466 INFO L276 IsEmpty]: Start isEmpty. Operand 718 states and 1037 transitions. [2022-11-21 16:15:17,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-11-21 16:15:17,467 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:15:17,467 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:15:17,468 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-21 16:15:17,468 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:15:17,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:15:17,468 INFO L85 PathProgramCache]: Analyzing trace with hash 1474712019, now seen corresponding path program 1 times [2022-11-21 16:15:17,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:15:17,469 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337149875] [2022-11-21 16:15:17,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:15:17,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:15:17,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:17,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-21 16:15:17,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:17,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-21 16:15:17,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:17,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-11-21 16:15:17,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:17,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-21 16:15:17,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:17,642 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-21 16:15:17,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:15:17,642 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337149875] [2022-11-21 16:15:17,643 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1337149875] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:15:17,643 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:15:17,643 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-21 16:15:17,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127694969] [2022-11-21 16:15:17,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:15:17,644 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-21 16:15:17,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:15:17,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-21 16:15:17,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-21 16:15:17,645 INFO L87 Difference]: Start difference. First operand 718 states and 1037 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 3 states have internal predecessors, (55), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-21 16:15:17,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:15:17,774 INFO L93 Difference]: Finished difference Result 1343 states and 1976 transitions. [2022-11-21 16:15:17,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-21 16:15:17,775 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 3 states have internal predecessors, (55), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 68 [2022-11-21 16:15:17,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:15:17,779 INFO L225 Difference]: With dead ends: 1343 [2022-11-21 16:15:17,779 INFO L226 Difference]: Without dead ends: 738 [2022-11-21 16:15:17,781 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-21 16:15:17,781 INFO L413 NwaCegarLoop]: 254 mSDtfsCounter, 6 mSDsluCounter, 499 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 753 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-21 16:15:17,782 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 753 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-21 16:15:17,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 738 states. [2022-11-21 16:15:17,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 738 to 738. [2022-11-21 16:15:17,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 738 states, 568 states have (on average 1.4172535211267605) internal successors, (805), 571 states have internal predecessors, (805), 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-21 16:15:17,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 738 states to 738 states and 1053 transitions. [2022-11-21 16:15:17,862 INFO L78 Accepts]: Start accepts. Automaton has 738 states and 1053 transitions. Word has length 68 [2022-11-21 16:15:17,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:15:17,862 INFO L495 AbstractCegarLoop]: Abstraction has 738 states and 1053 transitions. [2022-11-21 16:15:17,863 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 3 states have internal predecessors, (55), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-21 16:15:17,863 INFO L276 IsEmpty]: Start isEmpty. Operand 738 states and 1053 transitions. [2022-11-21 16:15:17,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-11-21 16:15:17,864 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:15:17,865 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:15:17,865 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-21 16:15:17,865 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:15:17,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:15:17,866 INFO L85 PathProgramCache]: Analyzing trace with hash -799213667, now seen corresponding path program 1 times [2022-11-21 16:15:17,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:15:17,866 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749840409] [2022-11-21 16:15:17,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:15:17,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:15:17,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:18,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-21 16:15:18,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:18,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-21 16:15:18,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:18,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-11-21 16:15:18,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:18,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-21 16:15:18,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:18,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-11-21 16:15:18,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:18,026 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-21 16:15:18,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:15:18,027 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749840409] [2022-11-21 16:15:18,027 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1749840409] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:15:18,027 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:15:18,027 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-21 16:15:18,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120759224] [2022-11-21 16:15:18,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:15:18,028 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-21 16:15:18,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:15:18,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-21 16:15:18,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-21 16:15:18,029 INFO L87 Difference]: Start difference. First operand 738 states and 1053 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 3 states have internal predecessors, (61), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-11-21 16:15:18,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:15:18,134 INFO L93 Difference]: Finished difference Result 1379 states and 1992 transitions. [2022-11-21 16:15:18,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-21 16:15:18,135 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 3 states have internal predecessors, (61), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 76 [2022-11-21 16:15:18,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:15:18,139 INFO L225 Difference]: With dead ends: 1379 [2022-11-21 16:15:18,139 INFO L226 Difference]: Without dead ends: 754 [2022-11-21 16:15:18,141 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-21 16:15:18,142 INFO L413 NwaCegarLoop]: 259 mSDtfsCounter, 5 mSDsluCounter, 503 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 762 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-21 16:15:18,142 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 762 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-21 16:15:18,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 754 states. [2022-11-21 16:15:18,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 754 to 754. [2022-11-21 16:15:18,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 754 states, 580 states have (on average 1.4086206896551725) internal successors, (817), 583 states have internal predecessors, (817), 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-21 16:15:18,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 754 states to 754 states and 1065 transitions. [2022-11-21 16:15:18,259 INFO L78 Accepts]: Start accepts. Automaton has 754 states and 1065 transitions. Word has length 76 [2022-11-21 16:15:18,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:15:18,260 INFO L495 AbstractCegarLoop]: Abstraction has 754 states and 1065 transitions. [2022-11-21 16:15:18,260 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 3 states have internal predecessors, (61), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-11-21 16:15:18,260 INFO L276 IsEmpty]: Start isEmpty. Operand 754 states and 1065 transitions. [2022-11-21 16:15:18,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-11-21 16:15:18,262 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:15:18,262 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:15:18,263 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-21 16:15:18,263 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:15:18,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:15:18,264 INFO L85 PathProgramCache]: Analyzing trace with hash 1597245636, now seen corresponding path program 1 times [2022-11-21 16:15:18,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:15:18,264 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593620694] [2022-11-21 16:15:18,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:15:18,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:15:18,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:18,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-21 16:15:18,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:18,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-21 16:15:18,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:18,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-11-21 16:15:18,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:18,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-21 16:15:18,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:18,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-11-21 16:15:18,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:18,461 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-21 16:15:18,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:15:18,461 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593620694] [2022-11-21 16:15:18,461 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [593620694] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:15:18,462 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:15:18,462 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-21 16:15:18,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631195620] [2022-11-21 16:15:18,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:15:18,463 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-21 16:15:18,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:15:18,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-21 16:15:18,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-21 16:15:18,464 INFO L87 Difference]: Start difference. First operand 754 states and 1065 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 3 states have internal predecessors, (61), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-11-21 16:15:18,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:15:18,571 INFO L93 Difference]: Finished difference Result 1415 states and 2032 transitions. [2022-11-21 16:15:18,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-21 16:15:18,572 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 3 states have internal predecessors, (61), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 76 [2022-11-21 16:15:18,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:15:18,576 INFO L225 Difference]: With dead ends: 1415 [2022-11-21 16:15:18,576 INFO L226 Difference]: Without dead ends: 774 [2022-11-21 16:15:18,578 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-21 16:15:18,578 INFO L413 NwaCegarLoop]: 254 mSDtfsCounter, 6 mSDsluCounter, 499 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 753 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-21 16:15:18,579 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 753 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-21 16:15:18,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 774 states. [2022-11-21 16:15:18,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 774 to 774. [2022-11-21 16:15:18,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 774 states, 596 states have (on average 1.3976510067114094) internal successors, (833), 599 states have internal predecessors, (833), 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-21 16:15:18,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 774 states to 774 states and 1081 transitions. [2022-11-21 16:15:18,658 INFO L78 Accepts]: Start accepts. Automaton has 774 states and 1081 transitions. Word has length 76 [2022-11-21 16:15:18,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:15:18,658 INFO L495 AbstractCegarLoop]: Abstraction has 774 states and 1081 transitions. [2022-11-21 16:15:18,659 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 3 states have internal predecessors, (61), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-11-21 16:15:18,659 INFO L276 IsEmpty]: Start isEmpty. Operand 774 states and 1081 transitions. [2022-11-21 16:15:18,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-11-21 16:15:18,660 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:15:18,661 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:15:18,661 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-21 16:15:18,661 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:15:18,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:15:18,662 INFO L85 PathProgramCache]: Analyzing trace with hash 837268772, now seen corresponding path program 1 times [2022-11-21 16:15:18,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:15:18,662 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612229626] [2022-11-21 16:15:18,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:15:18,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:15:18,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:18,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-21 16:15:18,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:18,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-21 16:15:18,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:18,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-11-21 16:15:18,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:18,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-21 16:15:18,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:18,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-11-21 16:15:18,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:18,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-11-21 16:15:18,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:18,905 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-21 16:15:18,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:15:18,905 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612229626] [2022-11-21 16:15:18,905 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1612229626] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:15:18,906 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:15:18,906 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-21 16:15:18,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549520728] [2022-11-21 16:15:18,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:15:18,907 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-21 16:15:18,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:15:18,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-21 16:15:18,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-21 16:15:18,908 INFO L87 Difference]: Start difference. First operand 774 states and 1081 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 2 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-11-21 16:15:19,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:15:19,014 INFO L93 Difference]: Finished difference Result 1459 states and 2060 transitions. [2022-11-21 16:15:19,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-21 16:15:19,015 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 2 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 84 [2022-11-21 16:15:19,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:15:19,020 INFO L225 Difference]: With dead ends: 1459 [2022-11-21 16:15:19,020 INFO L226 Difference]: Without dead ends: 798 [2022-11-21 16:15:19,022 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-21 16:15:19,023 INFO L413 NwaCegarLoop]: 258 mSDtfsCounter, 7 mSDsluCounter, 506 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 764 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-21 16:15:19,023 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 764 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-21 16:15:19,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 798 states. [2022-11-21 16:15:19,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 798 to 798. [2022-11-21 16:15:19,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 798 states, 616 states have (on average 1.3847402597402598) internal successors, (853), 619 states have internal predecessors, (853), 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-21 16:15:19,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 798 states to 798 states and 1101 transitions. [2022-11-21 16:15:19,103 INFO L78 Accepts]: Start accepts. Automaton has 798 states and 1101 transitions. Word has length 84 [2022-11-21 16:15:19,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:15:19,104 INFO L495 AbstractCegarLoop]: Abstraction has 798 states and 1101 transitions. [2022-11-21 16:15:19,104 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 2 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-11-21 16:15:19,104 INFO L276 IsEmpty]: Start isEmpty. Operand 798 states and 1101 transitions. [2022-11-21 16:15:19,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-11-21 16:15:19,107 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:15:19,107 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:15:19,108 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-21 16:15:19,108 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:15:19,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:15:19,108 INFO L85 PathProgramCache]: Analyzing trace with hash 1610117125, now seen corresponding path program 1 times [2022-11-21 16:15:19,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:15:19,109 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700784563] [2022-11-21 16:15:19,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:15:19,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:15:19,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:19,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-21 16:15:19,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:19,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-21 16:15:19,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:19,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-11-21 16:15:19,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:19,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-21 16:15:19,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:19,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-11-21 16:15:19,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:19,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-11-21 16:15:19,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:19,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-11-21 16:15:19,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:19,469 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-21 16:15:19,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:15:19,470 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700784563] [2022-11-21 16:15:19,470 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1700784563] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:15:19,470 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:15:19,470 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-21 16:15:19,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105152597] [2022-11-21 16:15:19,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:15:19,471 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-21 16:15:19,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:15:19,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-21 16:15:19,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-21 16:15:19,472 INFO L87 Difference]: Start difference. First operand 798 states and 1101 transitions. Second operand has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 6 states have internal predecessors, (66), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2022-11-21 16:15:19,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:15:19,905 INFO L93 Difference]: Finished difference Result 2313 states and 3243 transitions. [2022-11-21 16:15:19,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-21 16:15:19,906 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 6 states have internal predecessors, (66), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) Word has length 87 [2022-11-21 16:15:19,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:15:19,913 INFO L225 Difference]: With dead ends: 2313 [2022-11-21 16:15:19,913 INFO L226 Difference]: Without dead ends: 1628 [2022-11-21 16:15:19,916 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-21 16:15:19,916 INFO L413 NwaCegarLoop]: 349 mSDtfsCounter, 324 mSDsluCounter, 1570 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 342 SdHoareTripleChecker+Valid, 1919 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-21 16:15:19,917 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [342 Valid, 1919 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-21 16:15:19,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1628 states. [2022-11-21 16:15:20,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1628 to 1082. [2022-11-21 16:15:20,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1082 states, 827 states have (on average 1.3724304715840387) internal successors, (1135), 832 states have internal predecessors, (1135), 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-21 16:15:20,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1082 states to 1082 states and 1479 transitions. [2022-11-21 16:15:20,053 INFO L78 Accepts]: Start accepts. Automaton has 1082 states and 1479 transitions. Word has length 87 [2022-11-21 16:15:20,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:15:20,054 INFO L495 AbstractCegarLoop]: Abstraction has 1082 states and 1479 transitions. [2022-11-21 16:15:20,054 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 6 states have internal predecessors, (66), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2022-11-21 16:15:20,054 INFO L276 IsEmpty]: Start isEmpty. Operand 1082 states and 1479 transitions. [2022-11-21 16:15:20,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-11-21 16:15:20,055 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:15:20,056 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:15:20,056 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-21 16:15:20,056 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:15:20,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:15:20,057 INFO L85 PathProgramCache]: Analyzing trace with hash 1820782171, now seen corresponding path program 1 times [2022-11-21 16:15:20,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:15:20,057 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470097985] [2022-11-21 16:15:20,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:15:20,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:15:20,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:20,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-21 16:15:20,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:20,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-21 16:15:20,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:20,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-11-21 16:15:20,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:20,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-21 16:15:20,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:20,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-11-21 16:15:20,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:20,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-11-21 16:15:20,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:20,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-11-21 16:15:20,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:20,218 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-21 16:15:20,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:15:20,219 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470097985] [2022-11-21 16:15:20,219 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1470097985] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:15:20,219 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:15:20,219 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-21 16:15:20,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831251515] [2022-11-21 16:15:20,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:15:20,220 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-21 16:15:20,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:15:20,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-21 16:15:20,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-21 16:15:20,221 INFO L87 Difference]: Start difference. First operand 1082 states and 1479 transitions. Second operand has 4 states, 4 states have (on average 17.5) internal successors, (70), 3 states have internal predecessors, (70), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-11-21 16:15:20,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:15:20,367 INFO L93 Difference]: Finished difference Result 2007 states and 2768 transitions. [2022-11-21 16:15:20,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-21 16:15:20,368 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 3 states have internal predecessors, (70), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 91 [2022-11-21 16:15:20,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:15:20,373 INFO L225 Difference]: With dead ends: 2007 [2022-11-21 16:15:20,373 INFO L226 Difference]: Without dead ends: 1106 [2022-11-21 16:15:20,375 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-21 16:15:20,376 INFO L413 NwaCegarLoop]: 259 mSDtfsCounter, 5 mSDsluCounter, 503 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 762 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-21 16:15:20,376 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 762 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-21 16:15:20,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1106 states. [2022-11-21 16:15:20,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1106 to 1106. [2022-11-21 16:15:20,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1106 states, 845 states have (on average 1.3644970414201183) internal successors, (1153), 850 states have internal predecessors, (1153), 172 states have call successors, (172), 88 states have call predecessors, (172), 88 states have return successors, (172), 167 states have call predecessors, (172), 172 states have call successors, (172) [2022-11-21 16:15:20,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1106 states to 1106 states and 1497 transitions. [2022-11-21 16:15:20,504 INFO L78 Accepts]: Start accepts. Automaton has 1106 states and 1497 transitions. Word has length 91 [2022-11-21 16:15:20,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:15:20,505 INFO L495 AbstractCegarLoop]: Abstraction has 1106 states and 1497 transitions. [2022-11-21 16:15:20,505 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 3 states have internal predecessors, (70), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-11-21 16:15:20,505 INFO L276 IsEmpty]: Start isEmpty. Operand 1106 states and 1497 transitions. [2022-11-21 16:15:20,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2022-11-21 16:15:20,507 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:15:20,507 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:15:20,507 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-21 16:15:20,507 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:15:20,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:15:20,508 INFO L85 PathProgramCache]: Analyzing trace with hash 1723609181, now seen corresponding path program 1 times [2022-11-21 16:15:20,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:15:20,508 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261599126] [2022-11-21 16:15:20,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:15:20,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:15:20,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:20,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-21 16:15:20,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:20,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-21 16:15:20,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:20,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-11-21 16:15:20,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:20,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-21 16:15:20,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:20,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-11-21 16:15:20,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:20,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-11-21 16:15:20,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:20,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-11-21 16:15:20,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:20,807 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-21 16:15:20,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:15:20,807 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261599126] [2022-11-21 16:15:20,807 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [261599126] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:15:20,807 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:15:20,808 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-21 16:15:20,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887177266] [2022-11-21 16:15:20,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:15:20,809 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-21 16:15:20,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:15:20,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-21 16:15:20,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-21 16:15:20,810 INFO L87 Difference]: Start difference. First operand 1106 states and 1497 transitions. Second operand has 8 states, 6 states have (on average 11.0) internal successors, (66), 7 states have internal predecessors, (66), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) [2022-11-21 16:15:21,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:15:21,171 INFO L93 Difference]: Finished difference Result 1536 states and 2187 transitions. [2022-11-21 16:15:21,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-21 16:15:21,171 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 11.0) internal successors, (66), 7 states have internal predecessors, (66), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) Word has length 90 [2022-11-21 16:15:21,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:15:21,178 INFO L225 Difference]: With dead ends: 1536 [2022-11-21 16:15:21,178 INFO L226 Difference]: Without dead ends: 1534 [2022-11-21 16:15:21,179 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-21 16:15:21,180 INFO L413 NwaCegarLoop]: 446 mSDtfsCounter, 329 mSDsluCounter, 2086 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 355 SdHoareTripleChecker+Valid, 2532 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 16:15:21,180 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [355 Valid, 2532 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 16:15:21,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1534 states. [2022-11-21 16:15:21,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1534 to 1114. [2022-11-21 16:15:21,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1114 states, 849 states have (on average 1.3627797408716136) internal successors, (1157), 856 states have internal predecessors, (1157), 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-21 16:15:21,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1114 states to 1114 states and 1505 transitions. [2022-11-21 16:15:21,379 INFO L78 Accepts]: Start accepts. Automaton has 1114 states and 1505 transitions. Word has length 90 [2022-11-21 16:15:21,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:15:21,379 INFO L495 AbstractCegarLoop]: Abstraction has 1114 states and 1505 transitions. [2022-11-21 16:15:21,380 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 11.0) internal successors, (66), 7 states have internal predecessors, (66), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) [2022-11-21 16:15:21,380 INFO L276 IsEmpty]: Start isEmpty. Operand 1114 states and 1505 transitions. [2022-11-21 16:15:21,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-11-21 16:15:21,382 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:15:21,382 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:15:21,382 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-21 16:15:21,383 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:15:21,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:15:21,383 INFO L85 PathProgramCache]: Analyzing trace with hash 2094931668, now seen corresponding path program 1 times [2022-11-21 16:15:21,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:15:21,384 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036272603] [2022-11-21 16:15:21,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:15:21,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:15:21,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:21,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-21 16:15:21,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:21,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-21 16:15:21,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:21,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-11-21 16:15:21,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:21,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-21 16:15:21,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:21,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-11-21 16:15:21,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:21,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-11-21 16:15:21,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:21,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-11-21 16:15:21,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:21,563 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-21 16:15:21,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:15:21,563 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036272603] [2022-11-21 16:15:21,563 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2036272603] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:15:21,564 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:15:21,564 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-21 16:15:21,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81729078] [2022-11-21 16:15:21,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:15:21,564 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-21 16:15:21,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:15:21,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-21 16:15:21,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-21 16:15:21,565 INFO L87 Difference]: Start difference. First operand 1114 states and 1505 transitions. Second operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 6 states have internal predecessors, (69), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-11-21 16:15:21,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:15:21,912 INFO L93 Difference]: Finished difference Result 2204 states and 3042 transitions. [2022-11-21 16:15:21,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-21 16:15:21,912 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 6 states have internal predecessors, (69), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 93 [2022-11-21 16:15:21,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:15:21,918 INFO L225 Difference]: With dead ends: 2204 [2022-11-21 16:15:21,918 INFO L226 Difference]: Without dead ends: 1353 [2022-11-21 16:15:21,920 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-11-21 16:15:21,921 INFO L413 NwaCegarLoop]: 342 mSDtfsCounter, 371 mSDsluCounter, 1548 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 376 SdHoareTripleChecker+Valid, 1890 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 16:15:21,921 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [376 Valid, 1890 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 16:15:21,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1353 states. [2022-11-21 16:15:22,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1353 to 1117. [2022-11-21 16:15:22,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1117 states, 863 states have (on average 1.3534183082271147) internal successors, (1168), 875 states have internal predecessors, (1168), 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-21 16:15:22,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1117 states to 1117 states and 1492 transitions. [2022-11-21 16:15:22,098 INFO L78 Accepts]: Start accepts. Automaton has 1117 states and 1492 transitions. Word has length 93 [2022-11-21 16:15:22,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:15:22,099 INFO L495 AbstractCegarLoop]: Abstraction has 1117 states and 1492 transitions. [2022-11-21 16:15:22,099 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 6 states have internal predecessors, (69), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-11-21 16:15:22,099 INFO L276 IsEmpty]: Start isEmpty. Operand 1117 states and 1492 transitions. [2022-11-21 16:15:22,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2022-11-21 16:15:22,101 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:15:22,101 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:15:22,101 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-21 16:15:22,101 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:15:22,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:15:22,102 INFO L85 PathProgramCache]: Analyzing trace with hash -1811425973, now seen corresponding path program 1 times [2022-11-21 16:15:22,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:15:22,102 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220590437] [2022-11-21 16:15:22,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:15:22,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:15:22,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:22,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-21 16:15:22,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:22,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-21 16:15:22,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:22,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-11-21 16:15:22,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:22,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-21 16:15:22,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:22,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-11-21 16:15:22,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:22,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-11-21 16:15:22,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:22,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-11-21 16:15:22,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:22,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-11-21 16:15:22,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:22,365 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-21 16:15:22,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:15:22,366 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220590437] [2022-11-21 16:15:22,366 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1220590437] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:15:22,366 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:15:22,366 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-21 16:15:22,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533958079] [2022-11-21 16:15:22,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:15:22,367 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-21 16:15:22,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:15:22,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-21 16:15:22,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-21 16:15:22,368 INFO L87 Difference]: Start difference. First operand 1117 states and 1492 transitions. Second operand has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 6 states have internal predecessors, (68), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2022-11-21 16:15:22,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:15:22,804 INFO L93 Difference]: Finished difference Result 2255 states and 3097 transitions. [2022-11-21 16:15:22,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-21 16:15:22,805 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 6 states have internal predecessors, (68), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) Word has length 95 [2022-11-21 16:15:22,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:15:22,811 INFO L225 Difference]: With dead ends: 2255 [2022-11-21 16:15:22,811 INFO L226 Difference]: Without dead ends: 1381 [2022-11-21 16:15:22,813 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-21 16:15:22,813 INFO L413 NwaCegarLoop]: 372 mSDtfsCounter, 286 mSDsluCounter, 1668 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 300 SdHoareTripleChecker+Valid, 2040 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 16:15:22,814 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [300 Valid, 2040 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 16:15:22,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1381 states. [2022-11-21 16:15:22,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1381 to 1008. [2022-11-21 16:15:22,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1008 states, 781 states have (on average 1.3559539052496798) internal successors, (1059), 791 states have internal predecessors, (1059), 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-21 16:15:22,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1008 states to 1008 states and 1349 transitions. [2022-11-21 16:15:22,966 INFO L78 Accepts]: Start accepts. Automaton has 1008 states and 1349 transitions. Word has length 95 [2022-11-21 16:15:22,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:15:22,967 INFO L495 AbstractCegarLoop]: Abstraction has 1008 states and 1349 transitions. [2022-11-21 16:15:22,967 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 6 states have internal predecessors, (68), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2022-11-21 16:15:22,967 INFO L276 IsEmpty]: Start isEmpty. Operand 1008 states and 1349 transitions. [2022-11-21 16:15:22,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-11-21 16:15:22,968 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:15:22,969 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:15:22,969 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-21 16:15:22,969 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:15:22,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:15:22,970 INFO L85 PathProgramCache]: Analyzing trace with hash -375753860, now seen corresponding path program 1 times [2022-11-21 16:15:22,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:15:22,970 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642854690] [2022-11-21 16:15:22,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:15:22,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:15:23,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:23,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-21 16:15:23,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:23,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-21 16:15:23,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:23,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-11-21 16:15:23,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:23,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-21 16:15:23,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:23,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-11-21 16:15:23,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:23,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-11-21 16:15:23,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:23,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-11-21 16:15:23,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:23,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-11-21 16:15:23,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:23,256 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-21 16:15:23,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:15:23,256 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642854690] [2022-11-21 16:15:23,256 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642854690] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:15:23,257 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:15:23,257 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-21 16:15:23,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16448764] [2022-11-21 16:15:23,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:15:23,258 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-21 16:15:23,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:15:23,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-21 16:15:23,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-21 16:15:23,259 INFO L87 Difference]: Start difference. First operand 1008 states and 1349 transitions. Second operand has 8 states, 8 states have (on average 9.125) internal successors, (73), 7 states have internal predecessors, (73), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2022-11-21 16:15:24,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:15:24,187 INFO L93 Difference]: Finished difference Result 2311 states and 3183 transitions. [2022-11-21 16:15:24,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-21 16:15:24,188 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.125) internal successors, (73), 7 states have internal predecessors, (73), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Word has length 96 [2022-11-21 16:15:24,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:15:24,195 INFO L225 Difference]: With dead ends: 2311 [2022-11-21 16:15:24,195 INFO L226 Difference]: Without dead ends: 1466 [2022-11-21 16:15:24,197 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-21 16:15:24,198 INFO L413 NwaCegarLoop]: 427 mSDtfsCounter, 669 mSDsluCounter, 1671 mSDsCounter, 0 mSdLazyCounter, 505 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 675 SdHoareTripleChecker+Valid, 2098 SdHoareTripleChecker+Invalid, 558 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 505 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-21 16:15:24,198 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [675 Valid, 2098 Invalid, 558 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 505 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-21 16:15:24,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1466 states. [2022-11-21 16:15:24,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1466 to 1024. [2022-11-21 16:15:24,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1024 states, 789 states have (on average 1.3333333333333333) internal successors, (1052), 800 states have internal predecessors, (1052), 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-21 16:15:24,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1024 states to 1024 states and 1348 transitions. [2022-11-21 16:15:24,435 INFO L78 Accepts]: Start accepts. Automaton has 1024 states and 1348 transitions. Word has length 96 [2022-11-21 16:15:24,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:15:24,436 INFO L495 AbstractCegarLoop]: Abstraction has 1024 states and 1348 transitions. [2022-11-21 16:15:24,436 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.125) internal successors, (73), 7 states have internal predecessors, (73), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2022-11-21 16:15:24,436 INFO L276 IsEmpty]: Start isEmpty. Operand 1024 states and 1348 transitions. [2022-11-21 16:15:24,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-11-21 16:15:24,438 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:15:24,438 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-21 16:15:24,439 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-21 16:15:24,439 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:15:24,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:15:24,439 INFO L85 PathProgramCache]: Analyzing trace with hash -566843121, now seen corresponding path program 1 times [2022-11-21 16:15:24,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:15:24,440 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206641213] [2022-11-21 16:15:24,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:15:24,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:15:24,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:24,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-21 16:15:24,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:24,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-21 16:15:24,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:24,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-21 16:15:24,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:24,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-11-21 16:15:24,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:24,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-11-21 16:15:24,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:24,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-11-21 16:15:24,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:24,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-11-21 16:15:24,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:24,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-11-21 16:15:24,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:24,610 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-21 16:15:24,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:15:24,611 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206641213] [2022-11-21 16:15:24,611 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206641213] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:15:24,611 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:15:24,611 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-21 16:15:24,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468582529] [2022-11-21 16:15:24,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:15:24,612 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-21 16:15:24,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:15:24,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-21 16:15:24,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-21 16:15:24,613 INFO L87 Difference]: Start difference. First operand 1024 states and 1348 transitions. Second operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-11-21 16:15:25,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:15:25,123 INFO L93 Difference]: Finished difference Result 2878 states and 3865 transitions. [2022-11-21 16:15:25,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-21 16:15:25,124 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 97 [2022-11-21 16:15:25,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:15:25,133 INFO L225 Difference]: With dead ends: 2878 [2022-11-21 16:15:25,133 INFO L226 Difference]: Without dead ends: 2068 [2022-11-21 16:15:25,136 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-21 16:15:25,137 INFO L413 NwaCegarLoop]: 454 mSDtfsCounter, 372 mSDsluCounter, 643 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 372 SdHoareTripleChecker+Valid, 1097 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 16:15:25,137 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [372 Valid, 1097 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 16:15:25,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2068 states. [2022-11-21 16:15:25,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2068 to 1768. [2022-11-21 16:15:25,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1768 states, 1343 states have (on average 1.326880119136262) internal successors, (1782), 1362 states have internal predecessors, (1782), 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-21 16:15:25,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1768 states to 1768 states and 2326 transitions. [2022-11-21 16:15:25,461 INFO L78 Accepts]: Start accepts. Automaton has 1768 states and 2326 transitions. Word has length 97 [2022-11-21 16:15:25,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:15:25,461 INFO L495 AbstractCegarLoop]: Abstraction has 1768 states and 2326 transitions. [2022-11-21 16:15:25,462 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-11-21 16:15:25,462 INFO L276 IsEmpty]: Start isEmpty. Operand 1768 states and 2326 transitions. [2022-11-21 16:15:25,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-11-21 16:15:25,464 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:15:25,464 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-21 16:15:25,464 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-21 16:15:25,464 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:15:25,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:15:25,465 INFO L85 PathProgramCache]: Analyzing trace with hash 1375100484, now seen corresponding path program 1 times [2022-11-21 16:15:25,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:15:25,465 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264542978] [2022-11-21 16:15:25,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:15:25,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:15:25,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:25,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-21 16:15:25,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:25,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-21 16:15:25,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:25,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-21 16:15:25,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:25,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-11-21 16:15:25,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:25,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-11-21 16:15:25,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:25,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-11-21 16:15:25,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:25,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-11-21 16:15:25,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:25,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-11-21 16:15:25,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:25,790 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-21 16:15:25,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:15:25,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264542978] [2022-11-21 16:15:25,790 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [264542978] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:15:25,791 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:15:25,791 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-21 16:15:25,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164932561] [2022-11-21 16:15:25,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:15:25,793 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-21 16:15:25,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:15:25,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-21 16:15:25,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-21 16:15:25,794 INFO L87 Difference]: Start difference. First operand 1768 states and 2326 transitions. Second operand has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 6 states have internal predecessors, (76), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2022-11-21 16:15:26,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:15:26,917 INFO L93 Difference]: Finished difference Result 3919 states and 5292 transitions. [2022-11-21 16:15:26,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-21 16:15:26,917 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 6 states have internal predecessors, (76), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) Word has length 99 [2022-11-21 16:15:26,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:15:26,928 INFO L225 Difference]: With dead ends: 3919 [2022-11-21 16:15:26,929 INFO L226 Difference]: Without dead ends: 2447 [2022-11-21 16:15:26,932 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-21 16:15:26,933 INFO L413 NwaCegarLoop]: 467 mSDtfsCounter, 698 mSDsluCounter, 1544 mSDsCounter, 0 mSdLazyCounter, 397 mSolverCounterSat, 195 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 701 SdHoareTripleChecker+Valid, 2011 SdHoareTripleChecker+Invalid, 592 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 195 IncrementalHoareTripleChecker+Valid, 397 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-21 16:15:26,933 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [701 Valid, 2011 Invalid, 592 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [195 Valid, 397 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-21 16:15:26,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2447 states. [2022-11-21 16:15:27,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2447 to 1793. [2022-11-21 16:15:27,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1793 states, 1355 states have (on average 1.3210332103321034) internal successors, (1790), 1375 states have internal predecessors, (1790), 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-21 16:15:27,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1793 states to 1793 states and 2350 transitions. [2022-11-21 16:15:27,315 INFO L78 Accepts]: Start accepts. Automaton has 1793 states and 2350 transitions. Word has length 99 [2022-11-21 16:15:27,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:15:27,315 INFO L495 AbstractCegarLoop]: Abstraction has 1793 states and 2350 transitions. [2022-11-21 16:15:27,315 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 6 states have internal predecessors, (76), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2022-11-21 16:15:27,316 INFO L276 IsEmpty]: Start isEmpty. Operand 1793 states and 2350 transitions. [2022-11-21 16:15:27,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-11-21 16:15:27,317 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:15:27,317 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-21 16:15:27,318 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-11-21 16:15:27,318 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:15:27,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:15:27,319 INFO L85 PathProgramCache]: Analyzing trace with hash -599061911, now seen corresponding path program 1 times [2022-11-21 16:15:27,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:15:27,319 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434427448] [2022-11-21 16:15:27,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:15:27,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:15:27,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:27,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-21 16:15:27,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:27,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-21 16:15:27,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:27,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-11-21 16:15:27,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:27,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-11-21 16:15:27,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:27,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-11-21 16:15:27,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:27,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-11-21 16:15:27,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:27,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-11-21 16:15:27,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:27,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-11-21 16:15:27,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:27,427 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-21 16:15:27,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:15:27,428 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434427448] [2022-11-21 16:15:27,428 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1434427448] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:15:27,428 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:15:27,428 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-21 16:15:27,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295087974] [2022-11-21 16:15:27,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:15:27,429 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-21 16:15:27,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:15:27,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-21 16:15:27,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-21 16:15:27,430 INFO L87 Difference]: Start difference. First operand 1793 states and 2350 transitions. Second operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-11-21 16:15:28,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:15:28,241 INFO L93 Difference]: Finished difference Result 4650 states and 6153 transitions. [2022-11-21 16:15:28,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-21 16:15:28,242 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 101 [2022-11-21 16:15:28,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:15:28,255 INFO L225 Difference]: With dead ends: 4650 [2022-11-21 16:15:28,255 INFO L226 Difference]: Without dead ends: 3194 [2022-11-21 16:15:28,260 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-21 16:15:28,260 INFO L413 NwaCegarLoop]: 470 mSDtfsCounter, 399 mSDsluCounter, 677 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 399 SdHoareTripleChecker+Valid, 1147 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-21 16:15:28,261 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [399 Valid, 1147 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 16:15:28,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3194 states. [2022-11-21 16:15:28,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3194 to 2814. [2022-11-21 16:15:28,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2814 states, 2101 states have (on average 1.3122322703474536) internal successors, (2757), 2132 states have internal predecessors, (2757), 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-21 16:15:28,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2814 states to 2814 states and 3677 transitions. [2022-11-21 16:15:28,765 INFO L78 Accepts]: Start accepts. Automaton has 2814 states and 3677 transitions. Word has length 101 [2022-11-21 16:15:28,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:15:28,765 INFO L495 AbstractCegarLoop]: Abstraction has 2814 states and 3677 transitions. [2022-11-21 16:15:28,766 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-11-21 16:15:28,766 INFO L276 IsEmpty]: Start isEmpty. Operand 2814 states and 3677 transitions. [2022-11-21 16:15:28,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-11-21 16:15:28,769 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:15:28,770 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-21 16:15:28,770 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-11-21 16:15:28,770 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:15:28,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:15:28,771 INFO L85 PathProgramCache]: Analyzing trace with hash 647926777, now seen corresponding path program 1 times [2022-11-21 16:15:28,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:15:28,771 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007801849] [2022-11-21 16:15:28,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:15:28,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:15:28,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:28,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-21 16:15:28,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:28,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-21 16:15:28,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:28,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-21 16:15:28,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:28,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-21 16:15:28,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:28,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-21 16:15:28,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:28,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-11-21 16:15:28,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:28,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-11-21 16:15:28,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:28,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-11-21 16:15:28,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:28,887 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-21 16:15:28,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:15:28,887 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007801849] [2022-11-21 16:15:28,888 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2007801849] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:15:28,888 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:15:28,888 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-21 16:15:28,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564611911] [2022-11-21 16:15:28,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:15:28,889 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-21 16:15:28,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:15:28,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-21 16:15:28,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-21 16:15:28,890 INFO L87 Difference]: Start difference. First operand 2814 states and 3677 transitions. Second operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-11-21 16:15:29,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:15:29,701 INFO L93 Difference]: Finished difference Result 6657 states and 8764 transitions. [2022-11-21 16:15:29,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-21 16:15:29,702 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 101 [2022-11-21 16:15:29,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:15:29,721 INFO L225 Difference]: With dead ends: 6657 [2022-11-21 16:15:29,721 INFO L226 Difference]: Without dead ends: 4300 [2022-11-21 16:15:29,727 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-21 16:15:29,728 INFO L413 NwaCegarLoop]: 477 mSDtfsCounter, 373 mSDsluCounter, 656 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 373 SdHoareTripleChecker+Valid, 1133 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-21 16:15:29,728 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [373 Valid, 1133 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 16:15:29,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4300 states. [2022-11-21 16:15:30,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4300 to 4030. [2022-11-21 16:15:30,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4030 states, 2993 states have (on average 1.3087203474774474) internal successors, (3917), 3037 states have internal predecessors, (3917), 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-21 16:15:30,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4030 states to 4030 states and 5261 transitions. [2022-11-21 16:15:30,393 INFO L78 Accepts]: Start accepts. Automaton has 4030 states and 5261 transitions. Word has length 101 [2022-11-21 16:15:30,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:15:30,394 INFO L495 AbstractCegarLoop]: Abstraction has 4030 states and 5261 transitions. [2022-11-21 16:15:30,394 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-11-21 16:15:30,394 INFO L276 IsEmpty]: Start isEmpty. Operand 4030 states and 5261 transitions. [2022-11-21 16:15:30,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2022-11-21 16:15:30,397 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:15:30,397 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-21 16:15:30,397 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-11-21 16:15:30,397 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:15:30,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:15:30,398 INFO L85 PathProgramCache]: Analyzing trace with hash -1760044486, now seen corresponding path program 1 times [2022-11-21 16:15:30,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:15:30,398 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81551116] [2022-11-21 16:15:30,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:15:30,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:15:30,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:30,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-21 16:15:30,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:30,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-21 16:15:30,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:30,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-11-21 16:15:30,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:30,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-11-21 16:15:30,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:30,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-11-21 16:15:30,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:30,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-11-21 16:15:30,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:30,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-11-21 16:15:30,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:30,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-11-21 16:15:30,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:30,456 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-21 16:15:30,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:15:30,457 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81551116] [2022-11-21 16:15:30,457 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [81551116] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:15:30,457 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:15:30,457 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-21 16:15:30,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778942249] [2022-11-21 16:15:30,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:15:30,458 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 16:15:30,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:15:30,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 16:15:30,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 16:15:30,459 INFO L87 Difference]: Start difference. First operand 4030 states and 5261 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-21 16:15:31,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:15:31,612 INFO L93 Difference]: Finished difference Result 9092 states and 12309 transitions. [2022-11-21 16:15:31,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 16:15:31,613 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-21 16:15:31,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:15:31,647 INFO L225 Difference]: With dead ends: 9092 [2022-11-21 16:15:31,648 INFO L226 Difference]: Without dead ends: 5416 [2022-11-21 16:15:31,656 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-21 16:15:31,657 INFO L413 NwaCegarLoop]: 407 mSDtfsCounter, 123 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 631 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 16:15:31,657 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 631 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 16:15:31,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5416 states. [2022-11-21 16:15:32,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5416 to 4036. [2022-11-21 16:15:32,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4036 states, 2999 states have (on average 1.3081027009003001) internal successors, (3923), 3043 states have internal predecessors, (3923), 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-21 16:15:32,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4036 states to 4036 states and 5267 transitions. [2022-11-21 16:15:32,316 INFO L78 Accepts]: Start accepts. Automaton has 4036 states and 5267 transitions. Word has length 102 [2022-11-21 16:15:32,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:15:32,317 INFO L495 AbstractCegarLoop]: Abstraction has 4036 states and 5267 transitions. [2022-11-21 16:15:32,317 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-21 16:15:32,317 INFO L276 IsEmpty]: Start isEmpty. Operand 4036 states and 5267 transitions. [2022-11-21 16:15:32,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-11-21 16:15:32,319 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:15:32,320 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:15:32,320 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-11-21 16:15:32,320 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:15:32,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:15:32,321 INFO L85 PathProgramCache]: Analyzing trace with hash 1930890164, now seen corresponding path program 1 times [2022-11-21 16:15:32,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:15:32,321 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228039878] [2022-11-21 16:15:32,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:15:32,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:15:32,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:32,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-21 16:15:32,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:32,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-21 16:15:32,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:32,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-21 16:15:32,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:32,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-21 16:15:32,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:32,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-21 16:15:32,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:32,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-11-21 16:15:32,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:32,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-11-21 16:15:32,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:32,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-11-21 16:15:32,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:32,467 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-21 16:15:32,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:15:32,469 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228039878] [2022-11-21 16:15:32,469 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [228039878] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:15:32,469 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:15:32,469 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-21 16:15:32,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022349440] [2022-11-21 16:15:32,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:15:32,470 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-21 16:15:32,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:15:32,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-21 16:15:32,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-21 16:15:32,471 INFO L87 Difference]: Start difference. First operand 4036 states and 5267 transitions. Second operand has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-11-21 16:15:33,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:15:33,288 INFO L93 Difference]: Finished difference Result 8476 states and 11323 transitions. [2022-11-21 16:15:33,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-21 16:15:33,288 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 103 [2022-11-21 16:15:33,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:15:33,304 INFO L225 Difference]: With dead ends: 8476 [2022-11-21 16:15:33,305 INFO L226 Difference]: Without dead ends: 4516 [2022-11-21 16:15:33,312 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-21 16:15:33,313 INFO L413 NwaCegarLoop]: 294 mSDtfsCounter, 263 mSDsluCounter, 493 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 288 SdHoareTripleChecker+Valid, 787 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-21 16:15:33,313 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [288 Valid, 787 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-21 16:15:33,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4516 states. [2022-11-21 16:15:34,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4516 to 3681. [2022-11-21 16:15:34,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3681 states, 2727 states have (on average 1.3182984965163183) internal successors, (3595), 2761 states have internal predecessors, (3595), 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-21 16:15:34,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3681 states to 3681 states and 4835 transitions. [2022-11-21 16:15:34,095 INFO L78 Accepts]: Start accepts. Automaton has 3681 states and 4835 transitions. Word has length 103 [2022-11-21 16:15:34,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:15:34,096 INFO L495 AbstractCegarLoop]: Abstraction has 3681 states and 4835 transitions. [2022-11-21 16:15:34,096 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-11-21 16:15:34,096 INFO L276 IsEmpty]: Start isEmpty. Operand 3681 states and 4835 transitions. [2022-11-21 16:15:34,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2022-11-21 16:15:34,098 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:15:34,099 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:15:34,099 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-11-21 16:15:34,100 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:15:34,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:15:34,101 INFO L85 PathProgramCache]: Analyzing trace with hash -1500264054, now seen corresponding path program 1 times [2022-11-21 16:15:34,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:15:34,101 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697374484] [2022-11-21 16:15:34,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:15:34,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:15:34,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:34,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-21 16:15:34,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:34,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-21 16:15:34,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:34,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-11-21 16:15:34,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:34,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-11-21 16:15:34,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:34,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-11-21 16:15:34,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:34,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-11-21 16:15:34,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:34,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-11-21 16:15:34,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:34,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-11-21 16:15:34,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:34,177 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-21 16:15:34,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:15:34,177 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697374484] [2022-11-21 16:15:34,177 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [697374484] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:15:34,178 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:15:34,178 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-21 16:15:34,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579848532] [2022-11-21 16:15:34,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:15:34,179 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 16:15:34,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:15:34,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 16:15:34,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 16:15:34,180 INFO L87 Difference]: Start difference. First operand 3681 states and 4835 transitions. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-11-21 16:15:35,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:15:35,170 INFO L93 Difference]: Finished difference Result 8070 states and 10879 transitions. [2022-11-21 16:15:35,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 16:15:35,171 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 104 [2022-11-21 16:15:35,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:15:35,185 INFO L225 Difference]: With dead ends: 8070 [2022-11-21 16:15:35,185 INFO L226 Difference]: Without dead ends: 4570 [2022-11-21 16:15:35,192 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-21 16:15:35,193 INFO L413 NwaCegarLoop]: 400 mSDtfsCounter, 123 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 625 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 16:15:35,193 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 625 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 16:15:35,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4570 states. [2022-11-21 16:15:35,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4570 to 3691. [2022-11-21 16:15:35,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3691 states, 2737 states have (on average 1.3171355498721227) internal successors, (3605), 2771 states have internal predecessors, (3605), 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-21 16:15:35,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3691 states to 3691 states and 4845 transitions. [2022-11-21 16:15:35,849 INFO L78 Accepts]: Start accepts. Automaton has 3691 states and 4845 transitions. Word has length 104 [2022-11-21 16:15:35,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:15:35,850 INFO L495 AbstractCegarLoop]: Abstraction has 3691 states and 4845 transitions. [2022-11-21 16:15:35,850 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-11-21 16:15:35,850 INFO L276 IsEmpty]: Start isEmpty. Operand 3691 states and 4845 transitions. [2022-11-21 16:15:35,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2022-11-21 16:15:35,852 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:15:35,852 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:15:35,852 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-11-21 16:15:35,853 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:15:35,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:15:35,853 INFO L85 PathProgramCache]: Analyzing trace with hash -1445902481, now seen corresponding path program 1 times [2022-11-21 16:15:35,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:15:35,853 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851266137] [2022-11-21 16:15:35,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:15:35,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:15:35,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:35,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-21 16:15:35,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:35,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-21 16:15:35,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:35,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-11-21 16:15:35,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:35,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-11-21 16:15:35,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:35,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-11-21 16:15:35,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:35,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-11-21 16:15:35,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:35,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-11-21 16:15:35,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:35,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-11-21 16:15:35,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:35,983 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-21 16:15:35,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:15:35,983 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851266137] [2022-11-21 16:15:35,983 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851266137] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:15:35,984 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:15:35,984 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-21 16:15:35,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697189310] [2022-11-21 16:15:35,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:15:35,984 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-21 16:15:35,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:15:35,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-21 16:15:35,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-21 16:15:35,985 INFO L87 Difference]: Start difference. First operand 3691 states and 4845 transitions. Second operand has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-11-21 16:15:36,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:15:36,895 INFO L93 Difference]: Finished difference Result 8053 states and 10848 transitions. [2022-11-21 16:15:36,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-21 16:15:36,896 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 104 [2022-11-21 16:15:36,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:15:36,911 INFO L225 Difference]: With dead ends: 8053 [2022-11-21 16:15:36,911 INFO L226 Difference]: Without dead ends: 4481 [2022-11-21 16:15:36,919 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-21 16:15:36,920 INFO L413 NwaCegarLoop]: 305 mSDtfsCounter, 211 mSDsluCounter, 499 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 804 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-21 16:15:36,920 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [236 Valid, 804 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-21 16:15:36,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4481 states. [2022-11-21 16:15:37,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4481 to 2783. [2022-11-21 16:15:37,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2783 states, 2063 states have (on average 1.3116820164808531) internal successors, (2706), 2082 states have internal predecessors, (2706), 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-21 16:15:37,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2783 states to 2783 states and 3644 transitions. [2022-11-21 16:15:37,517 INFO L78 Accepts]: Start accepts. Automaton has 2783 states and 3644 transitions. Word has length 104 [2022-11-21 16:15:37,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:15:37,518 INFO L495 AbstractCegarLoop]: Abstraction has 2783 states and 3644 transitions. [2022-11-21 16:15:37,518 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-11-21 16:15:37,518 INFO L276 IsEmpty]: Start isEmpty. Operand 2783 states and 3644 transitions. [2022-11-21 16:15:37,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2022-11-21 16:15:37,523 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:15:37,523 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:15:37,523 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-11-21 16:15:37,524 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:15:37,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:15:37,524 INFO L85 PathProgramCache]: Analyzing trace with hash 486642331, now seen corresponding path program 1 times [2022-11-21 16:15:37,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:15:37,524 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352577353] [2022-11-21 16:15:37,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:15:37,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:15:37,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:37,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-21 16:15:37,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:37,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-21 16:15:37,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:37,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-11-21 16:15:37,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:37,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-21 16:15:37,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:37,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-11-21 16:15:37,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:37,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-11-21 16:15:37,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:37,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-11-21 16:15:37,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:37,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-11-21 16:15:37,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:37,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-11-21 16:15:37,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:37,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-11-21 16:15:37,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:37,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-11-21 16:15:37,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:37,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-11-21 16:15:37,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:37,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-11-21 16:15:37,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:37,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-11-21 16:15:37,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:37,892 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-21 16:15:37,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:15:37,892 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352577353] [2022-11-21 16:15:37,892 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [352577353] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 16:15:37,893 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1319998816] [2022-11-21 16:15:37,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:15:37,893 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:15:37,893 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45a6a48e-927b-43c1-a242-2685973c4754/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:15:37,896 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45a6a48e-927b-43c1-a242-2685973c4754/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 16:15:37,904 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45a6a48e-927b-43c1-a242-2685973c4754/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-21 16:15:38,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:38,099 INFO L263 TraceCheckSpWp]: Trace formula consists of 698 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-21 16:15:38,109 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:15:38,379 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-21 16:15:38,382 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 16:15:38,594 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-21 16:15:38,594 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1319998816] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 16:15:38,594 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 16:15:38,595 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2022-11-21 16:15:38,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656721213] [2022-11-21 16:15:38,595 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 16:15:38,596 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-21 16:15:38,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:15:38,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-21 16:15:38,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2022-11-21 16:15:38,597 INFO L87 Difference]: Start difference. First operand 2783 states and 3644 transitions. Second operand has 13 states, 13 states have (on average 15.23076923076923) internal successors, (198), 12 states have internal predecessors, (198), 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-21 16:15:43,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:15:43,746 INFO L93 Difference]: Finished difference Result 9096 states and 12764 transitions. [2022-11-21 16:15:43,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-11-21 16:15:43,747 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 15.23076923076923) internal successors, (198), 12 states have internal predecessors, (198), 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 153 [2022-11-21 16:15:43,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:15:43,768 INFO L225 Difference]: With dead ends: 9096 [2022-11-21 16:15:43,768 INFO L226 Difference]: Without dead ends: 6563 [2022-11-21 16:15:43,775 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 378 GetRequests, 335 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 499 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=383, Invalid=1509, Unknown=0, NotChecked=0, Total=1892 [2022-11-21 16:15:43,776 INFO L413 NwaCegarLoop]: 290 mSDtfsCounter, 2682 mSDsluCounter, 2050 mSDsCounter, 0 mSdLazyCounter, 1380 mSolverCounterSat, 932 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2682 SdHoareTripleChecker+Valid, 2340 SdHoareTripleChecker+Invalid, 2312 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 932 IncrementalHoareTripleChecker+Valid, 1380 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-11-21 16:15:43,776 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2682 Valid, 2340 Invalid, 2312 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [932 Valid, 1380 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-11-21 16:15:43,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6563 states. [2022-11-21 16:15:44,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6563 to 3532. [2022-11-21 16:15:44,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3532 states, 2623 states have (on average 1.3027068242470454) internal successors, (3417), 2647 states have internal predecessors, (3417), 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-21 16:15:44,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3532 states to 3532 states and 4587 transitions. [2022-11-21 16:15:44,470 INFO L78 Accepts]: Start accepts. Automaton has 3532 states and 4587 transitions. Word has length 153 [2022-11-21 16:15:44,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:15:44,470 INFO L495 AbstractCegarLoop]: Abstraction has 3532 states and 4587 transitions. [2022-11-21 16:15:44,471 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 15.23076923076923) internal successors, (198), 12 states have internal predecessors, (198), 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-21 16:15:44,471 INFO L276 IsEmpty]: Start isEmpty. Operand 3532 states and 4587 transitions. [2022-11-21 16:15:44,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2022-11-21 16:15:44,477 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:15:44,477 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] [2022-11-21 16:15:44,484 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45a6a48e-927b-43c1-a242-2685973c4754/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-21 16:15:44,683 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45a6a48e-927b-43c1-a242-2685973c4754/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-11-21 16:15:44,684 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:15:44,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:15:44,684 INFO L85 PathProgramCache]: Analyzing trace with hash 1175059624, now seen corresponding path program 1 times [2022-11-21 16:15:44,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:15:44,685 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856431963] [2022-11-21 16:15:44,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:15:44,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:15:44,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:44,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-21 16:15:44,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:44,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-21 16:15:44,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:44,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-11-21 16:15:44,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:44,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-21 16:15:44,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:44,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-11-21 16:15:44,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:44,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-11-21 16:15:44,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:44,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-11-21 16:15:44,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:44,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-11-21 16:15:44,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:44,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-11-21 16:15:44,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:44,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-11-21 16:15:44,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:44,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-11-21 16:15:44,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:44,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-11-21 16:15:44,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:44,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-11-21 16:15:44,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:44,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-11-21 16:15:44,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:44,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2022-11-21 16:15:44,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:44,885 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-21 16:15:44,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:15:44,885 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856431963] [2022-11-21 16:15:44,885 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1856431963] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:15:44,886 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:15:44,886 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-21 16:15:44,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911999241] [2022-11-21 16:15:44,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:15:44,886 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-21 16:15:44,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:15:44,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-21 16:15:44,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-21 16:15:44,887 INFO L87 Difference]: Start difference. First operand 3532 states and 4587 transitions. Second operand has 7 states, 7 states have (on average 13.142857142857142) internal successors, (92), 6 states have internal predecessors, (92), 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-21 16:15:47,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:15:47,235 INFO L93 Difference]: Finished difference Result 12118 states and 16493 transitions. [2022-11-21 16:15:47,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-21 16:15:47,237 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.142857142857142) internal successors, (92), 6 states have internal predecessors, (92), 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 162 [2022-11-21 16:15:47,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:15:47,270 INFO L225 Difference]: With dead ends: 12118 [2022-11-21 16:15:47,270 INFO L226 Difference]: Without dead ends: 8940 [2022-11-21 16:15:47,278 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-21 16:15:47,279 INFO L413 NwaCegarLoop]: 452 mSDtfsCounter, 628 mSDsluCounter, 1977 mSDsCounter, 0 mSdLazyCounter, 267 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 647 SdHoareTripleChecker+Valid, 2429 SdHoareTripleChecker+Invalid, 366 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 267 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-21 16:15:47,279 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [647 Valid, 2429 Invalid, 366 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 267 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-21 16:15:47,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8940 states. [2022-11-21 16:15:48,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8940 to 6288. [2022-11-21 16:15:48,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6288 states, 4611 states have (on average 1.3029711559314683) internal successors, (6008), 4657 states have internal predecessors, (6008), 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-21 16:15:48,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6288 states to 6288 states and 8198 transitions. [2022-11-21 16:15:48,673 INFO L78 Accepts]: Start accepts. Automaton has 6288 states and 8198 transitions. Word has length 162 [2022-11-21 16:15:48,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:15:48,674 INFO L495 AbstractCegarLoop]: Abstraction has 6288 states and 8198 transitions. [2022-11-21 16:15:48,674 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.142857142857142) internal successors, (92), 6 states have internal predecessors, (92), 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-21 16:15:48,674 INFO L276 IsEmpty]: Start isEmpty. Operand 6288 states and 8198 transitions. [2022-11-21 16:15:48,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2022-11-21 16:15:48,684 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:15:48,684 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:15:48,684 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-11-21 16:15:48,685 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:15:48,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:15:48,685 INFO L85 PathProgramCache]: Analyzing trace with hash -52637384, now seen corresponding path program 1 times [2022-11-21 16:15:48,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:15:48,686 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507063919] [2022-11-21 16:15:48,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:15:48,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:15:48,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:49,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-21 16:15:49,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:49,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-21 16:15:49,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:49,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-21 16:15:49,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:49,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-11-21 16:15:49,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:49,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-11-21 16:15:49,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:49,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-11-21 16:15:49,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:49,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-11-21 16:15:49,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:49,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-11-21 16:15:49,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:49,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-11-21 16:15:49,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:49,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-11-21 16:15:49,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:49,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-11-21 16:15:49,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:49,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-11-21 16:15:49,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:49,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-11-21 16:15:49,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:49,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-11-21 16:15:49,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:49,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2022-11-21 16:15:49,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:49,109 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-21 16:15:49,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:15:49,110 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507063919] [2022-11-21 16:15:49,110 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [507063919] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 16:15:49,110 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1992960177] [2022-11-21 16:15:49,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:15:49,111 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:15:49,111 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45a6a48e-927b-43c1-a242-2685973c4754/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:15:49,112 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45a6a48e-927b-43c1-a242-2685973c4754/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 16:15:49,134 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45a6a48e-927b-43c1-a242-2685973c4754/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-21 16:15:49,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:49,311 INFO L263 TraceCheckSpWp]: Trace formula consists of 734 conjuncts, 16 conjunts are in the unsatisfiable core [2022-11-21 16:15:49,316 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:15:49,633 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-21 16:15:49,634 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 16:15:49,877 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-21 16:15:49,877 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1992960177] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 16:15:49,877 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 16:15:49,877 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 16 [2022-11-21 16:15:49,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754670977] [2022-11-21 16:15:49,877 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 16:15:49,878 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-11-21 16:15:49,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:15:49,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-11-21 16:15:49,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2022-11-21 16:15:49,879 INFO L87 Difference]: Start difference. First operand 6288 states and 8198 transitions. Second operand has 16 states, 16 states have (on average 12.875) internal successors, (206), 14 states have internal predecessors, (206), 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-21 16:16:04,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:16:04,613 INFO L93 Difference]: Finished difference Result 29181 states and 39381 transitions. [2022-11-21 16:16:04,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2022-11-21 16:16:04,614 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 12.875) internal successors, (206), 14 states have internal predecessors, (206), 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 162 [2022-11-21 16:16:04,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:16:04,696 INFO L225 Difference]: With dead ends: 29181 [2022-11-21 16:16:04,696 INFO L226 Difference]: Without dead ends: 23173 [2022-11-21 16:16:04,713 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 528 GetRequests, 410 SyntacticMatches, 1 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5081 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=1835, Invalid=12207, Unknown=0, NotChecked=0, Total=14042 [2022-11-21 16:16:04,713 INFO L413 NwaCegarLoop]: 1478 mSDtfsCounter, 5085 mSDsluCounter, 11644 mSDsCounter, 0 mSdLazyCounter, 5862 mSolverCounterSat, 3469 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5085 SdHoareTripleChecker+Valid, 13122 SdHoareTripleChecker+Invalid, 9331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 3469 IncrementalHoareTripleChecker+Valid, 5862 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.0s IncrementalHoareTripleChecker+Time [2022-11-21 16:16:04,714 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5085 Valid, 13122 Invalid, 9331 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [3469 Valid, 5862 Invalid, 0 Unknown, 0 Unchecked, 6.0s Time] [2022-11-21 16:16:04,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23173 states. [2022-11-21 16:16:06,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23173 to 8387. [2022-11-21 16:16:06,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8387 states, 6194 states have (on average 1.3041653212786568) internal successors, (8078), 6252 states have internal predecessors, (8078), 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-21 16:16:06,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8387 states to 8387 states and 10924 transitions. [2022-11-21 16:16:06,636 INFO L78 Accepts]: Start accepts. Automaton has 8387 states and 10924 transitions. Word has length 162 [2022-11-21 16:16:06,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:16:06,637 INFO L495 AbstractCegarLoop]: Abstraction has 8387 states and 10924 transitions. [2022-11-21 16:16:06,637 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 12.875) internal successors, (206), 14 states have internal predecessors, (206), 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-21 16:16:06,637 INFO L276 IsEmpty]: Start isEmpty. Operand 8387 states and 10924 transitions. [2022-11-21 16:16:06,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2022-11-21 16:16:06,651 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:16:06,651 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:16:06,662 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45a6a48e-927b-43c1-a242-2685973c4754/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-11-21 16:16:06,857 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45a6a48e-927b-43c1-a242-2685973c4754/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:16:06,858 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:16:06,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:16:06,858 INFO L85 PathProgramCache]: Analyzing trace with hash -1883995866, now seen corresponding path program 1 times [2022-11-21 16:16:06,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:16:06,859 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713382384] [2022-11-21 16:16:06,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:16:06,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:16:06,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:16:07,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-21 16:16:07,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:16:07,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-21 16:16:07,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:16:07,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-11-21 16:16:07,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:16:07,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-11-21 16:16:07,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:16:07,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-11-21 16:16:07,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:16:07,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-11-21 16:16:07,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:16:07,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-11-21 16:16:07,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:16:07,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-11-21 16:16:07,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:16:07,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-11-21 16:16:07,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:16:07,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-11-21 16:16:07,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:16:07,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-11-21 16:16:07,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:16:07,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-11-21 16:16:07,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:16:07,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-11-21 16:16:07,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:16:07,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-11-21 16:16:07,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:16:07,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2022-11-21 16:16:07,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:16:07,558 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 16 proven. 14 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2022-11-21 16:16:07,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:16:07,558 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713382384] [2022-11-21 16:16:07,558 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1713382384] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 16:16:07,559 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [850121096] [2022-11-21 16:16:07,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:16:07,559 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:16:07,559 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45a6a48e-927b-43c1-a242-2685973c4754/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:16:07,560 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45a6a48e-927b-43c1-a242-2685973c4754/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 16:16:07,586 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45a6a48e-927b-43c1-a242-2685973c4754/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-21 16:16:07,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:16:07,758 INFO L263 TraceCheckSpWp]: Trace formula consists of 739 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-21 16:16:07,762 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:16:07,850 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-21 16:16:07,851 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 16:16:07,971 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-21 16:16:07,971 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [850121096] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-21 16:16:07,971 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-21 16:16:07,971 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8, 7] total 14 [2022-11-21 16:16:07,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336079658] [2022-11-21 16:16:07,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:16:07,972 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-21 16:16:07,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:16:07,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-21 16:16:07,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2022-11-21 16:16:07,973 INFO L87 Difference]: Start difference. First operand 8387 states and 10924 transitions. Second operand has 5 states, 4 states have (on average 23.25) internal successors, (93), 5 states have internal predecessors, (93), 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-21 16:16:09,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:16:09,242 INFO L93 Difference]: Finished difference Result 13717 states and 17918 transitions. [2022-11-21 16:16:09,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-21 16:16:09,243 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 23.25) internal successors, (93), 5 states have internal predecessors, (93), 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 166 [2022-11-21 16:16:09,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:16:09,261 INFO L225 Difference]: With dead ends: 13717 [2022-11-21 16:16:09,262 INFO L226 Difference]: Without dead ends: 5526 [2022-11-21 16:16:09,272 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 368 GetRequests, 356 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2022-11-21 16:16:09,273 INFO L413 NwaCegarLoop]: 258 mSDtfsCounter, 2 mSDsluCounter, 507 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 765 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-21 16:16:09,273 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 765 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-21 16:16:09,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5526 states. [2022-11-21 16:16:10,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5526 to 5294. [2022-11-21 16:16:10,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5294 states, 3912 states have (on average 1.3034253578732107) internal successors, (5099), 3946 states have internal predecessors, (5099), 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-21 16:16:10,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5294 states to 5294 states and 6901 transitions. [2022-11-21 16:16:10,274 INFO L78 Accepts]: Start accepts. Automaton has 5294 states and 6901 transitions. Word has length 166 [2022-11-21 16:16:10,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:16:10,275 INFO L495 AbstractCegarLoop]: Abstraction has 5294 states and 6901 transitions. [2022-11-21 16:16:10,275 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 23.25) internal successors, (93), 5 states have internal predecessors, (93), 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-21 16:16:10,275 INFO L276 IsEmpty]: Start isEmpty. Operand 5294 states and 6901 transitions. [2022-11-21 16:16:10,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2022-11-21 16:16:10,284 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:16:10,284 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:16:10,292 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45a6a48e-927b-43c1-a242-2685973c4754/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-21 16:16:10,490 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45a6a48e-927b-43c1-a242-2685973c4754/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:16:10,490 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:16:10,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:16:10,491 INFO L85 PathProgramCache]: Analyzing trace with hash 981286631, now seen corresponding path program 1 times [2022-11-21 16:16:10,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:16:10,491 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132991619] [2022-11-21 16:16:10,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:16:10,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:16:10,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:16:11,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-21 16:16:11,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:16:11,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-21 16:16:11,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:16:11,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-11-21 16:16:11,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:16:11,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-11-21 16:16:11,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:16:11,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-11-21 16:16:11,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:16:11,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-11-21 16:16:11,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:16:11,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-11-21 16:16:11,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:16:11,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-11-21 16:16:11,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:16:11,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-11-21 16:16:11,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:16:11,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-11-21 16:16:11,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:16:11,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-11-21 16:16:11,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:16:11,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-11-21 16:16:11,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:16:11,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-11-21 16:16:11,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:16:11,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-11-21 16:16:11,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:16:11,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2022-11-21 16:16:11,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:16:11,221 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-21 16:16:11,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:16:11,221 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132991619] [2022-11-21 16:16:11,222 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [132991619] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 16:16:11,222 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1629851025] [2022-11-21 16:16:11,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:16:11,222 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:16:11,223 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45a6a48e-927b-43c1-a242-2685973c4754/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:16:11,227 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45a6a48e-927b-43c1-a242-2685973c4754/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 16:16:11,250 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45a6a48e-927b-43c1-a242-2685973c4754/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-21 16:16:11,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:16:11,429 INFO L263 TraceCheckSpWp]: Trace formula consists of 756 conjuncts, 27 conjunts are in the unsatisfiable core [2022-11-21 16:16:11,433 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:16:12,274 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 59 proven. 22 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-21 16:16:12,287 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 16:16:12,783 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-21 16:16:12,783 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1629851025] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 16:16:12,784 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 16:16:12,784 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 8] total 17 [2022-11-21 16:16:12,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708926710] [2022-11-21 16:16:12,784 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 16:16:12,785 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-21 16:16:12,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:16:12,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-21 16:16:12,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2022-11-21 16:16:12,786 INFO L87 Difference]: Start difference. First operand 5294 states and 6901 transitions. Second operand has 17 states, 17 states have (on average 13.529411764705882) internal successors, (230), 17 states have internal predecessors, (230), 7 states have call successors, (32), 5 states have call predecessors, (32), 5 states have return successors, (31), 7 states have call predecessors, (31), 7 states have call successors, (31) [2022-11-21 16:16:21,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:16:21,548 INFO L93 Difference]: Finished difference Result 20989 states and 29229 transitions. [2022-11-21 16:16:21,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2022-11-21 16:16:21,549 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 13.529411764705882) internal successors, (230), 17 states have internal predecessors, (230), 7 states have call successors, (32), 5 states have call predecessors, (32), 5 states have return successors, (31), 7 states have call predecessors, (31), 7 states have call successors, (31) Word has length 167 [2022-11-21 16:16:21,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:16:21,599 INFO L225 Difference]: With dead ends: 20989 [2022-11-21 16:16:21,599 INFO L226 Difference]: Without dead ends: 15948 [2022-11-21 16:16:21,611 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 444 GetRequests, 362 SyntacticMatches, 2 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2426 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1304, Invalid=5338, Unknown=0, NotChecked=0, Total=6642 [2022-11-21 16:16:21,611 INFO L413 NwaCegarLoop]: 595 mSDtfsCounter, 2508 mSDsluCounter, 2298 mSDsCounter, 0 mSdLazyCounter, 2583 mSolverCounterSat, 1286 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2508 SdHoareTripleChecker+Valid, 2893 SdHoareTripleChecker+Invalid, 3869 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1286 IncrementalHoareTripleChecker+Valid, 2583 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-11-21 16:16:21,611 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2508 Valid, 2893 Invalid, 3869 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1286 Valid, 2583 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2022-11-21 16:16:21,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15948 states. [2022-11-21 16:16:23,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15948 to 9196. [2022-11-21 16:16:23,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9196 states, 6903 states have (on average 1.3069679849340867) internal successors, (9022), 6957 states have internal predecessors, (9022), 1469 states have call successors, (1469), 823 states have call predecessors, (1469), 823 states have return successors, (1469), 1415 states have call predecessors, (1469), 1469 states have call successors, (1469) [2022-11-21 16:16:23,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9196 states to 9196 states and 11960 transitions. [2022-11-21 16:16:23,722 INFO L78 Accepts]: Start accepts. Automaton has 9196 states and 11960 transitions. Word has length 167 [2022-11-21 16:16:23,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:16:23,723 INFO L495 AbstractCegarLoop]: Abstraction has 9196 states and 11960 transitions. [2022-11-21 16:16:23,723 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 13.529411764705882) internal successors, (230), 17 states have internal predecessors, (230), 7 states have call successors, (32), 5 states have call predecessors, (32), 5 states have return successors, (31), 7 states have call predecessors, (31), 7 states have call successors, (31) [2022-11-21 16:16:23,723 INFO L276 IsEmpty]: Start isEmpty. Operand 9196 states and 11960 transitions. [2022-11-21 16:16:23,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2022-11-21 16:16:23,735 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:16:23,735 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-21 16:16:23,743 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45a6a48e-927b-43c1-a242-2685973c4754/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-11-21 16:16:23,941 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45a6a48e-927b-43c1-a242-2685973c4754/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2022-11-21 16:16:23,941 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:16:23,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:16:23,941 INFO L85 PathProgramCache]: Analyzing trace with hash 926865534, now seen corresponding path program 1 times [2022-11-21 16:16:23,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:16:23,942 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955612894] [2022-11-21 16:16:23,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:16:23,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:16:24,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:16:25,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-21 16:16:25,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:16:25,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-21 16:16:25,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:16:25,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-11-21 16:16:25,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:16:25,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-11-21 16:16:25,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:16:25,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-11-21 16:16:25,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:16:25,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-11-21 16:16:25,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:16:25,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-11-21 16:16:25,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:16:25,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-11-21 16:16:25,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:16:25,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-11-21 16:16:25,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:16:25,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-11-21 16:16:25,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:16:25,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-11-21 16:16:25,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:16:25,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-11-21 16:16:25,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:16:25,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-11-21 16:16:25,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:16:25,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-11-21 16:16:25,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:16:25,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2022-11-21 16:16:25,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:16:25,365 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 25 proven. 5 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2022-11-21 16:16:25,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:16:25,366 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955612894] [2022-11-21 16:16:25,366 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1955612894] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 16:16:25,366 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [413125974] [2022-11-21 16:16:25,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:16:25,367 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:16:25,367 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45a6a48e-927b-43c1-a242-2685973c4754/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:16:25,368 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45a6a48e-927b-43c1-a242-2685973c4754/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 16:16:25,376 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45a6a48e-927b-43c1-a242-2685973c4754/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-21 16:16:25,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:16:25,588 INFO L263 TraceCheckSpWp]: Trace formula consists of 754 conjuncts, 44 conjunts are in the unsatisfiable core [2022-11-21 16:16:25,595 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:16:26,824 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 73 proven. 9 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-21 16:16:26,825 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 16:16:28,076 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 15 proven. 15 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2022-11-21 16:16:28,076 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [413125974] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 16:16:28,076 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 16:16:28,077 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 12] total 27 [2022-11-21 16:16:28,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339599492] [2022-11-21 16:16:28,077 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 16:16:28,078 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-11-21 16:16:28,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:16:28,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-11-21 16:16:28,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=580, Unknown=0, NotChecked=0, Total=702 [2022-11-21 16:16:28,079 INFO L87 Difference]: Start difference. First operand 9196 states and 11960 transitions. Second operand has 27 states, 27 states have (on average 9.62962962962963) internal successors, (260), 27 states have internal predecessors, (260), 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-21 16:17:19,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:17:19,118 INFO L93 Difference]: Finished difference Result 29957 states and 41919 transitions. [2022-11-21 16:17:19,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 238 states. [2022-11-21 16:17:19,119 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 9.62962962962963) internal successors, (260), 27 states have internal predecessors, (260), 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 167 [2022-11-21 16:17:19,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:17:19,194 INFO L225 Difference]: With dead ends: 29957 [2022-11-21 16:17:19,194 INFO L226 Difference]: Without dead ends: 21025 [2022-11-21 16:17:19,222 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 610 GetRequests, 353 SyntacticMatches, 2 SemanticMatches, 255 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28943 ImplicationChecksByTransitivity, 34.5s TimeCoverageRelationStatistics Valid=8691, Invalid=57101, Unknown=0, NotChecked=0, Total=65792 [2022-11-21 16:17:19,223 INFO L413 NwaCegarLoop]: 537 mSDtfsCounter, 8847 mSDsluCounter, 4597 mSDsCounter, 0 mSdLazyCounter, 8207 mSolverCounterSat, 4317 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8848 SdHoareTripleChecker+Valid, 5134 SdHoareTripleChecker+Invalid, 12524 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 4317 IncrementalHoareTripleChecker+Valid, 8207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.0s IncrementalHoareTripleChecker+Time [2022-11-21 16:17:19,223 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8848 Valid, 5134 Invalid, 12524 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [4317 Valid, 8207 Invalid, 0 Unknown, 0 Unchecked, 9.0s Time] [2022-11-21 16:17:19,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21025 states. [2022-11-21 16:17:21,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21025 to 9240. [2022-11-21 16:17:21,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9240 states, 6937 states have (on average 1.305463456825717) internal successors, (9056), 6991 states have internal predecessors, (9056), 1474 states have call successors, (1474), 828 states have call predecessors, (1474), 828 states have return successors, (1474), 1420 states have call predecessors, (1474), 1474 states have call successors, (1474) [2022-11-21 16:17:21,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9240 states to 9240 states and 12004 transitions. [2022-11-21 16:17:21,763 INFO L78 Accepts]: Start accepts. Automaton has 9240 states and 12004 transitions. Word has length 167 [2022-11-21 16:17:21,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:17:21,764 INFO L495 AbstractCegarLoop]: Abstraction has 9240 states and 12004 transitions. [2022-11-21 16:17:21,764 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 9.62962962962963) internal successors, (260), 27 states have internal predecessors, (260), 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-21 16:17:21,764 INFO L276 IsEmpty]: Start isEmpty. Operand 9240 states and 12004 transitions. [2022-11-21 16:17:21,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2022-11-21 16:17:21,771 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:17:21,771 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:17:21,777 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45a6a48e-927b-43c1-a242-2685973c4754/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-21 16:17:21,978 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45a6a48e-927b-43c1-a242-2685973c4754/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2022-11-21 16:17:21,979 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:17:21,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:17:21,979 INFO L85 PathProgramCache]: Analyzing trace with hash -1308252018, now seen corresponding path program 1 times [2022-11-21 16:17:21,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:17:21,980 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393390103] [2022-11-21 16:17:21,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:17:21,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:17:22,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:17:22,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-21 16:17:22,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:17:22,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-21 16:17:22,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:17:22,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-21 16:17:22,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:17:22,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-11-21 16:17:22,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:17:22,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-11-21 16:17:22,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:17:22,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-11-21 16:17:22,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:17:22,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-11-21 16:17:22,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:17:22,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-11-21 16:17:22,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:17:22,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-11-21 16:17:22,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:17:22,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-11-21 16:17:22,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:17:22,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-11-21 16:17:22,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:17:22,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-11-21 16:17:22,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:17:22,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-11-21 16:17:22,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:17:22,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-11-21 16:17:22,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:17:22,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2022-11-21 16:17:22,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:17:22,246 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 14 proven. 31 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2022-11-21 16:17:22,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:17:22,247 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393390103] [2022-11-21 16:17:22,247 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393390103] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 16:17:22,247 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1810918174] [2022-11-21 16:17:22,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:17:22,247 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:17:22,248 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45a6a48e-927b-43c1-a242-2685973c4754/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:17:22,251 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45a6a48e-927b-43c1-a242-2685973c4754/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 16:17:22,274 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45a6a48e-927b-43c1-a242-2685973c4754/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-21 16:17:22,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:17:22,432 INFO L263 TraceCheckSpWp]: Trace formula consists of 756 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-21 16:17:22,435 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:17:22,678 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 8 proven. 90 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-11-21 16:17:22,678 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 16:17:22,886 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 14 proven. 31 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2022-11-21 16:17:22,886 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1810918174] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 16:17:22,886 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 16:17:22,887 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 10 [2022-11-21 16:17:22,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341736410] [2022-11-21 16:17:22,887 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 16:17:22,887 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-21 16:17:22,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:17:22,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-21 16:17:22,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-11-21 16:17:22,888 INFO L87 Difference]: Start difference. First operand 9240 states and 12004 transitions. Second operand has 10 states, 10 states have (on average 15.5) internal successors, (155), 9 states have internal predecessors, (155), 4 states have call successors, (32), 5 states have call predecessors, (32), 7 states have return successors, (31), 4 states have call predecessors, (31), 3 states have call successors, (31) [2022-11-21 16:17:27,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:17:27,682 INFO L93 Difference]: Finished difference Result 25835 states and 33833 transitions. [2022-11-21 16:17:27,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-21 16:17:27,682 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 15.5) internal successors, (155), 9 states have internal predecessors, (155), 4 states have call successors, (32), 5 states have call predecessors, (32), 7 states have return successors, (31), 4 states have call predecessors, (31), 3 states have call successors, (31) Word has length 169 [2022-11-21 16:17:27,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:17:27,729 INFO L225 Difference]: With dead ends: 25835 [2022-11-21 16:17:27,729 INFO L226 Difference]: Without dead ends: 16859 [2022-11-21 16:17:27,745 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 386 GetRequests, 363 SyntacticMatches, 5 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=299, Unknown=0, NotChecked=0, Total=380 [2022-11-21 16:17:27,745 INFO L413 NwaCegarLoop]: 350 mSDtfsCounter, 516 mSDsluCounter, 1924 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 521 SdHoareTripleChecker+Valid, 2274 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-21 16:17:27,746 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [521 Valid, 2274 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-21 16:17:27,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16859 states. [2022-11-21 16:17:30,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16859 to 11808. [2022-11-21 16:17:30,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11808 states, 8933 states have (on average 1.292287025635285) internal successors, (11544), 9003 states have internal predecessors, (11544), 1811 states have call successors, (1811), 1063 states have call predecessors, (1811), 1063 states have return successors, (1811), 1741 states have call predecessors, (1811), 1811 states have call successors, (1811) [2022-11-21 16:17:30,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11808 states to 11808 states and 15166 transitions. [2022-11-21 16:17:30,802 INFO L78 Accepts]: Start accepts. Automaton has 11808 states and 15166 transitions. Word has length 169 [2022-11-21 16:17:30,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:17:30,802 INFO L495 AbstractCegarLoop]: Abstraction has 11808 states and 15166 transitions. [2022-11-21 16:17:30,802 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 15.5) internal successors, (155), 9 states have internal predecessors, (155), 4 states have call successors, (32), 5 states have call predecessors, (32), 7 states have return successors, (31), 4 states have call predecessors, (31), 3 states have call successors, (31) [2022-11-21 16:17:30,803 INFO L276 IsEmpty]: Start isEmpty. Operand 11808 states and 15166 transitions. [2022-11-21 16:17:30,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2022-11-21 16:17:30,809 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:17:30,809 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:17:30,815 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45a6a48e-927b-43c1-a242-2685973c4754/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-21 16:17:31,015 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45a6a48e-927b-43c1-a242-2685973c4754/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:17:31,015 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:17:31,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:17:31,016 INFO L85 PathProgramCache]: Analyzing trace with hash 494131333, now seen corresponding path program 1 times [2022-11-21 16:17:31,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:17:31,016 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863879638] [2022-11-21 16:17:31,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:17:31,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:17:31,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:17:31,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-21 16:17:31,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:17:31,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-21 16:17:31,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:17:31,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-21 16:17:31,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:17:31,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-11-21 16:17:31,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:17:31,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-11-21 16:17:31,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:17:31,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-11-21 16:17:31,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:17:31,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-11-21 16:17:31,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:17:31,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-11-21 16:17:31,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:17:31,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-11-21 16:17:31,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:17:31,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-11-21 16:17:31,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:17:31,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-11-21 16:17:31,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:17:31,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-11-21 16:17:31,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:17:31,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-11-21 16:17:31,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:17:31,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-11-21 16:17:31,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:17:31,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2022-11-21 16:17:31,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:17:31,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2022-11-21 16:17:31,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:17:31,232 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-11-21 16:17:31,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:17:31,233 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863879638] [2022-11-21 16:17:31,233 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1863879638] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:17:31,233 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:17:31,233 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-21 16:17:31,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698620422] [2022-11-21 16:17:31,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:17:31,235 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-21 16:17:31,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:17:31,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-21 16:17:31,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-21 16:17:31,240 INFO L87 Difference]: Start difference. First operand 11808 states and 15166 transitions. Second operand has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 6 states have internal predecessors, (94), 3 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) [2022-11-21 16:17:38,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:17:38,456 INFO L93 Difference]: Finished difference Result 33688 states and 44610 transitions. [2022-11-21 16:17:38,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-21 16:17:38,456 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 6 states have internal predecessors, (94), 3 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) Word has length 171 [2022-11-21 16:17:38,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:17:38,525 INFO L225 Difference]: With dead ends: 33688 [2022-11-21 16:17:38,526 INFO L226 Difference]: Without dead ends: 24670 [2022-11-21 16:17:38,543 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2022-11-21 16:17:38,543 INFO L413 NwaCegarLoop]: 495 mSDtfsCounter, 504 mSDsluCounter, 2050 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 519 SdHoareTripleChecker+Valid, 2545 SdHoareTripleChecker+Invalid, 355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-21 16:17:38,544 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [519 Valid, 2545 Invalid, 355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 265 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-21 16:17:38,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24670 states. [2022-11-21 16:17:42,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24670 to 17376. [2022-11-21 16:17:42,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17376 states, 12966 states have (on average 1.283047971618078) internal successors, (16636), 13085 states have internal predecessors, (16636), 2809 states have call successors, (2809), 1600 states have call predecessors, (2809), 1600 states have return successors, (2809), 2690 states have call predecessors, (2809), 2809 states have call successors, (2809) [2022-11-21 16:17:42,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17376 states to 17376 states and 22254 transitions. [2022-11-21 16:17:42,708 INFO L78 Accepts]: Start accepts. Automaton has 17376 states and 22254 transitions. Word has length 171 [2022-11-21 16:17:42,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:17:42,709 INFO L495 AbstractCegarLoop]: Abstraction has 17376 states and 22254 transitions. [2022-11-21 16:17:42,709 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 6 states have internal predecessors, (94), 3 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) [2022-11-21 16:17:42,709 INFO L276 IsEmpty]: Start isEmpty. Operand 17376 states and 22254 transitions. [2022-11-21 16:17:42,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2022-11-21 16:17:42,718 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:17:42,718 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:17:42,718 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-11-21 16:17:42,719 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:17:42,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:17:42,719 INFO L85 PathProgramCache]: Analyzing trace with hash -2126458504, now seen corresponding path program 1 times [2022-11-21 16:17:42,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:17:42,719 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864022405] [2022-11-21 16:17:42,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:17:42,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:17:42,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:17:43,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-21 16:17:43,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:17:43,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-21 16:17:43,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:17:43,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-21 16:17:43,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:17:43,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-11-21 16:17:43,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:17:43,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-11-21 16:17:43,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:17:43,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-11-21 16:17:43,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:17:43,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-11-21 16:17:43,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:17:43,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-11-21 16:17:43,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:17:43,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-11-21 16:17:43,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:17:43,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-11-21 16:17:43,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:17:43,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-11-21 16:17:43,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:17:43,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-11-21 16:17:43,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:17:43,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2022-11-21 16:17:43,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:17:43,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-11-21 16:17:43,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:17:43,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-11-21 16:17:43,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:17:43,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2022-11-21 16:17:43,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:17:43,360 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 30 proven. 6 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2022-11-21 16:17:43,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:17:43,361 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864022405] [2022-11-21 16:17:43,361 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1864022405] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 16:17:43,361 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [908483255] [2022-11-21 16:17:43,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:17:43,361 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:17:43,362 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45a6a48e-927b-43c1-a242-2685973c4754/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:17:43,363 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45a6a48e-927b-43c1-a242-2685973c4754/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 16:17:43,382 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45a6a48e-927b-43c1-a242-2685973c4754/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-21 16:17:43,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:17:43,555 INFO L263 TraceCheckSpWp]: Trace formula consists of 770 conjuncts, 19 conjunts are in the unsatisfiable core [2022-11-21 16:17:43,559 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:17:43,860 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 72 proven. 26 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-11-21 16:17:43,861 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 16:17:44,132 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 22 proven. 14 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2022-11-21 16:17:44,132 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [908483255] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 16:17:44,132 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 16:17:44,133 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 7] total 19 [2022-11-21 16:17:44,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907282046] [2022-11-21 16:17:44,133 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 16:17:44,133 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-11-21 16:17:44,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:17:44,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-11-21 16:17:44,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2022-11-21 16:17:44,134 INFO L87 Difference]: Start difference. First operand 17376 states and 22254 transitions. Second operand has 19 states, 19 states have (on average 12.526315789473685) internal successors, (238), 19 states have internal predecessors, (238), 8 states have call successors, (43), 5 states have call predecessors, (43), 6 states have return successors, (42), 8 states have call predecessors, (42), 8 states have call successors, (42) [2022-11-21 16:17:58,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:17:58,935 INFO L93 Difference]: Finished difference Result 40839 states and 53636 transitions. [2022-11-21 16:17:58,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2022-11-21 16:17:58,936 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 12.526315789473685) internal successors, (238), 19 states have internal predecessors, (238), 8 states have call successors, (43), 5 states have call predecessors, (43), 6 states have return successors, (42), 8 states have call predecessors, (42), 8 states have call successors, (42) Word has length 172 [2022-11-21 16:17:58,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:17:59,000 INFO L225 Difference]: With dead ends: 40839 [2022-11-21 16:17:59,000 INFO L226 Difference]: Without dead ends: 24831 [2022-11-21 16:17:59,021 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 450 GetRequests, 379 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1395 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=890, Invalid=4366, Unknown=0, NotChecked=0, Total=5256 [2022-11-21 16:17:59,022 INFO L413 NwaCegarLoop]: 864 mSDtfsCounter, 2513 mSDsluCounter, 6595 mSDsCounter, 0 mSdLazyCounter, 6101 mSolverCounterSat, 2096 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2513 SdHoareTripleChecker+Valid, 7459 SdHoareTripleChecker+Invalid, 8197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 2096 IncrementalHoareTripleChecker+Valid, 6101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2022-11-21 16:17:59,022 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2513 Valid, 7459 Invalid, 8197 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [2096 Valid, 6101 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2022-11-21 16:17:59,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24831 states. [2022-11-21 16:18:03,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24831 to 16666. [2022-11-21 16:18:03,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16666 states, 12385 states have (on average 1.2811465482438433) internal successors, (15867), 12498 states have internal predecessors, (15867), 2734 states have call successors, (2734), 1546 states have call predecessors, (2734), 1546 states have return successors, (2734), 2621 states have call predecessors, (2734), 2734 states have call successors, (2734) [2022-11-21 16:18:03,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16666 states to 16666 states and 21335 transitions. [2022-11-21 16:18:03,588 INFO L78 Accepts]: Start accepts. Automaton has 16666 states and 21335 transitions. Word has length 172 [2022-11-21 16:18:03,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:18:03,589 INFO L495 AbstractCegarLoop]: Abstraction has 16666 states and 21335 transitions. [2022-11-21 16:18:03,589 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 12.526315789473685) internal successors, (238), 19 states have internal predecessors, (238), 8 states have call successors, (43), 5 states have call predecessors, (43), 6 states have return successors, (42), 8 states have call predecessors, (42), 8 states have call successors, (42) [2022-11-21 16:18:03,589 INFO L276 IsEmpty]: Start isEmpty. Operand 16666 states and 21335 transitions. [2022-11-21 16:18:03,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2022-11-21 16:18:03,595 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:18:03,595 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-11-21 16:18:03,602 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45a6a48e-927b-43c1-a242-2685973c4754/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-21 16:18:03,802 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45a6a48e-927b-43c1-a242-2685973c4754/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2022-11-21 16:18:03,803 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:18:03,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:18:03,803 INFO L85 PathProgramCache]: Analyzing trace with hash -1658950161, now seen corresponding path program 1 times [2022-11-21 16:18:03,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:18:03,803 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219230639] [2022-11-21 16:18:03,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:18:03,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:18:03,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:18:04,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-21 16:18:04,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:18:04,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-21 16:18:04,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:18:04,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-11-21 16:18:04,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:18:04,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-11-21 16:18:04,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:18:04,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-11-21 16:18:04,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:18:04,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-11-21 16:18:04,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:18:04,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-11-21 16:18:04,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:18:04,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-11-21 16:18:04,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:18:04,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-11-21 16:18:04,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:18:04,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-11-21 16:18:04,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:18:04,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-11-21 16:18:04,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:18:04,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-11-21 16:18:04,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:18:04,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-11-21 16:18:04,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:18:04,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2022-11-21 16:18:04,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:18:04,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-11-21 16:18:04,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:18:04,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2022-11-21 16:18:04,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:18:04,628 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 29 proven. 11 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2022-11-21 16:18:04,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:18:04,629 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219230639] [2022-11-21 16:18:04,629 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [219230639] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 16:18:04,629 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2135358508] [2022-11-21 16:18:04,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:18:04,629 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:18:04,630 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45a6a48e-927b-43c1-a242-2685973c4754/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:18:04,631 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45a6a48e-927b-43c1-a242-2685973c4754/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 16:18:04,634 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45a6a48e-927b-43c1-a242-2685973c4754/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-21 16:18:04,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:18:04,843 INFO L263 TraceCheckSpWp]: Trace formula consists of 776 conjuncts, 16 conjunts are in the unsatisfiable core [2022-11-21 16:18:04,847 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:18:05,154 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 53 proven. 54 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-21 16:18:05,154 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 16:18:05,399 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 17 proven. 29 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2022-11-21 16:18:05,400 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2135358508] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 16:18:05,400 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 16:18:05,400 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 8] total 19 [2022-11-21 16:18:05,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441450991] [2022-11-21 16:18:05,400 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 16:18:05,401 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-11-21 16:18:05,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:18:05,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-11-21 16:18:05,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2022-11-21 16:18:05,402 INFO L87 Difference]: Start difference. First operand 16666 states and 21335 transitions. Second operand has 19 states, 19 states have (on average 12.631578947368421) internal successors, (240), 18 states have internal predecessors, (240), 8 states have call successors, (45), 4 states have call predecessors, (45), 6 states have return successors, (44), 9 states have call predecessors, (44), 8 states have call successors, (44) [2022-11-21 16:18:30,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:18:30,273 INFO L93 Difference]: Finished difference Result 41404 states and 55188 transitions. [2022-11-21 16:18:30,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 144 states. [2022-11-21 16:18:30,273 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 12.631578947368421) internal successors, (240), 18 states have internal predecessors, (240), 8 states have call successors, (45), 4 states have call predecessors, (45), 6 states have return successors, (44), 9 states have call predecessors, (44), 8 states have call successors, (44) Word has length 177 [2022-11-21 16:18:30,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:18:30,346 INFO L225 Difference]: With dead ends: 41404 [2022-11-21 16:18:30,346 INFO L226 Difference]: Without dead ends: 26656 [2022-11-21 16:18:30,369 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 569 GetRequests, 410 SyntacticMatches, 1 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9629 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=3419, Invalid=22021, Unknown=0, NotChecked=0, Total=25440 [2022-11-21 16:18:30,369 INFO L413 NwaCegarLoop]: 1301 mSDtfsCounter, 3629 mSDsluCounter, 8552 mSDsCounter, 0 mSdLazyCounter, 7813 mSolverCounterSat, 3680 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3629 SdHoareTripleChecker+Valid, 9853 SdHoareTripleChecker+Invalid, 11493 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 3680 IncrementalHoareTripleChecker+Valid, 7813 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.2s IncrementalHoareTripleChecker+Time [2022-11-21 16:18:30,370 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3629 Valid, 9853 Invalid, 11493 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [3680 Valid, 7813 Invalid, 0 Unknown, 0 Unchecked, 7.2s Time] [2022-11-21 16:18:30,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26656 states. [2022-11-21 16:18:35,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26656 to 16680. [2022-11-21 16:18:35,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16680 states, 12399 states have (on average 1.275586740866199) internal successors, (15816), 12512 states have internal predecessors, (15816), 2734 states have call successors, (2734), 1546 states have call predecessors, (2734), 1546 states have return successors, (2734), 2621 states have call predecessors, (2734), 2734 states have call successors, (2734) [2022-11-21 16:18:35,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16680 states to 16680 states and 21284 transitions. [2022-11-21 16:18:35,099 INFO L78 Accepts]: Start accepts. Automaton has 16680 states and 21284 transitions. Word has length 177 [2022-11-21 16:18:35,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:18:35,100 INFO L495 AbstractCegarLoop]: Abstraction has 16680 states and 21284 transitions. [2022-11-21 16:18:35,100 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 12.631578947368421) internal successors, (240), 18 states have internal predecessors, (240), 8 states have call successors, (45), 4 states have call predecessors, (45), 6 states have return successors, (44), 9 states have call predecessors, (44), 8 states have call successors, (44) [2022-11-21 16:18:35,100 INFO L276 IsEmpty]: Start isEmpty. Operand 16680 states and 21284 transitions. [2022-11-21 16:18:35,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2022-11-21 16:18:35,105 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:18:35,106 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:18:35,117 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45a6a48e-927b-43c1-a242-2685973c4754/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-21 16:18:35,312 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45a6a48e-927b-43c1-a242-2685973c4754/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2022-11-21 16:18:35,312 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:18:35,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:18:35,313 INFO L85 PathProgramCache]: Analyzing trace with hash -1778707627, now seen corresponding path program 1 times [2022-11-21 16:18:35,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:18:35,313 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412576676] [2022-11-21 16:18:35,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:18:35,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:18:35,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:18:35,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-21 16:18:35,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:18:35,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-21 16:18:35,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:18:35,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-11-21 16:18:35,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:18:35,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-11-21 16:18:35,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:18:35,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-11-21 16:18:35,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:18:35,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-11-21 16:18:35,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:18:35,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-11-21 16:18:35,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:18:35,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-11-21 16:18:35,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:18:35,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-11-21 16:18:35,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:18:35,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-11-21 16:18:35,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:18:35,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-11-21 16:18:35,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:18:35,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-11-21 16:18:35,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:18:35,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-11-21 16:18:35,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:18:35,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2022-11-21 16:18:35,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:18:35,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-11-21 16:18:35,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:18:35,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2022-11-21 16:18:35,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:18:35,682 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2022-11-21 16:18:35,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:18:35,683 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412576676] [2022-11-21 16:18:35,683 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [412576676] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:18:35,683 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:18:35,683 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-21 16:18:35,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444539849] [2022-11-21 16:18:35,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:18:35,684 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-21 16:18:35,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:18:35,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-21 16:18:35,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-21 16:18:35,685 INFO L87 Difference]: Start difference. First operand 16680 states and 21284 transitions. Second operand has 7 states, 7 states have (on average 15.714285714285714) internal successors, (110), 6 states have internal predecessors, (110), 3 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) [2022-11-21 16:18:42,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:18:42,792 INFO L93 Difference]: Finished difference Result 35084 states and 46017 transitions. [2022-11-21 16:18:42,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-21 16:18:42,792 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.714285714285714) internal successors, (110), 6 states have internal predecessors, (110), 3 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) Word has length 178 [2022-11-21 16:18:42,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:18:42,857 INFO L225 Difference]: With dead ends: 35084 [2022-11-21 16:18:42,857 INFO L226 Difference]: Without dead ends: 20714 [2022-11-21 16:18:42,880 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 39 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-21 16:18:42,881 INFO L413 NwaCegarLoop]: 499 mSDtfsCounter, 601 mSDsluCounter, 1586 mSDsCounter, 0 mSdLazyCounter, 369 mSolverCounterSat, 175 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 604 SdHoareTripleChecker+Valid, 2085 SdHoareTripleChecker+Invalid, 544 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 175 IncrementalHoareTripleChecker+Valid, 369 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-21 16:18:42,881 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [604 Valid, 2085 Invalid, 544 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [175 Valid, 369 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-21 16:18:42,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20714 states. [2022-11-21 16:18:47,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20714 to 16670. [2022-11-21 16:18:47,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16670 states, 12389 states have (on average 1.2741948502704012) internal successors, (15786), 12502 states have internal predecessors, (15786), 2734 states have call successors, (2734), 1546 states have call predecessors, (2734), 1546 states have return successors, (2734), 2621 states have call predecessors, (2734), 2734 states have call successors, (2734) [2022-11-21 16:18:47,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16670 states to 16670 states and 21254 transitions. [2022-11-21 16:18:47,594 INFO L78 Accepts]: Start accepts. Automaton has 16670 states and 21254 transitions. Word has length 178 [2022-11-21 16:18:47,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:18:47,594 INFO L495 AbstractCegarLoop]: Abstraction has 16670 states and 21254 transitions. [2022-11-21 16:18:47,594 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.714285714285714) internal successors, (110), 6 states have internal predecessors, (110), 3 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) [2022-11-21 16:18:47,594 INFO L276 IsEmpty]: Start isEmpty. Operand 16670 states and 21254 transitions. [2022-11-21 16:18:47,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2022-11-21 16:18:47,598 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:18:47,598 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:18:47,598 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2022-11-21 16:18:47,598 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:18:47,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:18:47,599 INFO L85 PathProgramCache]: Analyzing trace with hash 2012173287, now seen corresponding path program 1 times [2022-11-21 16:18:47,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:18:47,599 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857954497] [2022-11-21 16:18:47,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:18:47,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:18:47,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:18:48,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-21 16:18:48,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:18:48,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-21 16:18:48,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:18:48,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-21 16:18:48,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:18:48,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-11-21 16:18:48,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:18:48,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-11-21 16:18:48,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:18:48,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-11-21 16:18:48,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:18:48,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-11-21 16:18:48,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:18:48,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-11-21 16:18:48,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:18:48,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-11-21 16:18:48,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:18:48,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-11-21 16:18:48,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:18:48,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-11-21 16:18:48,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:18:48,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-11-21 16:18:48,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:18:48,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-11-21 16:18:48,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:18:48,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-11-21 16:18:48,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:18:48,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2022-11-21 16:18:48,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:18:48,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2022-11-21 16:18:48,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:18:48,190 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 20 proven. 6 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2022-11-21 16:18:48,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:18:48,192 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857954497] [2022-11-21 16:18:48,192 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1857954497] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 16:18:48,192 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1512802497] [2022-11-21 16:18:48,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:18:48,192 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:18:48,192 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45a6a48e-927b-43c1-a242-2685973c4754/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:18:48,193 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45a6a48e-927b-43c1-a242-2685973c4754/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 16:18:48,216 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45a6a48e-927b-43c1-a242-2685973c4754/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-21 16:18:48,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:18:48,387 INFO L263 TraceCheckSpWp]: Trace formula consists of 794 conjuncts, 16 conjunts are in the unsatisfiable core [2022-11-21 16:18:48,392 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:18:48,683 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 28 proven. 54 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-11-21 16:18:48,683 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 16:18:48,926 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 14 proven. 16 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2022-11-21 16:18:48,926 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1512802497] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 16:18:48,927 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 16:18:48,927 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 16 [2022-11-21 16:18:48,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176530953] [2022-11-21 16:18:48,927 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 16:18:48,927 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-11-21 16:18:48,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:18:48,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-11-21 16:18:48,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2022-11-21 16:18:48,928 INFO L87 Difference]: Start difference. First operand 16670 states and 21254 transitions. Second operand has 16 states, 16 states have (on average 15.1875) internal successors, (243), 15 states have internal predecessors, (243), 7 states have call successors, (47), 4 states have call predecessors, (47), 6 states have return successors, (46), 8 states have call predecessors, (46), 7 states have call successors, (46) [2022-11-21 16:19:15,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:19:15,827 INFO L93 Difference]: Finished difference Result 53755 states and 72813 transitions. [2022-11-21 16:19:15,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2022-11-21 16:19:15,828 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 15.1875) internal successors, (243), 15 states have internal predecessors, (243), 7 states have call successors, (47), 4 states have call predecessors, (47), 6 states have return successors, (46), 8 states have call predecessors, (46), 7 states have call successors, (46) Word has length 178 [2022-11-21 16:19:15,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:19:15,923 INFO L225 Difference]: With dead ends: 53755 [2022-11-21 16:19:15,924 INFO L226 Difference]: Without dead ends: 38292 [2022-11-21 16:19:15,946 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 579 GetRequests, 460 SyntacticMatches, 1 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5057 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=1944, Invalid=12336, Unknown=0, NotChecked=0, Total=14280 [2022-11-21 16:19:15,947 INFO L413 NwaCegarLoop]: 1229 mSDtfsCounter, 3146 mSDsluCounter, 8118 mSDsCounter, 0 mSdLazyCounter, 8745 mSolverCounterSat, 3125 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3146 SdHoareTripleChecker+Valid, 9347 SdHoareTripleChecker+Invalid, 11870 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 3125 IncrementalHoareTripleChecker+Valid, 8745 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.9s IncrementalHoareTripleChecker+Time [2022-11-21 16:19:15,947 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3146 Valid, 9347 Invalid, 11870 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [3125 Valid, 8745 Invalid, 0 Unknown, 0 Unchecked, 7.9s Time] [2022-11-21 16:19:15,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38292 states. [2022-11-21 16:19:22,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38292 to 20911. [2022-11-21 16:19:22,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20911 states, 15496 states have (on average 1.2762648425400103) internal successors, (19777), 15646 states have internal predecessors, (19777), 3464 states have call successors, (3464), 1950 states have call predecessors, (3464), 1950 states have return successors, (3464), 3314 states have call predecessors, (3464), 3464 states have call successors, (3464) [2022-11-21 16:19:22,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20911 states to 20911 states and 26705 transitions. [2022-11-21 16:19:22,415 INFO L78 Accepts]: Start accepts. Automaton has 20911 states and 26705 transitions. Word has length 178 [2022-11-21 16:19:22,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:19:22,415 INFO L495 AbstractCegarLoop]: Abstraction has 20911 states and 26705 transitions. [2022-11-21 16:19:22,415 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 15.1875) internal successors, (243), 15 states have internal predecessors, (243), 7 states have call successors, (47), 4 states have call predecessors, (47), 6 states have return successors, (46), 8 states have call predecessors, (46), 7 states have call successors, (46) [2022-11-21 16:19:22,415 INFO L276 IsEmpty]: Start isEmpty. Operand 20911 states and 26705 transitions. [2022-11-21 16:19:22,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2022-11-21 16:19:22,419 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:19:22,419 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-21 16:19:22,425 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45a6a48e-927b-43c1-a242-2685973c4754/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-21 16:19:22,620 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45a6a48e-927b-43c1-a242-2685973c4754/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2022-11-21 16:19:22,620 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:19:22,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:19:22,620 INFO L85 PathProgramCache]: Analyzing trace with hash -1051233495, now seen corresponding path program 1 times [2022-11-21 16:19:22,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:19:22,620 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940106744] [2022-11-21 16:19:22,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:19:22,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:19:22,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:19:22,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-21 16:19:22,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:19:22,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-21 16:19:22,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:19:22,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-11-21 16:19:22,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:19:22,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-11-21 16:19:22,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:19:22,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-11-21 16:19:22,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:19:22,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-11-21 16:19:22,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:19:22,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-11-21 16:19:22,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:19:22,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-11-21 16:19:22,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:19:22,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-11-21 16:19:22,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:19:22,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-11-21 16:19:22,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:19:22,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-11-21 16:19:22,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:19:22,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-11-21 16:19:22,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:19:22,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-11-21 16:19:22,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:19:22,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2022-11-21 16:19:22,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:19:22,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2022-11-21 16:19:22,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:19:22,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2022-11-21 16:19:22,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:19:22,883 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 29 proven. 2 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2022-11-21 16:19:22,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:19:22,883 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940106744] [2022-11-21 16:19:22,883 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1940106744] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 16:19:22,883 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [928028829] [2022-11-21 16:19:22,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:19:22,884 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:19:22,884 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45a6a48e-927b-43c1-a242-2685973c4754/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:19:22,885 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45a6a48e-927b-43c1-a242-2685973c4754/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 16:19:22,896 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45a6a48e-927b-43c1-a242-2685973c4754/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-21 16:19:23,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:19:23,085 INFO L263 TraceCheckSpWp]: Trace formula consists of 779 conjuncts, 11 conjunts are in the unsatisfiable core [2022-11-21 16:19:23,089 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:19:23,304 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 52 proven. 4 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2022-11-21 16:19:23,304 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 16:19:23,518 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 29 proven. 2 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2022-11-21 16:19:23,519 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [928028829] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 16:19:23,519 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 16:19:23,519 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 9 [2022-11-21 16:19:23,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629927613] [2022-11-21 16:19:23,519 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 16:19:23,519 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-21 16:19:23,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:19:23,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-21 16:19:23,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-11-21 16:19:23,520 INFO L87 Difference]: Start difference. First operand 20911 states and 26705 transitions. Second operand has 9 states, 9 states have (on average 17.0) internal successors, (153), 8 states have internal predecessors, (153), 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-21 16:19:33,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:19:33,068 INFO L93 Difference]: Finished difference Result 48591 states and 63877 transitions. [2022-11-21 16:19:33,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-21 16:19:33,069 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 17.0) internal successors, (153), 8 states have internal predecessors, (153), 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 179 [2022-11-21 16:19:33,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:19:33,131 INFO L225 Difference]: With dead ends: 48591 [2022-11-21 16:19:33,131 INFO L226 Difference]: Without dead ends: 27860 [2022-11-21 16:19:33,152 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 399 GetRequests, 385 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-21 16:19:33,153 INFO L413 NwaCegarLoop]: 368 mSDtfsCounter, 220 mSDsluCounter, 1987 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 2355 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 16:19:33,153 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [245 Valid, 2355 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 16:19:33,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27860 states. [2022-11-21 16:19:39,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27860 to 20911. [2022-11-21 16:19:39,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20911 states, 15496 states have (on average 1.2760712441920496) internal successors, (19774), 15646 states have internal predecessors, (19774), 3464 states have call successors, (3464), 1950 states have call predecessors, (3464), 1950 states have return successors, (3464), 3314 states have call predecessors, (3464), 3464 states have call successors, (3464) [2022-11-21 16:19:39,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20911 states to 20911 states and 26702 transitions. [2022-11-21 16:19:39,492 INFO L78 Accepts]: Start accepts. Automaton has 20911 states and 26702 transitions. Word has length 179 [2022-11-21 16:19:39,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:19:39,492 INFO L495 AbstractCegarLoop]: Abstraction has 20911 states and 26702 transitions. [2022-11-21 16:19:39,492 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 17.0) internal successors, (153), 8 states have internal predecessors, (153), 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-21 16:19:39,493 INFO L276 IsEmpty]: Start isEmpty. Operand 20911 states and 26702 transitions. [2022-11-21 16:19:39,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2022-11-21 16:19:39,496 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:19:39,497 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:19:39,502 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45a6a48e-927b-43c1-a242-2685973c4754/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-21 16:19:39,697 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45a6a48e-927b-43c1-a242-2685973c4754/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2022-11-21 16:19:39,697 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:19:39,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:19:39,698 INFO L85 PathProgramCache]: Analyzing trace with hash -1307283623, now seen corresponding path program 1 times [2022-11-21 16:19:39,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:19:39,698 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450805183] [2022-11-21 16:19:39,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:19:39,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:19:39,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:19:39,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-21 16:19:39,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:19:39,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-21 16:19:39,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:19:39,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-11-21 16:19:39,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:19:39,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-11-21 16:19:39,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:19:39,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-11-21 16:19:39,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:19:39,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-11-21 16:19:39,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:19:39,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-11-21 16:19:39,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:19:39,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-11-21 16:19:39,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:19:39,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-11-21 16:19:39,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:19:39,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-11-21 16:19:39,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:19:39,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-11-21 16:19:39,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:19:39,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-11-21 16:19:39,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:19:39,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-11-21 16:19:39,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:19:39,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2022-11-21 16:19:39,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:19:39,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2022-11-21 16:19:39,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:19:39,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2022-11-21 16:19:39,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:19:39,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2022-11-21 16:19:39,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:19:39,971 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 29 proven. 6 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2022-11-21 16:19:39,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:19:39,971 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450805183] [2022-11-21 16:19:39,972 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [450805183] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 16:19:39,972 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1688416596] [2022-11-21 16:19:39,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:19:39,972 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:19:39,972 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45a6a48e-927b-43c1-a242-2685973c4754/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:19:39,973 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45a6a48e-927b-43c1-a242-2685973c4754/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 16:19:39,998 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45a6a48e-927b-43c1-a242-2685973c4754/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-21 16:19:40,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:19:40,175 INFO L263 TraceCheckSpWp]: Trace formula consists of 797 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-21 16:19:40,179 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:19:40,306 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 67 proven. 4 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2022-11-21 16:19:40,307 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 16:19:40,459 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 29 proven. 6 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2022-11-21 16:19:40,459 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1688416596] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 16:19:40,459 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 16:19:40,459 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 9 [2022-11-21 16:19:40,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449207199] [2022-11-21 16:19:40,460 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 16:19:40,460 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-21 16:19:40,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:19:40,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-21 16:19:40,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-11-21 16:19:40,461 INFO L87 Difference]: Start difference. First operand 20911 states and 26702 transitions. Second operand has 9 states, 9 states have (on average 17.666666666666668) internal successors, (159), 8 states have internal predecessors, (159), 3 states have call successors, (32), 4 states have call predecessors, (32), 7 states have return successors, (33), 4 states have call predecessors, (33), 3 states have call successors, (33) [2022-11-21 16:19:50,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:19:50,154 INFO L93 Difference]: Finished difference Result 48639 states and 63941 transitions. [2022-11-21 16:19:50,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-21 16:19:50,154 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 17.666666666666668) internal successors, (159), 8 states have internal predecessors, (159), 3 states have call successors, (32), 4 states have call predecessors, (32), 7 states have return successors, (33), 4 states have call predecessors, (33), 3 states have call successors, (33) Word has length 187 [2022-11-21 16:19:50,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:19:50,218 INFO L225 Difference]: With dead ends: 48639 [2022-11-21 16:19:50,218 INFO L226 Difference]: Without dead ends: 27908 [2022-11-21 16:19:50,239 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 417 GetRequests, 405 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-21 16:19:50,239 INFO L413 NwaCegarLoop]: 367 mSDtfsCounter, 214 mSDsluCounter, 1966 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 238 SdHoareTripleChecker+Valid, 2333 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 16:19:50,239 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [238 Valid, 2333 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 16:19:50,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27908 states. [2022-11-21 16:19:56,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27908 to 20911. [2022-11-21 16:19:56,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20911 states, 15496 states have (on average 1.2758776458440888) internal successors, (19771), 15646 states have internal predecessors, (19771), 3464 states have call successors, (3464), 1950 states have call predecessors, (3464), 1950 states have return successors, (3464), 3314 states have call predecessors, (3464), 3464 states have call successors, (3464) [2022-11-21 16:19:56,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20911 states to 20911 states and 26699 transitions. [2022-11-21 16:19:56,824 INFO L78 Accepts]: Start accepts. Automaton has 20911 states and 26699 transitions. Word has length 187 [2022-11-21 16:19:56,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:19:56,824 INFO L495 AbstractCegarLoop]: Abstraction has 20911 states and 26699 transitions. [2022-11-21 16:19:56,824 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 17.666666666666668) internal successors, (159), 8 states have internal predecessors, (159), 3 states have call successors, (32), 4 states have call predecessors, (32), 7 states have return successors, (33), 4 states have call predecessors, (33), 3 states have call successors, (33) [2022-11-21 16:19:56,825 INFO L276 IsEmpty]: Start isEmpty. Operand 20911 states and 26699 transitions. [2022-11-21 16:19:56,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2022-11-21 16:19:56,828 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:19:56,828 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:19:56,834 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45a6a48e-927b-43c1-a242-2685973c4754/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-11-21 16:19:57,029 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45a6a48e-927b-43c1-a242-2685973c4754/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:19:57,029 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:19:57,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:19:57,030 INFO L85 PathProgramCache]: Analyzing trace with hash -673539533, now seen corresponding path program 1 times [2022-11-21 16:19:57,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:19:57,030 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416539576] [2022-11-21 16:19:57,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:19:57,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:19:57,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 16:19:57,091 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-21 16:19:57,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 16:19:57,228 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-21 16:19:57,228 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-21 16:19:57,229 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-21 16:19:57,231 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2022-11-21 16:19:57,248 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, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:19:57,255 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-21 16:19:57,486 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.11 04:19:57 BoogieIcfgContainer [2022-11-21 16:19:57,487 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-21 16:19:57,487 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-21 16:19:57,487 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-21 16:19:57,488 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-21 16:19:57,494 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 04:15:12" (3/4) ... [2022-11-21 16:19:57,496 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-21 16:19:57,717 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45a6a48e-927b-43c1-a242-2685973c4754/bin/uautomizer-vX5HgA9Q3a/witness.graphml [2022-11-21 16:19:57,717 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-21 16:19:57,718 INFO L158 Benchmark]: Toolchain (without parser) took 286367.56ms. Allocated memory was 180.4MB in the beginning and 4.9GB in the end (delta: 4.7GB). Free memory was 147.6MB in the beginning and 2.9GB in the end (delta: -2.8GB). Peak memory consumption was 1.9GB. Max. memory is 16.1GB. [2022-11-21 16:19:57,718 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 180.4MB. Free memory is still 151.4MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-21 16:19:57,721 INFO L158 Benchmark]: CACSL2BoogieTranslator took 484.65ms. Allocated memory is still 180.4MB. Free memory was 147.0MB in the beginning and 129.6MB in the end (delta: 17.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-11-21 16:19:57,721 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.50ms. Allocated memory is still 180.4MB. Free memory was 129.6MB in the beginning and 126.6MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-21 16:19:57,721 INFO L158 Benchmark]: Boogie Preprocessor took 43.78ms. Allocated memory is still 180.4MB. Free memory was 126.6MB in the beginning and 123.3MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-21 16:19:57,722 INFO L158 Benchmark]: RCFGBuilder took 939.96ms. Allocated memory is still 180.4MB. Free memory was 123.3MB in the beginning and 91.6MB in the end (delta: 31.7MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2022-11-21 16:19:57,722 INFO L158 Benchmark]: TraceAbstraction took 284603.64ms. Allocated memory was 180.4MB in the beginning and 4.9GB in the end (delta: 4.7GB). Free memory was 90.9MB in the beginning and 3.0GB in the end (delta: -2.9GB). Peak memory consumption was 1.8GB. Max. memory is 16.1GB. [2022-11-21 16:19:57,722 INFO L158 Benchmark]: Witness Printer took 229.96ms. Allocated memory is still 4.9GB. Free memory was 3.0GB in the beginning and 2.9GB in the end (delta: 32.5MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2022-11-21 16:19:57,723 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.22ms. Allocated memory is still 180.4MB. Free memory is still 151.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 484.65ms. Allocated memory is still 180.4MB. Free memory was 147.0MB in the beginning and 129.6MB in the end (delta: 17.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 58.50ms. Allocated memory is still 180.4MB. Free memory was 129.6MB in the beginning and 126.6MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 43.78ms. Allocated memory is still 180.4MB. Free memory was 126.6MB in the beginning and 123.3MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 939.96ms. Allocated memory is still 180.4MB. Free memory was 123.3MB in the beginning and 91.6MB in the end (delta: 31.7MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * TraceAbstraction took 284603.64ms. Allocated memory was 180.4MB in the beginning and 4.9GB in the end (delta: 4.7GB). Free memory was 90.9MB in the beginning and 3.0GB in the end (delta: -2.9GB). Peak memory consumption was 1.8GB. Max. memory is 16.1GB. * Witness Printer took 229.96ms. Allocated memory is still 4.9GB. Free memory was 3.0GB in the beginning and 2.9GB in the end (delta: 32.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: 618]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L24] msg_t nomsg = (msg_t )-1; [L25] port_t cs1 ; [L26] int8_t cs1_old ; [L27] int8_t cs1_new ; [L28] port_t cs2 ; [L29] int8_t cs2_old ; [L30] int8_t cs2_new ; [L31] port_t s1s2 ; [L32] int8_t s1s2_old ; [L33] int8_t s1s2_new ; [L34] port_t s1s1 ; [L35] int8_t s1s1_old ; [L36] int8_t s1s1_new ; [L37] port_t s2s1 ; [L38] int8_t s2s1_old ; [L39] int8_t s2s1_new ; [L40] port_t s2s2 ; [L41] int8_t s2s2_old ; [L42] int8_t s2s2_new ; [L43] port_t s1p ; [L44] int8_t s1p_old ; [L45] int8_t s1p_new ; [L46] port_t s2p ; [L47] int8_t s2p_old ; [L48] int8_t s2p_new ; [L51] _Bool side1Failed ; [L52] _Bool side2Failed ; [L53] msg_t side1_written ; [L54] msg_t side2_written ; [L60] static _Bool side1Failed_History_0 ; [L61] static _Bool side1Failed_History_1 ; [L62] static _Bool side1Failed_History_2 ; [L63] static _Bool side2Failed_History_0 ; [L64] static _Bool side2Failed_History_1 ; [L65] static _Bool side2Failed_History_2 ; [L66] static int8_t active_side_History_0 ; [L67] static int8_t active_side_History_1 ; [L68] static int8_t active_side_History_2 ; [L69] static msg_t manual_selection_History_0 ; [L70] static msg_t manual_selection_History_1 ; [L71] static msg_t manual_selection_History_2 ; VAL [active_side_History_0=0, active_side_History_1=0, active_side_History_2=0, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L542] int c1 ; [L543] int i2 ; [L546] c1 = 0 [L547] side1Failed = __VERIFIER_nondet_bool() [L548] side2Failed = __VERIFIER_nondet_bool() [L549] side1_written = __VERIFIER_nondet_char() [L550] side2_written = __VERIFIER_nondet_char() [L551] side1Failed_History_0 = __VERIFIER_nondet_bool() [L552] side1Failed_History_1 = __VERIFIER_nondet_bool() [L553] side1Failed_History_2 = __VERIFIER_nondet_bool() [L554] side2Failed_History_0 = __VERIFIER_nondet_bool() [L555] side2Failed_History_1 = __VERIFIER_nondet_bool() [L556] side2Failed_History_2 = __VERIFIER_nondet_bool() [L557] active_side_History_0 = __VERIFIER_nondet_char() [L558] active_side_History_1 = __VERIFIER_nondet_char() [L559] active_side_History_2 = __VERIFIER_nondet_char() [L560] manual_selection_History_0 = __VERIFIER_nondet_char() [L561] manual_selection_History_1 = __VERIFIER_nondet_char() [L562] manual_selection_History_2 = __VERIFIER_nondet_char() [L563] CALL, EXPR init() [L197] COND FALSE !((int )side1Failed_History_0 != 0) VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=0, side1Failed_History_0=0, side2_written=0] [L200] COND FALSE !((int )side2Failed_History_0 != 0) VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=0, side1Failed_History_0=0, side2_written=0, side2Failed_History_0=0] [L203] COND FALSE !((int )active_side_History_0 != -2) VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=0, side1Failed_History_0=0, side2_written=0, side2Failed_History_0=0] [L206] COND FALSE !((int )manual_selection_History_0 != 0) VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=0, side1Failed_History_0=0, side2_written=0, side2Failed_History_0=0] [L209] COND FALSE !((int )side1Failed_History_1 != 0) VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=0, side1Failed_History_0=0, side1Failed_History_1=0, side2_written=0, side2Failed_History_0=0] [L212] COND FALSE !((int )side2Failed_History_1 != 0) VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=0, side1Failed_History_0=0, side1Failed_History_1=0, side2_written=0, side2Failed_History_0=0, side2Failed_History_1=0] [L215] COND FALSE !((int )active_side_History_1 != -2) VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=0, side1Failed_History_0=0, side1Failed_History_1=0, side2_written=0, side2Failed_History_0=0, side2Failed_History_1=0] [L218] COND FALSE !((int )manual_selection_History_1 != 0) VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=0, side1Failed_History_0=0, side1Failed_History_1=0, side2_written=0, side2Failed_History_0=0, side2Failed_History_1=0] [L221] COND FALSE !((int )side1Failed_History_2 != 0) VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed_History_0=0, side2Failed_History_1=0] [L224] COND FALSE !((int )side2Failed_History_2 != 0) VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L227] COND FALSE !((int )active_side_History_2 != -2) VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L230] COND FALSE !((int )manual_selection_History_2 != 0) [L233] return (1); VAL [\result=1, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L563] RET, EXPR init() [L563] i2 = init() [L564] CALL assume_abort_if_not(i2) VAL [\old(cond)=1, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L58] COND FALSE !(!cond) VAL [\old(cond)=1, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cond=1, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L564] RET assume_abort_if_not(i2) VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, c1=0, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, i2=1, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L565] cs1_old = nomsg [L566] cs1_new = nomsg [L567] cs2_old = nomsg [L568] cs2_new = nomsg [L569] s1s2_old = nomsg [L570] s1s2_new = nomsg [L571] s1s1_old = nomsg [L572] s1s1_new = nomsg [L573] s2s1_old = nomsg [L574] s2s1_new = nomsg [L575] s2s2_old = nomsg [L576] s2s2_new = nomsg [L577] s1p_old = nomsg [L578] s1p_new = nomsg [L579] s2p_old = nomsg [L580] s2p_new = nomsg [L581] i2 = 0 VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, c1=0, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, i2=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L582] COND TRUE 1 [L584] CALL Console_task_each_pals_period() [L251] msg_t manual_selection ; [L252] char tmp ; [L255] tmp = __VERIFIER_nondet_char() [L256] manual_selection = tmp [L257] CALL write_manual_selection_history(manual_selection) [L167] manual_selection_History_2 = manual_selection_History_1 [L168] manual_selection_History_1 = manual_selection_History_0 [L169] manual_selection_History_0 = val VAL [\old(val)=127, 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=127, 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=127] [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=127, cs1_old=-1, cs2=0, cs2_new=127, cs2_old=-1, manual_selection=0, manual_selection_History_0=127, 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=127] [L584] RET Console_task_each_pals_period() [L585] CALL Side1_activestandby_task_each_pals_period() [L266] int8_t side1 ; [L267] int8_t side2 ; [L268] msg_t manual_selection ; [L269] int8_t next_state ; [L272] side1 = nomsg [L273] side2 = nomsg [L274] manual_selection = (msg_t )0 [L275] side1Failed = __VERIFIER_nondet_bool() [L276] CALL write_side1_failed_history(side1Failed) [L77] side1Failed_History_2 = side1Failed_History_1 [L78] side1Failed_History_1 = side1Failed_History_0 [L79] side1Failed_History_0 = val VAL [\old(val)=-255, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=127, cs1_old=-1, cs2=0, cs2_new=127, cs2_old=-1, manual_selection_History_0=127, 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=127, cs1_old=-1, cs2=0, cs2_new=127, cs2_old=-1, manual_selection=0, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2=-1, side2_written=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L585] RET Side1_activestandby_task_each_pals_period() [L586] CALL Side2_activestandby_task_each_pals_period() [L323] int8_t side1 ; [L324] int8_t side2 ; [L325] msg_t manual_selection ; [L326] int8_t next_state ; [L329] side1 = nomsg [L330] side2 = nomsg [L331] manual_selection = (msg_t )0 [L332] side2Failed = __VERIFIER_nondet_bool() [L333] CALL write_side2_failed_history(side2Failed) [L107] side2Failed_History_2 = side2Failed_History_1 [L108] side2Failed_History_1 = side2Failed_History_0 [L109] side2Failed_History_0 = val VAL [\old(val)=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=127, cs1_old=-1, cs2=0, cs2_new=127, cs2_old=-1, manual_selection_History_0=127, 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=127, cs1_old=-1, cs2=0, cs2_new=127, cs2_old=-1, manual_selection=-1, manual_selection_History_0=127, 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=127, cs1_old=-1, cs2=0, cs2_new=127, cs2_old=-1, manual_selection=-1, manual_selection_History_0=127, 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=127, cs1_old=-1, cs2=0, cs2_new=127, cs2_old=-1, manual_selection=-1, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, next_state=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=0, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=-1, s2s2=0, s2s2_new=0, s2s2_old=-1, side1=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2=-1, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L586] RET Side2_activestandby_task_each_pals_period() [L587] CALL Pendulum_prism_task_each_pals_period() [L380] int8_t active_side ; [L381] int8_t tmp ; [L382] int8_t side1 ; [L383] int8_t side2 ; VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=127, cs1_old=-1, cs2=0, cs2_new=127, cs2_old=-1, manual_selection_History_0=127, 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=127, cs1_old=-1, cs2=0, cs2_new=127, cs2_old=-1, manual_selection_History_0=127, 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=127, cs1_old=-1, cs2=0, cs2_new=127, cs2_old=-1, index=0, manual_selection_History_0=127, 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=127, cs1_old=-1, cs2=0, cs2_new=127, cs2_old=-1, manual_selection_History_0=127, 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=127, cs1_old=-1, cs2=0, cs2_new=127, cs2_old=-1, manual_selection_History_0=127, 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=127, cs1_old=-1, cs2=0, cs2_new=127, cs2_old=-1, manual_selection_History_0=127, 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=127, cs1_old=-1, cs2=0, cs2_new=127, cs2_old=-1, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=0, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=-1, s2s2=0, s2s2_new=0, s2s2_old=-1, side1=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2=-1, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=-2] [L400] COND FALSE !((int )side1 == 0) VAL [active_side=-2, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=127, cs1_old=-1, cs2=0, cs2_new=127, cs2_old=-1, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=0, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=-1, s2s2=0, s2s2_new=0, s2s2_old=-1, side1=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2=-1, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=-2] [L408] COND TRUE (int )side1 == (int )nomsg VAL [active_side=-2, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=127, cs1_old=-1, cs2=0, cs2_new=127, cs2_old=-1, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=0, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=-1, s2s2=0, s2s2_new=0, s2s2_old=-1, side1=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2=-1, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=-2] [L409] COND FALSE !((int )side2 == 0) [L412] active_side = (int8_t )0 VAL [active_side=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=127, cs1_old=-1, cs2=0, cs2_new=127, cs2_old=-1, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=0, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=-1, s2s2=0, s2s2_new=0, s2s2_old=-1, side1=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2=-1, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=-2] [L417] CALL write_active_side_history(active_side) [L137] active_side_History_2 = active_side_History_1 [L138] active_side_History_1 = active_side_History_0 [L139] active_side_History_0 = val VAL [\old(val)=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=127, cs1_old=-1, cs2=0, cs2_new=127, cs2_old=-1, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=0, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=-1, s2s2=0, s2s2_new=0, s2s2_old=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, val=0] [L417] RET write_active_side_history(active_side) [L587] RET Pendulum_prism_task_each_pals_period() [L588] cs1_old = cs1_new [L589] cs1_new = nomsg [L590] cs2_old = cs2_new [L591] cs2_new = nomsg [L592] s1s2_old = s1s2_new [L593] s1s2_new = nomsg [L594] s1s1_old = s1s1_new [L595] s1s1_new = nomsg [L596] s2s1_old = s2s1_new [L597] s2s1_new = nomsg [L598] s2s2_old = s2s2_new [L599] s2s2_new = nomsg [L600] s1p_old = s1p_new [L601] s1p_new = nomsg [L602] s2p_old = s2p_new [L603] s2p_new = nomsg [L604] CALL, EXPR check() [L423] int tmp ; [L424] msg_t tmp___0 ; [L425] _Bool tmp___1 ; [L426] _Bool tmp___2 ; [L427] _Bool tmp___3 ; [L428] _Bool tmp___4 ; [L429] int8_t tmp___5 ; [L430] _Bool tmp___6 ; [L431] _Bool tmp___7 ; [L432] _Bool tmp___8 ; [L433] int8_t tmp___9 ; [L434] _Bool tmp___10 ; [L435] _Bool tmp___11 ; [L436] _Bool tmp___12 ; [L437] msg_t tmp___13 ; [L438] _Bool tmp___14 ; [L439] _Bool tmp___15 ; [L440] _Bool tmp___16 ; [L441] _Bool tmp___17 ; [L442] int8_t tmp___18 ; [L443] int8_t tmp___19 ; [L444] int8_t tmp___20 ; VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L447] COND FALSE !(! side1Failed) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L450] COND TRUE ! side2Failed [L451] tmp = 1 VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1] [L455] CALL assume_abort_if_not((_Bool )tmp) VAL [\old(cond)=1, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, 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=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L455] RET assume_abort_if_not((_Bool )tmp) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1] [L456] CALL, EXPR read_manual_selection_history((unsigned char)1) VAL [\old(index)=1, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, 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=127, cs2=0, cs2_new=-1, cs2_old=127, index=1, manual_selection_History_0=127, 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=127, cs2=0, cs2_new=-1, cs2_old=127, index=1, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L456] RET, EXPR read_manual_selection_history((unsigned char)1) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, read_manual_selection_history((unsigned char)1)=0, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1] [L456] tmp___0 = read_manual_selection_history((unsigned char)1) [L457] COND TRUE ! tmp___0 VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0] [L458] CALL, EXPR read_side1_failed_history((unsigned char)1) VAL [\old(index)=1, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, 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=127, cs2=0, cs2_new=-1, cs2_old=127, index=1, manual_selection_History_0=127, 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=127, cs2=0, cs2_new=-1, cs2_old=127, index=1, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L458] RET, EXPR read_side1_failed_history((unsigned char)1) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, read_side1_failed_history((unsigned char)1)=0, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0] [L458] tmp___1 = read_side1_failed_history((unsigned char)1) [L459] COND TRUE ! tmp___1 VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0, tmp___1=0] [L460] CALL, EXPR read_side1_failed_history((unsigned char)0) VAL [\old(index)=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, 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=127, cs2=0, cs2_new=-1, cs2_old=127, index=0, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L460] RET, EXPR read_side1_failed_history((unsigned char)0) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, read_side1_failed_history((unsigned char)0)=-255, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0, tmp___1=0] [L460] tmp___2 = read_side1_failed_history((unsigned char)0) [L461] COND FALSE !(! tmp___2) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0, tmp___1=0, tmp___2=1] [L486] CALL, EXPR read_side1_failed_history((unsigned char)1) VAL [\old(index)=1, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, 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=127, cs2=0, cs2_new=-1, cs2_old=127, index=1, manual_selection_History_0=127, 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=127, cs2=0, cs2_new=-1, cs2_old=127, index=1, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L486] RET, EXPR read_side1_failed_history((unsigned char)1) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, read_side1_failed_history((unsigned char)1)=0, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0, tmp___1=0, tmp___2=1] [L486] tmp___7 = read_side1_failed_history((unsigned char)1) [L487] COND FALSE !(\read(tmp___7)) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0, tmp___1=0, tmp___2=1, tmp___7=0] [L502] CALL, EXPR read_side1_failed_history((unsigned char)1) VAL [\old(index)=1, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, 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=127, cs2=0, cs2_new=-1, cs2_old=127, index=1, manual_selection_History_0=127, 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=127, cs2=0, cs2_new=-1, cs2_old=127, index=1, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L502] RET, EXPR read_side1_failed_history((unsigned char)1) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, read_side1_failed_history((unsigned char)1)=0, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0, tmp___1=0, tmp___2=1, tmp___7=0] [L502] tmp___11 = read_side1_failed_history((unsigned char)1) [L503] COND TRUE ! tmp___11 VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0, tmp___1=0, tmp___11=0, tmp___2=1, tmp___7=0] [L504] CALL, EXPR read_side2_failed_history((unsigned char)1) VAL [\old(index)=1, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, 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=127, cs2=0, cs2_new=-1, cs2_old=127, index=1, manual_selection_History_0=127, 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=127, cs2=0, cs2_new=-1, cs2_old=127, index=1, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L504] RET, EXPR read_side2_failed_history((unsigned char)1) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, read_side2_failed_history((unsigned char)1)=0, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0, tmp___1=0, tmp___11=0, tmp___2=1, tmp___7=0] [L504] tmp___12 = read_side2_failed_history((unsigned char)1) [L505] COND FALSE !(\read(tmp___12)) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0, tmp___1=0, tmp___11=0, tmp___12=0, tmp___2=1, tmp___7=0] [L518] CALL, EXPR read_active_side_history((unsigned char)2) VAL [\old(index)=2, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, 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=127, cs2=0, cs2_new=-1, cs2_old=127, index=2, manual_selection_History_0=127, 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=127, cs2=0, cs2_new=-1, cs2_old=127, index=2, manual_selection_History_0=127, 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=127, cs2=0, cs2_new=-1, cs2_old=127, index=2, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L518] RET, EXPR read_active_side_history((unsigned char)2) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, read_active_side_history((unsigned char)2)=-2, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0, tmp___1=0, tmp___11=0, tmp___12=0, tmp___2=1, tmp___7=0] [L518] tmp___20 = read_active_side_history((unsigned char)2) [L519] COND FALSE !((int )tmp___20 > -2) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0, tmp___1=0, tmp___11=0, tmp___12=0, tmp___2=1, tmp___20=-2, tmp___7=0] [L537] return (1); VAL [\result=1, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0, tmp___1=0, tmp___11=0, tmp___12=0, tmp___2=1, tmp___20=-2, tmp___7=0] [L604] RET, EXPR check() [L604] c1 = check() [L605] CALL assert(c1) VAL [\old(arg)=1, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, 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] [L616] 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=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L605] RET assert(c1) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, c1=1, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, i2=0, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L582] COND TRUE 1 [L584] CALL Console_task_each_pals_period() [L251] msg_t manual_selection ; [L252] char tmp ; [L255] tmp = __VERIFIER_nondet_char() [L256] manual_selection = tmp [L257] CALL write_manual_selection_history(manual_selection) [L167] manual_selection_History_2 = manual_selection_History_1 [L168] manual_selection_History_1 = manual_selection_History_0 [L169] manual_selection_History_0 = val VAL [\old(val)=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=0, manual_selection_History_1=127, 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=0] [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=0, cs1_old=127, cs2=0, cs2_new=0, cs2_old=127, manual_selection=0, manual_selection_History_0=0, manual_selection_History_1=127, 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=0] [L584] RET Console_task_each_pals_period() [L585] CALL Side1_activestandby_task_each_pals_period() [L266] int8_t side1 ; [L267] int8_t side2 ; [L268] msg_t manual_selection ; [L269] int8_t next_state ; [L272] side1 = nomsg [L273] side2 = nomsg [L274] manual_selection = (msg_t )0 [L275] side1Failed = __VERIFIER_nondet_bool() [L276] CALL write_side1_failed_history(side1Failed) [L77] side1Failed_History_2 = side1Failed_History_1 [L78] side1Failed_History_1 = side1Failed_History_0 [L79] side1Failed_History_0 = val VAL [\old(val)=257, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=127, cs2=0, cs2_new=0, cs2_old=127, manual_selection_History_0=0, manual_selection_History_1=127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, val=257] [L276] RET write_side1_failed_history(side1Failed) [L277] COND TRUE \read(side1Failed) [L278] s1s1_new = nomsg != nomsg && s1s1_new == nomsg ? nomsg : s1s1_new [L279] s1s2_new = nomsg != nomsg && s1s2_new == nomsg ? nomsg : s1s2_new [L280] s1p_new = nomsg != nomsg && s1p_new == nomsg ? nomsg : s1p_new [L281] side1_written = nomsg VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=127, cs2=0, cs2_new=0, cs2_old=127, manual_selection=0, manual_selection_History_0=0, manual_selection_History_1=127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2=-1, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L585] RET Side1_activestandby_task_each_pals_period() [L586] CALL Side2_activestandby_task_each_pals_period() [L323] int8_t side1 ; [L324] int8_t side2 ; [L325] msg_t manual_selection ; [L326] int8_t next_state ; [L329] side1 = nomsg [L330] side2 = nomsg [L331] manual_selection = (msg_t )0 [L332] side2Failed = __VERIFIER_nondet_bool() [L333] CALL write_side2_failed_history(side2Failed) [L107] side2Failed_History_2 = side2Failed_History_1 [L108] side2Failed_History_1 = side2Failed_History_0 [L109] side2Failed_History_0 = val VAL [\old(val)=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=127, cs2=0, cs2_new=0, cs2_old=127, manual_selection_History_0=0, manual_selection_History_1=127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, val=0] [L333] RET write_side2_failed_history(side2Failed) [L334] COND FALSE !(\read(side2Failed)) [L341] side1 = s1s2_old [L342] s1s2_old = nomsg [L343] side2 = s2s2_old [L344] s2s2_old = nomsg [L345] manual_selection = cs2_old [L346] cs2_old = nomsg VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=127, cs2=0, cs2_new=0, cs2_old=-1, manual_selection=127, manual_selection_History_0=0, manual_selection_History_1=127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L347] COND FALSE !((int )side1 == (int )side2) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=127, cs2=0, cs2_new=0, cs2_old=-1, manual_selection=127, manual_selection_History_0=0, manual_selection_History_1=127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L350] COND TRUE (int )side1 == (int )nomsg VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=127, cs2=0, cs2_new=0, cs2_old=-1, manual_selection=127, manual_selection_History_0=0, manual_selection_History_1=127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L351] COND TRUE (int )side2 != (int )nomsg [L352] next_state = (int8_t )0 VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=127, cs2=0, cs2_new=0, cs2_old=-1, manual_selection=127, manual_selection_History_0=0, manual_selection_History_1=127, manual_selection_History_2=0, next_state=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L371] s2s1_new = next_state != nomsg && s2s1_new == nomsg ? next_state : s2s1_new [L372] s2s2_new = next_state != nomsg && s2s2_new == nomsg ? next_state : s2s2_new [L373] s2p_new = next_state != nomsg && s2p_new == nomsg ? next_state : s2p_new [L374] side2_written = next_state VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=127, cs2=0, cs2_new=0, cs2_old=-1, manual_selection=127, manual_selection_History_0=0, manual_selection_History_1=127, manual_selection_History_2=0, next_state=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=-1, side1=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L586] RET Side2_activestandby_task_each_pals_period() [L587] CALL Pendulum_prism_task_each_pals_period() [L380] int8_t active_side ; [L381] int8_t tmp ; [L382] int8_t side1 ; [L383] int8_t side2 ; VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=127, cs2=0, cs2_new=0, cs2_old=-1, manual_selection_History_0=0, manual_selection_History_1=127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L386] CALL, EXPR read_active_side_history((unsigned char)0) VAL [\old(index)=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=127, cs2=0, cs2_new=0, cs2_old=-1, manual_selection_History_0=0, manual_selection_History_1=127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L148] COND TRUE (int )index == 0 [L149] return (active_side_History_0); VAL [\old(index)=0, \result=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=127, cs2=0, cs2_new=0, cs2_old=-1, index=0, manual_selection_History_0=0, manual_selection_History_1=127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L386] RET, EXPR read_active_side_history((unsigned char)0) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=127, cs2=0, cs2_new=0, cs2_old=-1, manual_selection_History_0=0, manual_selection_History_1=127, manual_selection_History_2=0, nomsg=-1, read_active_side_history((unsigned char)0)=0, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L386] tmp = read_active_side_history((unsigned char)0) [L387] active_side = tmp [L388] side1 = nomsg [L389] side2 = nomsg [L390] side1 = s1p_old [L391] s1p_old = nomsg [L392] side2 = s2p_old [L393] s2p_old = nomsg VAL [active_side=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=127, cs2=0, cs2_new=0, cs2_old=-1, manual_selection_History_0=0, manual_selection_History_1=127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=0, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=-1, side1=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=0] [L394] COND FALSE !((int )side1 == 1) VAL [active_side=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=127, cs2=0, cs2_new=0, cs2_old=-1, manual_selection_History_0=0, manual_selection_History_1=127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=0, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=-1, side1=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=0] [L397] COND FALSE !((int )side2 == 1) VAL [active_side=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=127, cs2=0, cs2_new=0, cs2_old=-1, manual_selection_History_0=0, manual_selection_History_1=127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=0, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=-1, side1=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=0] [L400] COND FALSE !((int )side1 == 0) VAL [active_side=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=127, cs2=0, cs2_new=0, cs2_old=-1, manual_selection_History_0=0, manual_selection_History_1=127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=0, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=-1, side1=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=0] [L408] COND TRUE (int )side1 == (int )nomsg VAL [active_side=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=127, cs2=0, cs2_new=0, cs2_old=-1, manual_selection_History_0=0, manual_selection_History_1=127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=0, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=-1, side1=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=0] [L409] COND TRUE (int )side2 == 0 [L410] active_side = (int8_t )2 VAL [active_side=2, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=127, cs2=0, cs2_new=0, cs2_old=-1, manual_selection_History_0=0, manual_selection_History_1=127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=0, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=-1, side1=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=0] [L417] CALL write_active_side_history(active_side) [L137] active_side_History_2 = active_side_History_1 [L138] active_side_History_1 = active_side_History_0 [L139] active_side_History_0 = val VAL [\old(val)=2, active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=127, cs2=0, cs2_new=0, cs2_old=-1, manual_selection_History_0=0, manual_selection_History_1=127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=0, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, val=2] [L417] RET write_active_side_history(active_side) [L587] RET Pendulum_prism_task_each_pals_period() [L588] cs1_old = cs1_new [L589] cs1_new = nomsg [L590] cs2_old = cs2_new [L591] cs2_new = nomsg [L592] s1s2_old = s1s2_new [L593] s1s2_new = nomsg [L594] s1s1_old = s1s1_new [L595] s1s1_new = nomsg [L596] s2s1_old = s2s1_new [L597] s2s1_new = nomsg [L598] s2s2_old = s2s2_new [L599] s2s2_new = nomsg [L600] s1p_old = s1p_new [L601] s1p_new = nomsg [L602] s2p_old = s2p_new [L603] s2p_new = nomsg [L604] CALL, EXPR check() [L423] int tmp ; [L424] msg_t tmp___0 ; [L425] _Bool tmp___1 ; [L426] _Bool tmp___2 ; [L427] _Bool tmp___3 ; [L428] _Bool tmp___4 ; [L429] int8_t tmp___5 ; [L430] _Bool tmp___6 ; [L431] _Bool tmp___7 ; [L432] _Bool tmp___8 ; [L433] int8_t tmp___9 ; [L434] _Bool tmp___10 ; [L435] _Bool tmp___11 ; [L436] _Bool tmp___12 ; [L437] msg_t tmp___13 ; [L438] _Bool tmp___14 ; [L439] _Bool tmp___15 ; [L440] _Bool tmp___16 ; [L441] _Bool tmp___17 ; [L442] int8_t tmp___18 ; [L443] int8_t tmp___19 ; [L444] int8_t tmp___20 ; VAL [active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=0, cs2=0, cs2_new=-1, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L447] COND FALSE !(! side1Failed) VAL [active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=0, cs2=0, cs2_new=-1, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L450] COND TRUE ! side2Failed [L451] tmp = 1 VAL [active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=0, cs2=0, cs2_new=-1, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1] [L455] CALL assume_abort_if_not((_Bool )tmp) VAL [\old(cond)=1, active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=0, cs2=0, cs2_new=-1, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L58] COND FALSE !(!cond) VAL [\old(cond)=1, active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cond=1, cs1=0, cs1_new=-1, cs1_old=0, cs2=0, cs2_new=-1, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L455] RET assume_abort_if_not((_Bool )tmp) VAL [active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=0, cs2=0, cs2_new=-1, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1] [L456] CALL, EXPR read_manual_selection_history((unsigned char)1) VAL [\old(index)=1, active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=0, cs2=0, cs2_new=-1, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L178] COND FALSE !((int )index == 0) VAL [\old(index)=1, active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=0, cs2=0, cs2_new=-1, cs2_old=0, index=1, manual_selection_History_0=0, manual_selection_History_1=127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L181] COND TRUE (int )index == 1 [L182] return (manual_selection_History_1); VAL [\old(index)=1, \result=127, active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=0, cs2=0, cs2_new=-1, cs2_old=0, index=1, manual_selection_History_0=0, manual_selection_History_1=127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L456] RET, EXPR read_manual_selection_history((unsigned char)1) VAL [active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=0, cs2=0, cs2_new=-1, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=127, manual_selection_History_2=0, nomsg=-1, read_manual_selection_history((unsigned char)1)=127, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1] [L456] tmp___0 = read_manual_selection_history((unsigned char)1) [L457] COND FALSE !(! tmp___0) VAL [active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=0, cs2=0, cs2_new=-1, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=127] [L486] CALL, EXPR read_side1_failed_history((unsigned char)1) VAL [\old(index)=1, active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=0, cs2=0, cs2_new=-1, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L88] COND FALSE !((int )index == 0) VAL [\old(index)=1, active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=0, cs2=0, cs2_new=-1, cs2_old=0, index=1, manual_selection_History_0=0, manual_selection_History_1=127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L91] COND TRUE (int )index == 1 [L92] return (side1Failed_History_1); VAL [\old(index)=1, \result=-255, active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=0, cs2=0, cs2_new=-1, cs2_old=0, index=1, manual_selection_History_0=0, manual_selection_History_1=127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L486] RET, EXPR read_side1_failed_history((unsigned char)1) VAL [active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=0, cs2=0, cs2_new=-1, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=127, manual_selection_History_2=0, nomsg=-1, read_side1_failed_history((unsigned char)1)=-255, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=127] [L486] tmp___7 = read_side1_failed_history((unsigned char)1) [L487] COND TRUE \read(tmp___7) VAL [active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=0, cs2=0, cs2_new=-1, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=127, tmp___7=1] [L488] CALL, EXPR read_side2_failed_history((unsigned char)1) VAL [\old(index)=1, active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=0, cs2=0, cs2_new=-1, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L118] COND FALSE !((int )index == 0) VAL [\old(index)=1, active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=0, cs2=0, cs2_new=-1, cs2_old=0, index=1, manual_selection_History_0=0, manual_selection_History_1=127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L121] COND TRUE (int )index == 1 [L122] return (side2Failed_History_1); VAL [\old(index)=1, \result=0, active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=0, cs2=0, cs2_new=-1, cs2_old=0, index=1, manual_selection_History_0=0, manual_selection_History_1=127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L488] RET, EXPR read_side2_failed_history((unsigned char)1) VAL [active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=0, cs2=0, cs2_new=-1, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=127, manual_selection_History_2=0, nomsg=-1, read_side2_failed_history((unsigned char)1)=0, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=127, tmp___7=1] [L488] tmp___8 = read_side2_failed_history((unsigned char)1) [L489] COND TRUE ! tmp___8 VAL [active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=0, cs2=0, cs2_new=-1, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=127, tmp___7=1, tmp___8=0] [L490] CALL, EXPR read_active_side_history((unsigned char)0) VAL [\old(index)=0, active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=0, cs2=0, cs2_new=-1, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L148] COND TRUE (int )index == 0 [L149] return (active_side_History_0); VAL [\old(index)=0, \result=2, active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=0, cs2=0, cs2_new=-1, cs2_old=0, index=0, manual_selection_History_0=0, manual_selection_History_1=127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L490] RET, EXPR read_active_side_history((unsigned char)0) VAL [active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=0, cs2=0, cs2_new=-1, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=127, manual_selection_History_2=0, nomsg=-1, read_active_side_history((unsigned char)0)=2, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=127, tmp___7=1, tmp___8=0] [L490] tmp___5 = read_active_side_history((unsigned char)0) [L491] COND FALSE !(! ((int )tmp___5 == 2)) VAL [active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=0, cs2=0, cs2_new=-1, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=127, tmp___5=2, tmp___7=1, tmp___8=0] [L494] CALL, EXPR read_side2_failed_history((unsigned char)0) VAL [\old(index)=0, active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=0, cs2=0, cs2_new=-1, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L118] COND TRUE (int )index == 0 [L119] return (side2Failed_History_0); VAL [\old(index)=0, \result=0, active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=0, cs2=0, cs2_new=-1, cs2_old=0, index=0, manual_selection_History_0=0, manual_selection_History_1=127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L494] RET, EXPR read_side2_failed_history((unsigned char)0) VAL [active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=0, cs2=0, cs2_new=-1, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=127, manual_selection_History_2=0, nomsg=-1, read_side2_failed_history((unsigned char)0)=0, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=127, tmp___5=2, tmp___7=1, tmp___8=0] [L494] tmp___6 = read_side2_failed_history((unsigned char)0) [L495] COND TRUE ! tmp___6 VAL [active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=0, cs2=0, cs2_new=-1, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=127, tmp___5=2, tmp___6=0, tmp___7=1, tmp___8=0] [L496] COND TRUE ! ((int )side2_written == 1) [L497] return (0); VAL [\result=0, active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=0, cs2=0, cs2_new=-1, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=127, tmp___5=2, tmp___6=0, tmp___7=1, tmp___8=0] [L604] RET, EXPR check() [L604] c1 = check() [L605] CALL assert(c1) VAL [\old(arg)=0, active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=0, cs2=0, cs2_new=-1, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L616] COND TRUE ! arg VAL [\old(arg)=0, active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, arg=0, cs1=0, cs1_new=-1, cs1_old=0, cs2=0, cs2_new=-1, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L618] reach_error() VAL [\old(arg)=0, active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, arg=0, cs1=0, cs1_new=-1, cs1_old=0, cs2=0, cs2_new=-1, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 8 procedures, 180 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 284.3s, OverallIterations: 42, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.2s, AutomataDifference: 201.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 38005 SdHoareTripleChecker+Valid, 43.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 37688 mSDsluCounter, 93566 SdHoareTripleChecker+Invalid, 37.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 75552 mSDsCounter, 20103 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 44496 IncrementalHoareTripleChecker+Invalid, 64599 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 20103 mSolverCounterUnsat, 18014 mSDtfsCounter, 44496 mSolverCounterSat, 0.8s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 5781 GetRequests, 4717 SyntacticMatches, 19 SemanticMatches, 1045 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53204 ImplicationChecksByTransitivity, 53.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=20911occurred in iteration=39, InterpolantAutomatonStates: 981, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 56.8s AutomataMinimizationTime, 41 MinimizatonAttempts, 114603 StatesRemovedByMinimization, 32 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.6s SsaConstructionTime, 2.2s SatisfiabilityAnalysisTime, 18.9s InterpolantComputationTime, 6564 NumberOfCodeBlocks, 6564 NumberOfCodeBlocksAsserted, 53 NumberOfCheckSat, 8184 ConstructedInterpolants, 0 QuantifiedInterpolants, 27153 SizeOfPredicates, 41 NumberOfNonLiveVariables, 8353 ConjunctsInSsa, 188 ConjunctsInUnsatCore, 63 InterpolantComputations, 31 PerfectInterpolantSequences, 3227/3820 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-21 16:19:57,764 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45a6a48e-927b-43c1-a242-2685973c4754/bin/uautomizer-vX5HgA9Q3a/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