./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_2.ufo.BOUNDED-10.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8393723b Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a03a397-50b2-4fa7-9e70-08fdf5753c02/bin/uautomizer-TMbwUNV5ro/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a03a397-50b2-4fa7-9e70-08fdf5753c02/bin/uautomizer-TMbwUNV5ro/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a03a397-50b2-4fa7-9e70-08fdf5753c02/bin/uautomizer-TMbwUNV5ro/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a03a397-50b2-4fa7-9e70-08fdf5753c02/bin/uautomizer-TMbwUNV5ro/config/AutomizerReach.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_2.ufo.BOUNDED-10.pals.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a03a397-50b2-4fa7-9e70-08fdf5753c02/bin/uautomizer-TMbwUNV5ro/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a03a397-50b2-4fa7-9e70-08fdf5753c02/bin/uautomizer-TMbwUNV5ro --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash cdd691469d2e12c2dd1871c48be4dd2db0b9d27541ac5dee5ff25a04db0d98eb --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-8393723 [2022-11-18 21:08:33,948 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-18 21:08:33,951 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-18 21:08:33,993 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-18 21:08:33,995 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-18 21:08:33,996 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-18 21:08:33,999 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-18 21:08:34,003 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-18 21:08:34,006 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-18 21:08:34,008 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-18 21:08:34,010 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-18 21:08:34,013 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-18 21:08:34,014 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-18 21:08:34,020 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-18 21:08:34,021 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-18 21:08:34,023 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-18 21:08:34,025 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-18 21:08:34,028 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-18 21:08:34,030 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-18 21:08:34,037 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-18 21:08:34,039 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-18 21:08:34,041 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-18 21:08:34,044 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-18 21:08:34,045 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-18 21:08:34,055 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-18 21:08:34,056 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-18 21:08:34,057 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-18 21:08:34,058 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-18 21:08:34,060 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-18 21:08:34,061 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-18 21:08:34,062 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-18 21:08:34,063 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-18 21:08:34,065 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-18 21:08:34,067 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-18 21:08:34,069 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-18 21:08:34,070 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-18 21:08:34,071 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-18 21:08:34,071 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-18 21:08:34,072 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-18 21:08:34,073 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-18 21:08:34,074 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-18 21:08:34,075 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a03a397-50b2-4fa7-9e70-08fdf5753c02/bin/uautomizer-TMbwUNV5ro/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-18 21:08:34,119 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-18 21:08:34,120 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-18 21:08:34,120 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-18 21:08:34,121 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-18 21:08:34,122 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-18 21:08:34,122 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-18 21:08:34,123 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-18 21:08:34,124 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-18 21:08:34,124 INFO L138 SettingsManager]: * Use SBE=true [2022-11-18 21:08:34,124 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-18 21:08:34,126 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-18 21:08:34,126 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-18 21:08:34,127 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-18 21:08:34,127 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-18 21:08:34,127 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-18 21:08:34,128 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-18 21:08:34,128 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-18 21:08:34,128 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-18 21:08:34,128 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-18 21:08:34,129 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-18 21:08:34,129 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-18 21:08:34,129 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-18 21:08:34,130 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-18 21:08:34,130 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-18 21:08:34,130 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 21:08:34,131 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-18 21:08:34,131 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-18 21:08:34,131 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-18 21:08:34,132 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-18 21:08:34,132 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-18 21:08:34,132 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-18 21:08:34,133 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-18 21:08:34,133 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-18 21:08:34,134 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_1a03a397-50b2-4fa7-9e70-08fdf5753c02/bin/uautomizer-TMbwUNV5ro/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_1a03a397-50b2-4fa7-9e70-08fdf5753c02/bin/uautomizer-TMbwUNV5ro Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> cdd691469d2e12c2dd1871c48be4dd2db0b9d27541ac5dee5ff25a04db0d98eb [2022-11-18 21:08:34,472 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-18 21:08:34,494 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-18 21:08:34,497 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-18 21:08:34,498 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-18 21:08:34,499 INFO L275 PluginConnector]: CDTParser initialized [2022-11-18 21:08:34,500 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a03a397-50b2-4fa7-9e70-08fdf5753c02/bin/uautomizer-TMbwUNV5ro/../../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_2.ufo.BOUNDED-10.pals.c [2022-11-18 21:08:34,581 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a03a397-50b2-4fa7-9e70-08fdf5753c02/bin/uautomizer-TMbwUNV5ro/data/4e1652a62/4767c0d584a7420697871bd1d956511a/FLAGdba8d85f0 [2022-11-18 21:08:35,146 INFO L306 CDTParser]: Found 1 translation units. [2022-11-18 21:08:35,147 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a03a397-50b2-4fa7-9e70-08fdf5753c02/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_2.ufo.BOUNDED-10.pals.c [2022-11-18 21:08:35,161 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a03a397-50b2-4fa7-9e70-08fdf5753c02/bin/uautomizer-TMbwUNV5ro/data/4e1652a62/4767c0d584a7420697871bd1d956511a/FLAGdba8d85f0 [2022-11-18 21:08:35,441 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a03a397-50b2-4fa7-9e70-08fdf5753c02/bin/uautomizer-TMbwUNV5ro/data/4e1652a62/4767c0d584a7420697871bd1d956511a [2022-11-18 21:08:35,445 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-18 21:08:35,448 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-18 21:08:35,451 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-18 21:08:35,451 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-18 21:08:35,455 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-18 21:08:35,456 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 09:08:35" (1/1) ... [2022-11-18 21:08:35,458 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9cfa3bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:08:35, skipping insertion in model container [2022-11-18 21:08:35,458 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 09:08:35" (1/1) ... [2022-11-18 21:08:35,466 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-18 21:08:35,527 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-18 21:08:35,934 WARN L234 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_1a03a397-50b2-4fa7-9e70-08fdf5753c02/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_2.ufo.BOUNDED-10.pals.c[14702,14715] [2022-11-18 21:08:35,940 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 21:08:35,958 INFO L203 MainTranslator]: Completed pre-run [2022-11-18 21:08:36,011 WARN L234 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_1a03a397-50b2-4fa7-9e70-08fdf5753c02/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_2.ufo.BOUNDED-10.pals.c[14702,14715] [2022-11-18 21:08:36,011 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 21:08:36,027 INFO L208 MainTranslator]: Completed translation [2022-11-18 21:08:36,027 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:08:36 WrapperNode [2022-11-18 21:08:36,027 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-18 21:08:36,029 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-18 21:08:36,029 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-18 21:08:36,029 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-18 21:08:36,038 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:08:36" (1/1) ... [2022-11-18 21:08:36,066 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:08:36" (1/1) ... [2022-11-18 21:08:36,114 INFO L138 Inliner]: procedures = 32, calls = 48, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 482 [2022-11-18 21:08:36,114 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-18 21:08:36,115 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-18 21:08:36,115 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-18 21:08:36,115 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-18 21:08:36,125 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:08:36" (1/1) ... [2022-11-18 21:08:36,125 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:08:36" (1/1) ... [2022-11-18 21:08:36,130 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:08:36" (1/1) ... [2022-11-18 21:08:36,130 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:08:36" (1/1) ... [2022-11-18 21:08:36,141 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:08:36" (1/1) ... [2022-11-18 21:08:36,147 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:08:36" (1/1) ... [2022-11-18 21:08:36,150 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:08:36" (1/1) ... [2022-11-18 21:08:36,152 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:08:36" (1/1) ... [2022-11-18 21:08:36,156 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-18 21:08:36,157 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-18 21:08:36,158 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-18 21:08:36,158 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-18 21:08:36,159 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:08:36" (1/1) ... [2022-11-18 21:08:36,166 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 21:08:36,177 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a03a397-50b2-4fa7-9e70-08fdf5753c02/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 21:08:36,192 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a03a397-50b2-4fa7-9e70-08fdf5753c02/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-18 21:08:36,243 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a03a397-50b2-4fa7-9e70-08fdf5753c02/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-18 21:08:36,288 INFO L130 BoogieDeclarations]: Found specification of procedure read_manual_selection_history [2022-11-18 21:08:36,288 INFO L138 BoogieDeclarations]: Found implementation of procedure read_manual_selection_history [2022-11-18 21:08:36,288 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-18 21:08:36,288 INFO L130 BoogieDeclarations]: Found specification of procedure read_side2_failed_history [2022-11-18 21:08:36,288 INFO L138 BoogieDeclarations]: Found implementation of procedure read_side2_failed_history [2022-11-18 21:08:36,289 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2022-11-18 21:08:36,290 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2022-11-18 21:08:36,290 INFO L130 BoogieDeclarations]: Found specification of procedure flip_the_side [2022-11-18 21:08:36,291 INFO L138 BoogieDeclarations]: Found implementation of procedure flip_the_side [2022-11-18 21:08:36,292 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-11-18 21:08:36,292 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-11-18 21:08:36,292 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-18 21:08:36,292 INFO L130 BoogieDeclarations]: Found specification of procedure read_side1_failed_history [2022-11-18 21:08:36,292 INFO L138 BoogieDeclarations]: Found implementation of procedure read_side1_failed_history [2022-11-18 21:08:36,292 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-18 21:08:36,292 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-18 21:08:36,293 INFO L130 BoogieDeclarations]: Found specification of procedure read_active_side_history [2022-11-18 21:08:36,293 INFO L138 BoogieDeclarations]: Found implementation of procedure read_active_side_history [2022-11-18 21:08:36,435 INFO L235 CfgBuilder]: Building ICFG [2022-11-18 21:08:36,437 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-18 21:08:37,152 INFO L276 CfgBuilder]: Performing block encoding [2022-11-18 21:08:37,168 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-18 21:08:37,169 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-18 21:08:37,171 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 09:08:37 BoogieIcfgContainer [2022-11-18 21:08:37,171 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-18 21:08:37,174 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-18 21:08:37,174 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-18 21:08:37,178 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-18 21:08:37,178 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 09:08:35" (1/3) ... [2022-11-18 21:08:37,179 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43f3c1f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 09:08:37, skipping insertion in model container [2022-11-18 21:08:37,179 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:08:36" (2/3) ... [2022-11-18 21:08:37,179 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43f3c1f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 09:08:37, skipping insertion in model container [2022-11-18 21:08:37,180 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 09:08:37" (3/3) ... [2022-11-18 21:08:37,181 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_STARTPALS_ActiveStandby.4_2.ufo.BOUNDED-10.pals.c [2022-11-18 21:08:37,201 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-18 21:08:37,201 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-18 21:08:37,256 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-18 21:08:37,263 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;@6936ddba, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-18 21:08:37,263 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-18 21:08:37,268 INFO L276 IsEmpty]: Start isEmpty. Operand has 181 states, 141 states have (on average 1.553191489361702) internal successors, (219), 142 states have internal predecessors, (219), 31 states have call successors, (31), 7 states have call predecessors, (31), 7 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2022-11-18 21:08:37,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-18 21:08:37,278 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 21:08:37,278 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-18 21:08:37,279 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 21:08:37,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 21:08:37,285 INFO L85 PathProgramCache]: Analyzing trace with hash 1494571229, now seen corresponding path program 1 times [2022-11-18 21:08:37,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 21:08:37,293 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778780681] [2022-11-18 21:08:37,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 21:08:37,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 21:08:37,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:08:37,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-18 21:08:37,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:08:37,583 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-18 21:08:37,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 21:08:37,584 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778780681] [2022-11-18 21:08:37,585 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [778780681] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 21:08:37,586 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 21:08:37,587 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-18 21:08:37,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218324535] [2022-11-18 21:08:37,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 21:08:37,595 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-18 21:08:37,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 21:08:37,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-18 21:08:37,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-18 21:08:37,628 INFO L87 Difference]: Start difference. First operand has 181 states, 141 states have (on average 1.553191489361702) internal successors, (219), 142 states have internal predecessors, (219), 31 states have call successors, (31), 7 states have call predecessors, (31), 7 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) Second operand has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-18 21:08:37,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 21:08:37,685 INFO L93 Difference]: Finished difference Result 346 states and 562 transitions. [2022-11-18 21:08:37,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-18 21:08:37,687 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-18 21:08:37,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 21:08:37,697 INFO L225 Difference]: With dead ends: 346 [2022-11-18 21:08:37,698 INFO L226 Difference]: Without dead ends: 177 [2022-11-18 21:08:37,702 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-18 21:08:37,706 INFO L413 NwaCegarLoop]: 278 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-18 21:08:37,707 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 278 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-18 21:08:37,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2022-11-18 21:08:37,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 177. [2022-11-18 21:08:37,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 138 states have (on average 1.536231884057971) internal successors, (212), 138 states have internal predecessors, (212), 31 states have call successors, (31), 7 states have call predecessors, (31), 7 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2022-11-18 21:08:37,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 274 transitions. [2022-11-18 21:08:37,773 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 274 transitions. Word has length 28 [2022-11-18 21:08:37,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 21:08:37,773 INFO L495 AbstractCegarLoop]: Abstraction has 177 states and 274 transitions. [2022-11-18 21:08:37,774 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-18 21:08:37,774 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 274 transitions. [2022-11-18 21:08:37,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-18 21:08:37,776 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 21:08:37,776 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-18 21:08:37,776 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-18 21:08:37,777 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 21:08:37,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 21:08:37,777 INFO L85 PathProgramCache]: Analyzing trace with hash 1713425947, now seen corresponding path program 1 times [2022-11-18 21:08:37,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 21:08:37,778 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714211296] [2022-11-18 21:08:37,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 21:08:37,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 21:08:37,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:08:38,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-18 21:08:38,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:08:38,064 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-18 21:08:38,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 21:08:38,064 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714211296] [2022-11-18 21:08:38,065 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1714211296] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 21:08:38,065 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 21:08:38,065 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-18 21:08:38,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871419583] [2022-11-18 21:08:38,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 21:08:38,067 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-18 21:08:38,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 21:08:38,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-18 21:08:38,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-18 21:08:38,068 INFO L87 Difference]: Start difference. First operand 177 states and 274 transitions. Second operand has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-18 21:08:38,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 21:08:38,257 INFO L93 Difference]: Finished difference Result 453 states and 709 transitions. [2022-11-18 21:08:38,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-18 21:08:38,282 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-18 21:08:38,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 21:08:38,285 INFO L225 Difference]: With dead ends: 453 [2022-11-18 21:08:38,285 INFO L226 Difference]: Without dead ends: 290 [2022-11-18 21:08:38,286 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-11-18 21:08:38,288 INFO L413 NwaCegarLoop]: 293 mSDtfsCounter, 137 mSDsluCounter, 1121 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 1414 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 21:08:38,288 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 1414 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 21:08:38,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2022-11-18 21:08:38,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 177. [2022-11-18 21:08:38,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 138 states have (on average 1.4492753623188406) internal successors, (200), 138 states have internal predecessors, (200), 31 states have call successors, (31), 7 states have call predecessors, (31), 7 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2022-11-18 21:08:38,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 262 transitions. [2022-11-18 21:08:38,341 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 262 transitions. Word has length 28 [2022-11-18 21:08:38,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 21:08:38,342 INFO L495 AbstractCegarLoop]: Abstraction has 177 states and 262 transitions. [2022-11-18 21:08:38,342 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-18 21:08:38,343 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 262 transitions. [2022-11-18 21:08:38,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-11-18 21:08:38,344 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 21:08:38,344 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-18 21:08:38,344 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-18 21:08:38,345 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 21:08:38,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 21:08:38,346 INFO L85 PathProgramCache]: Analyzing trace with hash 1150379712, now seen corresponding path program 1 times [2022-11-18 21:08:38,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 21:08:38,346 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729135759] [2022-11-18 21:08:38,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 21:08:38,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 21:08:38,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:08:38,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-18 21:08:38,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:08:38,627 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-18 21:08:38,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 21:08:38,627 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729135759] [2022-11-18 21:08:38,627 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [729135759] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 21:08:38,628 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 21:08:38,628 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-18 21:08:38,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752558061] [2022-11-18 21:08:38,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 21:08:38,629 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 21:08:38,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 21:08:38,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 21:08:38,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-18 21:08:38,630 INFO L87 Difference]: Start difference. First operand 177 states and 262 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 3 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-18 21:08:38,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 21:08:38,685 INFO L93 Difference]: Finished difference Result 341 states and 514 transitions. [2022-11-18 21:08:38,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-18 21:08:38,686 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-18 21:08:38,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 21:08:38,688 INFO L225 Difference]: With dead ends: 341 [2022-11-18 21:08:38,688 INFO L226 Difference]: Without dead ends: 181 [2022-11-18 21:08:38,689 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-18 21:08:38,690 INFO L413 NwaCegarLoop]: 256 mSDtfsCounter, 5 mSDsluCounter, 502 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 758 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-18 21:08:38,691 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 758 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-18 21:08:38,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2022-11-18 21:08:38,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 181. [2022-11-18 21:08:38,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 141 states have (on average 1.4397163120567376) internal successors, (203), 141 states have internal predecessors, (203), 31 states have call successors, (31), 8 states have call predecessors, (31), 8 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2022-11-18 21:08:38,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 265 transitions. [2022-11-18 21:08:38,707 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 265 transitions. Word has length 39 [2022-11-18 21:08:38,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 21:08:38,707 INFO L495 AbstractCegarLoop]: Abstraction has 181 states and 265 transitions. [2022-11-18 21:08:38,707 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-18 21:08:38,708 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 265 transitions. [2022-11-18 21:08:38,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-11-18 21:08:38,709 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 21:08:38,709 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-18 21:08:38,709 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-18 21:08:38,710 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 21:08:38,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 21:08:38,710 INFO L85 PathProgramCache]: Analyzing trace with hash -536779374, now seen corresponding path program 1 times [2022-11-18 21:08:38,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 21:08:38,711 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974823052] [2022-11-18 21:08:38,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 21:08:38,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 21:08:38,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:08:38,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-18 21:08:38,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:08:38,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-18 21:08:38,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:08:38,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-11-18 21:08:38,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:08:38,809 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-18 21:08:38,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 21:08:38,809 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974823052] [2022-11-18 21:08:38,810 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974823052] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 21:08:38,810 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 21:08:38,810 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-18 21:08:38,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448625480] [2022-11-18 21:08:38,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 21:08:38,811 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 21:08:38,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 21:08:38,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 21:08:38,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 21:08:38,812 INFO L87 Difference]: Start difference. First operand 181 states and 265 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-18 21:08:38,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 21:08:38,858 INFO L93 Difference]: Finished difference Result 497 states and 738 transitions. [2022-11-18 21:08:38,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 21:08:38,863 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-18 21:08:38,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 21:08:38,866 INFO L225 Difference]: With dead ends: 497 [2022-11-18 21:08:38,867 INFO L226 Difference]: Without dead ends: 333 [2022-11-18 21:08:38,868 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-18 21:08:38,870 INFO L413 NwaCegarLoop]: 301 mSDtfsCounter, 213 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 554 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-18 21:08:38,872 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 554 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-18 21:08:38,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2022-11-18 21:08:38,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 327. [2022-11-18 21:08:38,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 327 states, 250 states have (on average 1.46) internal successors, (365), 251 states have internal predecessors, (365), 60 states have call successors, (60), 16 states have call predecessors, (60), 16 states have return successors, (60), 59 states have call predecessors, (60), 60 states have call successors, (60) [2022-11-18 21:08:38,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 485 transitions. [2022-11-18 21:08:38,929 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 485 transitions. Word has length 55 [2022-11-18 21:08:38,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 21:08:38,930 INFO L495 AbstractCegarLoop]: Abstraction has 327 states and 485 transitions. [2022-11-18 21:08:38,931 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-18 21:08:38,931 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 485 transitions. [2022-11-18 21:08:38,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-11-18 21:08:38,958 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 21:08:38,958 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-18 21:08:38,958 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-18 21:08:38,958 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 21:08:38,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 21:08:38,959 INFO L85 PathProgramCache]: Analyzing trace with hash -1864543556, now seen corresponding path program 1 times [2022-11-18 21:08:38,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 21:08:38,959 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387672002] [2022-11-18 21:08:38,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 21:08:38,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 21:08:38,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:08:39,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-18 21:08:39,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:08:39,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-18 21:08:39,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:08:39,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-18 21:08:39,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:08:39,060 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-18 21:08:39,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 21:08:39,061 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387672002] [2022-11-18 21:08:39,061 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [387672002] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 21:08:39,061 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 21:08:39,062 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-18 21:08:39,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489641350] [2022-11-18 21:08:39,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 21:08:39,062 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 21:08:39,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 21:08:39,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 21:08:39,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 21:08:39,063 INFO L87 Difference]: Start difference. First operand 327 states and 485 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-18 21:08:39,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 21:08:39,131 INFO L93 Difference]: Finished difference Result 920 states and 1376 transitions. [2022-11-18 21:08:39,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 21:08:39,132 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-18 21:08:39,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 21:08:39,138 INFO L225 Difference]: With dead ends: 920 [2022-11-18 21:08:39,138 INFO L226 Difference]: Without dead ends: 610 [2022-11-18 21:08:39,139 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-18 21:08:39,140 INFO L413 NwaCegarLoop]: 320 mSDtfsCounter, 215 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 575 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-18 21:08:39,141 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [215 Valid, 575 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-18 21:08:39,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2022-11-18 21:08:39,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 604. [2022-11-18 21:08:39,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 604 states, 455 states have (on average 1.4703296703296704) internal successors, (669), 458 states have internal predecessors, (669), 117 states have call successors, (117), 31 states have call predecessors, (117), 31 states have return successors, (117), 114 states have call predecessors, (117), 117 states have call successors, (117) [2022-11-18 21:08:39,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 604 states and 903 transitions. [2022-11-18 21:08:39,212 INFO L78 Accepts]: Start accepts. Automaton has 604 states and 903 transitions. Word has length 56 [2022-11-18 21:08:39,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 21:08:39,212 INFO L495 AbstractCegarLoop]: Abstraction has 604 states and 903 transitions. [2022-11-18 21:08:39,213 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-18 21:08:39,213 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 903 transitions. [2022-11-18 21:08:39,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-11-18 21:08:39,214 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 21:08:39,214 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-18 21:08:39,214 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-18 21:08:39,215 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 21:08:39,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 21:08:39,215 INFO L85 PathProgramCache]: Analyzing trace with hash 1150560062, now seen corresponding path program 1 times [2022-11-18 21:08:39,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 21:08:39,215 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798919685] [2022-11-18 21:08:39,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 21:08:39,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 21:08:39,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:08:39,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-18 21:08:39,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:08:39,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-18 21:08:39,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:08:39,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-18 21:08:39,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:08:39,358 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-18 21:08:39,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 21:08:39,358 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798919685] [2022-11-18 21:08:39,358 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [798919685] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 21:08:39,358 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 21:08:39,359 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-18 21:08:39,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723054369] [2022-11-18 21:08:39,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 21:08:39,359 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-18 21:08:39,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 21:08:39,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-18 21:08:39,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-18 21:08:39,360 INFO L87 Difference]: Start difference. First operand 604 states and 903 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-18 21:08:39,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 21:08:39,780 INFO L93 Difference]: Finished difference Result 1645 states and 2513 transitions. [2022-11-18 21:08:39,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-18 21:08:39,780 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-18 21:08:39,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 21:08:39,793 INFO L225 Difference]: With dead ends: 1645 [2022-11-18 21:08:39,794 INFO L226 Difference]: Without dead ends: 1058 [2022-11-18 21:08:39,796 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-18 21:08:39,799 INFO L413 NwaCegarLoop]: 247 mSDtfsCounter, 636 mSDsluCounter, 447 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 636 SdHoareTripleChecker+Valid, 694 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-18 21:08:39,804 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [636 Valid, 694 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-18 21:08:39,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1058 states. [2022-11-18 21:08:39,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1058 to 692. [2022-11-18 21:08:39,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 692 states, 530 states have (on average 1.4547169811320755) internal successors, (771), 533 states have internal predecessors, (771), 124 states have call successors, (124), 37 states have call predecessors, (124), 37 states have return successors, (124), 121 states have call predecessors, (124), 124 states have call successors, (124) [2022-11-18 21:08:39,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 692 states to 692 states and 1019 transitions. [2022-11-18 21:08:39,915 INFO L78 Accepts]: Start accepts. Automaton has 692 states and 1019 transitions. Word has length 56 [2022-11-18 21:08:39,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 21:08:39,917 INFO L495 AbstractCegarLoop]: Abstraction has 692 states and 1019 transitions. [2022-11-18 21:08:39,917 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-18 21:08:39,917 INFO L276 IsEmpty]: Start isEmpty. Operand 692 states and 1019 transitions. [2022-11-18 21:08:39,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-11-18 21:08:39,919 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 21:08:39,919 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-18 21:08:39,919 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-18 21:08:39,919 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 21:08:39,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 21:08:39,920 INFO L85 PathProgramCache]: Analyzing trace with hash 984808241, now seen corresponding path program 1 times [2022-11-18 21:08:39,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 21:08:39,920 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421868758] [2022-11-18 21:08:39,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 21:08:39,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 21:08:39,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:08:40,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-18 21:08:40,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:08:40,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-18 21:08:40,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:08:40,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-18 21:08:40,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:08:40,081 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-18 21:08:40,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 21:08:40,082 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421868758] [2022-11-18 21:08:40,082 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [421868758] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 21:08:40,082 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 21:08:40,082 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-18 21:08:40,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110940972] [2022-11-18 21:08:40,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 21:08:40,083 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-18 21:08:40,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 21:08:40,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-18 21:08:40,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-18 21:08:40,084 INFO L87 Difference]: Start difference. First operand 692 states and 1019 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-18 21:08:40,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 21:08:40,496 INFO L93 Difference]: Finished difference Result 1649 states and 2513 transitions. [2022-11-18 21:08:40,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-18 21:08:40,496 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-18 21:08:40,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 21:08:40,503 INFO L225 Difference]: With dead ends: 1649 [2022-11-18 21:08:40,503 INFO L226 Difference]: Without dead ends: 1062 [2022-11-18 21:08:40,505 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-18 21:08:40,506 INFO L413 NwaCegarLoop]: 247 mSDtfsCounter, 633 mSDsluCounter, 449 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 633 SdHoareTripleChecker+Valid, 696 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-18 21:08:40,507 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [633 Valid, 696 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-18 21:08:40,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1062 states. [2022-11-18 21:08:40,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1062 to 700. [2022-11-18 21:08:40,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 700 states, 538 states have (on average 1.4479553903345725) internal successors, (779), 541 states have internal predecessors, (779), 124 states have call successors, (124), 37 states have call predecessors, (124), 37 states have return successors, (124), 121 states have call predecessors, (124), 124 states have call successors, (124) [2022-11-18 21:08:40,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 700 states to 700 states and 1027 transitions. [2022-11-18 21:08:40,626 INFO L78 Accepts]: Start accepts. Automaton has 700 states and 1027 transitions. Word has length 57 [2022-11-18 21:08:40,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 21:08:40,626 INFO L495 AbstractCegarLoop]: Abstraction has 700 states and 1027 transitions. [2022-11-18 21:08:40,627 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-18 21:08:40,627 INFO L276 IsEmpty]: Start isEmpty. Operand 700 states and 1027 transitions. [2022-11-18 21:08:40,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-11-18 21:08:40,629 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 21:08:40,629 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-18 21:08:40,629 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-18 21:08:40,634 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 21:08:40,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 21:08:40,635 INFO L85 PathProgramCache]: Analyzing trace with hash 461948067, now seen corresponding path program 1 times [2022-11-18 21:08:40,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 21:08:40,635 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763486906] [2022-11-18 21:08:40,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 21:08:40,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 21:08:40,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:08:40,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-18 21:08:40,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:08:40,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-18 21:08:40,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:08:40,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-18 21:08:40,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:08:40,869 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-18 21:08:40,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 21:08:40,871 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763486906] [2022-11-18 21:08:40,871 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [763486906] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 21:08:40,871 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 21:08:40,872 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-18 21:08:40,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201478327] [2022-11-18 21:08:40,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 21:08:40,872 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 21:08:40,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 21:08:40,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 21:08:40,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-18 21:08:40,873 INFO L87 Difference]: Start difference. First operand 700 states and 1027 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-18 21:08:41,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 21:08:41,287 INFO L93 Difference]: Finished difference Result 1649 states and 2505 transitions. [2022-11-18 21:08:41,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-18 21:08:41,287 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-18 21:08:41,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 21:08:41,295 INFO L225 Difference]: With dead ends: 1649 [2022-11-18 21:08:41,295 INFO L226 Difference]: Without dead ends: 1062 [2022-11-18 21:08:41,297 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-18 21:08:41,298 INFO L413 NwaCegarLoop]: 273 mSDtfsCounter, 187 mSDsluCounter, 390 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 663 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-18 21:08:41,299 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [212 Valid, 663 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-18 21:08:41,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1062 states. [2022-11-18 21:08:41,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1062 to 700. [2022-11-18 21:08:41,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 700 states, 538 states have (on average 1.4405204460966543) internal successors, (775), 541 states have internal predecessors, (775), 124 states have call successors, (124), 37 states have call predecessors, (124), 37 states have return successors, (124), 121 states have call predecessors, (124), 124 states have call successors, (124) [2022-11-18 21:08:41,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 700 states to 700 states and 1023 transitions. [2022-11-18 21:08:41,422 INFO L78 Accepts]: Start accepts. Automaton has 700 states and 1023 transitions. Word has length 59 [2022-11-18 21:08:41,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 21:08:41,422 INFO L495 AbstractCegarLoop]: Abstraction has 700 states and 1023 transitions. [2022-11-18 21:08:41,422 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-18 21:08:41,422 INFO L276 IsEmpty]: Start isEmpty. Operand 700 states and 1023 transitions. [2022-11-18 21:08:41,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-11-18 21:08:41,424 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 21:08:41,424 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-18 21:08:41,425 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-18 21:08:41,425 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 21:08:41,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 21:08:41,425 INFO L85 PathProgramCache]: Analyzing trace with hash -1405034612, now seen corresponding path program 1 times [2022-11-18 21:08:41,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 21:08:41,426 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428027580] [2022-11-18 21:08:41,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 21:08:41,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 21:08:41,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:08:41,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-18 21:08:41,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:08:41,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-18 21:08:41,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:08:41,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-11-18 21:08:41,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:08:41,667 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-18 21:08:41,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 21:08:41,667 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428027580] [2022-11-18 21:08:41,667 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [428027580] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 21:08:41,668 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 21:08:41,668 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-18 21:08:41,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338031321] [2022-11-18 21:08:41,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 21:08:41,670 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 21:08:41,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 21:08:41,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 21:08:41,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-18 21:08:41,671 INFO L87 Difference]: Start difference. First operand 700 states and 1023 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 3 states have internal predecessors, (49), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-18 21:08:41,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 21:08:41,795 INFO L93 Difference]: Finished difference Result 1307 states and 1936 transitions. [2022-11-18 21:08:41,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-18 21:08:41,796 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-18 21:08:41,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 21:08:41,799 INFO L225 Difference]: With dead ends: 1307 [2022-11-18 21:08:41,800 INFO L226 Difference]: Without dead ends: 720 [2022-11-18 21:08:41,802 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-18 21:08:41,802 INFO L413 NwaCegarLoop]: 258 mSDtfsCounter, 6 mSDsluCounter, 512 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 770 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-18 21:08:41,803 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 770 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-18 21:08:41,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 720 states. [2022-11-18 21:08:41,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 720 to 720. [2022-11-18 21:08:41,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 720 states, 554 states have (on average 1.4277978339350181) internal successors, (791), 557 states have internal predecessors, (791), 124 states have call successors, (124), 41 states have call predecessors, (124), 41 states have return successors, (124), 121 states have call predecessors, (124), 124 states have call successors, (124) [2022-11-18 21:08:41,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 720 states to 720 states and 1039 transitions. [2022-11-18 21:08:41,886 INFO L78 Accepts]: Start accepts. Automaton has 720 states and 1039 transitions. Word has length 60 [2022-11-18 21:08:41,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 21:08:41,886 INFO L495 AbstractCegarLoop]: Abstraction has 720 states and 1039 transitions. [2022-11-18 21:08:41,887 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-18 21:08:41,887 INFO L276 IsEmpty]: Start isEmpty. Operand 720 states and 1039 transitions. [2022-11-18 21:08:41,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-11-18 21:08:41,888 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 21:08:41,888 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-18 21:08:41,888 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-18 21:08:41,889 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 21:08:41,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 21:08:41,889 INFO L85 PathProgramCache]: Analyzing trace with hash -829990638, now seen corresponding path program 1 times [2022-11-18 21:08:41,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 21:08:41,890 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208135279] [2022-11-18 21:08:41,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 21:08:41,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 21:08:41,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:08:42,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-18 21:08:42,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:08:42,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-18 21:08:42,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:08:42,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-11-18 21:08:42,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:08:42,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-18 21:08:42,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:08:42,065 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-18 21:08:42,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 21:08:42,065 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208135279] [2022-11-18 21:08:42,065 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [208135279] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 21:08:42,066 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 21:08:42,066 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-18 21:08:42,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849449066] [2022-11-18 21:08:42,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 21:08:42,067 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 21:08:42,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 21:08:42,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 21:08:42,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-18 21:08:42,068 INFO L87 Difference]: Start difference. First operand 720 states and 1039 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 3 states have internal predecessors, (55), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-18 21:08:42,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 21:08:42,214 INFO L93 Difference]: Finished difference Result 1347 states and 1980 transitions. [2022-11-18 21:08:42,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-18 21:08:42,215 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-18 21:08:42,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 21:08:42,220 INFO L225 Difference]: With dead ends: 1347 [2022-11-18 21:08:42,220 INFO L226 Difference]: Without dead ends: 740 [2022-11-18 21:08:42,223 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-18 21:08:42,223 INFO L413 NwaCegarLoop]: 255 mSDtfsCounter, 6 mSDsluCounter, 501 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 756 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-18 21:08:42,224 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 756 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-18 21:08:42,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 740 states. [2022-11-18 21:08:42,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 740 to 740. [2022-11-18 21:08:42,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 740 states, 570 states have (on average 1.4157894736842105) internal successors, (807), 573 states have internal predecessors, (807), 124 states have call successors, (124), 45 states have call predecessors, (124), 45 states have return successors, (124), 121 states have call predecessors, (124), 124 states have call successors, (124) [2022-11-18 21:08:42,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 740 states to 740 states and 1055 transitions. [2022-11-18 21:08:42,321 INFO L78 Accepts]: Start accepts. Automaton has 740 states and 1055 transitions. Word has length 68 [2022-11-18 21:08:42,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 21:08:42,321 INFO L495 AbstractCegarLoop]: Abstraction has 740 states and 1055 transitions. [2022-11-18 21:08:42,322 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-18 21:08:42,322 INFO L276 IsEmpty]: Start isEmpty. Operand 740 states and 1055 transitions. [2022-11-18 21:08:42,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-11-18 21:08:42,323 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 21:08:42,324 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-18 21:08:42,324 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-18 21:08:42,324 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 21:08:42,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 21:08:42,325 INFO L85 PathProgramCache]: Analyzing trace with hash 102970172, now seen corresponding path program 1 times [2022-11-18 21:08:42,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 21:08:42,325 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570111121] [2022-11-18 21:08:42,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 21:08:42,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 21:08:42,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:08:42,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-18 21:08:42,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:08:42,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-18 21:08:42,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:08:42,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-11-18 21:08:42,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:08:42,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-18 21:08:42,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:08:42,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-11-18 21:08:42,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:08:42,494 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-18 21:08:42,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 21:08:42,495 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570111121] [2022-11-18 21:08:42,495 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [570111121] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 21:08:42,495 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 21:08:42,495 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-18 21:08:42,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717162664] [2022-11-18 21:08:42,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 21:08:42,496 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 21:08:42,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 21:08:42,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 21:08:42,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-18 21:08:42,497 INFO L87 Difference]: Start difference. First operand 740 states and 1055 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 3 states have internal predecessors, (61), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-11-18 21:08:42,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 21:08:42,626 INFO L93 Difference]: Finished difference Result 1383 states and 1996 transitions. [2022-11-18 21:08:42,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-18 21:08:42,627 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-18 21:08:42,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 21:08:42,631 INFO L225 Difference]: With dead ends: 1383 [2022-11-18 21:08:42,632 INFO L226 Difference]: Without dead ends: 756 [2022-11-18 21:08:42,634 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-18 21:08:42,634 INFO L413 NwaCegarLoop]: 260 mSDtfsCounter, 5 mSDsluCounter, 505 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 765 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-18 21:08:42,635 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 765 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-18 21:08:42,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 756 states. [2022-11-18 21:08:42,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 756 to 756. [2022-11-18 21:08:42,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 756 states, 582 states have (on average 1.407216494845361) internal successors, (819), 585 states have internal predecessors, (819), 124 states have call successors, (124), 49 states have call predecessors, (124), 49 states have return successors, (124), 121 states have call predecessors, (124), 124 states have call successors, (124) [2022-11-18 21:08:42,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 756 states to 756 states and 1067 transitions. [2022-11-18 21:08:42,725 INFO L78 Accepts]: Start accepts. Automaton has 756 states and 1067 transitions. Word has length 76 [2022-11-18 21:08:42,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 21:08:42,726 INFO L495 AbstractCegarLoop]: Abstraction has 756 states and 1067 transitions. [2022-11-18 21:08:42,726 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-18 21:08:42,726 INFO L276 IsEmpty]: Start isEmpty. Operand 756 states and 1067 transitions. [2022-11-18 21:08:42,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-11-18 21:08:42,727 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 21:08:42,728 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-18 21:08:42,728 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-18 21:08:42,728 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 21:08:42,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 21:08:42,729 INFO L85 PathProgramCache]: Analyzing trace with hash -1795537821, now seen corresponding path program 1 times [2022-11-18 21:08:42,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 21:08:42,729 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893915601] [2022-11-18 21:08:42,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 21:08:42,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 21:08:42,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:08:42,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-18 21:08:42,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:08:42,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-18 21:08:42,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:08:42,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-11-18 21:08:42,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:08:42,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-18 21:08:42,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:08:42,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-11-18 21:08:42,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:08:42,920 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-18 21:08:42,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 21:08:42,921 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893915601] [2022-11-18 21:08:42,921 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [893915601] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 21:08:42,921 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 21:08:42,921 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-18 21:08:42,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370304454] [2022-11-18 21:08:42,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 21:08:42,922 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 21:08:42,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 21:08:42,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 21:08:42,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-18 21:08:42,923 INFO L87 Difference]: Start difference. First operand 756 states and 1067 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 3 states have internal predecessors, (61), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-11-18 21:08:43,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 21:08:43,061 INFO L93 Difference]: Finished difference Result 1419 states and 2036 transitions. [2022-11-18 21:08:43,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-18 21:08:43,062 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-18 21:08:43,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 21:08:43,066 INFO L225 Difference]: With dead ends: 1419 [2022-11-18 21:08:43,066 INFO L226 Difference]: Without dead ends: 776 [2022-11-18 21:08:43,068 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-18 21:08:43,069 INFO L413 NwaCegarLoop]: 255 mSDtfsCounter, 6 mSDsluCounter, 501 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 756 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-18 21:08:43,069 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 756 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-18 21:08:43,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 776 states. [2022-11-18 21:08:43,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 776 to 776. [2022-11-18 21:08:43,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 776 states, 598 states have (on average 1.3963210702341138) internal successors, (835), 601 states have internal predecessors, (835), 124 states have call successors, (124), 53 states have call predecessors, (124), 53 states have return successors, (124), 121 states have call predecessors, (124), 124 states have call successors, (124) [2022-11-18 21:08:43,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 1083 transitions. [2022-11-18 21:08:43,161 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 1083 transitions. Word has length 76 [2022-11-18 21:08:43,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 21:08:43,162 INFO L495 AbstractCegarLoop]: Abstraction has 776 states and 1083 transitions. [2022-11-18 21:08:43,162 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-18 21:08:43,162 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 1083 transitions. [2022-11-18 21:08:43,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-11-18 21:08:43,164 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 21:08:43,164 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-18 21:08:43,165 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-18 21:08:43,165 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 21:08:43,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 21:08:43,165 INFO L85 PathProgramCache]: Analyzing trace with hash 1351818595, now seen corresponding path program 1 times [2022-11-18 21:08:43,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 21:08:43,166 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122719954] [2022-11-18 21:08:43,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 21:08:43,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 21:08:43,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:08:43,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-18 21:08:43,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:08:43,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-18 21:08:43,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:08:43,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-11-18 21:08:43,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:08:43,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-18 21:08:43,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:08:43,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-11-18 21:08:43,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:08:43,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-11-18 21:08:43,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:08:43,391 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-18 21:08:43,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 21:08:43,392 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122719954] [2022-11-18 21:08:43,392 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2122719954] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 21:08:43,392 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 21:08:43,392 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-18 21:08:43,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001476762] [2022-11-18 21:08:43,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 21:08:43,393 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 21:08:43,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 21:08:43,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 21:08:43,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-18 21:08:43,394 INFO L87 Difference]: Start difference. First operand 776 states and 1083 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 2 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-11-18 21:08:43,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 21:08:43,540 INFO L93 Difference]: Finished difference Result 1463 states and 2064 transitions. [2022-11-18 21:08:43,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-18 21:08:43,541 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-18 21:08:43,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 21:08:43,547 INFO L225 Difference]: With dead ends: 1463 [2022-11-18 21:08:43,547 INFO L226 Difference]: Without dead ends: 800 [2022-11-18 21:08:43,550 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-18 21:08:43,551 INFO L413 NwaCegarLoop]: 259 mSDtfsCounter, 7 mSDsluCounter, 508 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 767 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-18 21:08:43,551 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 767 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-18 21:08:43,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 800 states. [2022-11-18 21:08:43,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 800 to 800. [2022-11-18 21:08:43,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 800 states, 618 states have (on average 1.383495145631068) internal successors, (855), 621 states have internal predecessors, (855), 124 states have call successors, (124), 57 states have call predecessors, (124), 57 states have return successors, (124), 121 states have call predecessors, (124), 124 states have call successors, (124) [2022-11-18 21:08:43,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 800 states to 800 states and 1103 transitions. [2022-11-18 21:08:43,646 INFO L78 Accepts]: Start accepts. Automaton has 800 states and 1103 transitions. Word has length 84 [2022-11-18 21:08:43,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 21:08:43,647 INFO L495 AbstractCegarLoop]: Abstraction has 800 states and 1103 transitions. [2022-11-18 21:08:43,647 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-18 21:08:43,647 INFO L276 IsEmpty]: Start isEmpty. Operand 800 states and 1103 transitions. [2022-11-18 21:08:43,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-11-18 21:08:43,650 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 21:08:43,650 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-18 21:08:43,651 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-18 21:08:43,651 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 21:08:43,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 21:08:43,651 INFO L85 PathProgramCache]: Analyzing trace with hash 938140804, now seen corresponding path program 1 times [2022-11-18 21:08:43,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 21:08:43,651 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916226052] [2022-11-18 21:08:43,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 21:08:43,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 21:08:43,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:08:43,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-18 21:08:43,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:08:43,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-18 21:08:43,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:08:43,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-11-18 21:08:43,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:08:43,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-18 21:08:43,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:08:43,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-11-18 21:08:43,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:08:43,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-11-18 21:08:43,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:08:43,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-11-18 21:08:43,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:08:43,994 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-18 21:08:43,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 21:08:43,994 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916226052] [2022-11-18 21:08:43,995 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1916226052] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 21:08:43,995 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 21:08:43,995 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-18 21:08:43,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114548230] [2022-11-18 21:08:43,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 21:08:43,996 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-18 21:08:43,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 21:08:43,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-18 21:08:43,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-18 21:08:43,997 INFO L87 Difference]: Start difference. First operand 800 states and 1103 transitions. Second operand has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 6 states have internal predecessors, (66), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2022-11-18 21:08:44,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 21:08:44,554 INFO L93 Difference]: Finished difference Result 2323 states and 3253 transitions. [2022-11-18 21:08:44,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-18 21:08:44,555 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-18 21:08:44,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 21:08:44,564 INFO L225 Difference]: With dead ends: 2323 [2022-11-18 21:08:44,565 INFO L226 Difference]: Without dead ends: 1636 [2022-11-18 21:08:44,567 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-18 21:08:44,568 INFO L413 NwaCegarLoop]: 351 mSDtfsCounter, 327 mSDsluCounter, 1580 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 345 SdHoareTripleChecker+Valid, 1931 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-18 21:08:44,569 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [345 Valid, 1931 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-18 21:08:44,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1636 states. [2022-11-18 21:08:44,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1636 to 1084. [2022-11-18 21:08:44,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1084 states, 829 states have (on average 1.3715319662243668) internal successors, (1137), 834 states have internal predecessors, (1137), 172 states have call successors, (172), 82 states have call predecessors, (172), 82 states have return successors, (172), 167 states have call predecessors, (172), 172 states have call successors, (172) [2022-11-18 21:08:44,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1084 states to 1084 states and 1481 transitions. [2022-11-18 21:08:44,738 INFO L78 Accepts]: Start accepts. Automaton has 1084 states and 1481 transitions. Word has length 87 [2022-11-18 21:08:44,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 21:08:44,739 INFO L495 AbstractCegarLoop]: Abstraction has 1084 states and 1481 transitions. [2022-11-18 21:08:44,739 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-18 21:08:44,739 INFO L276 IsEmpty]: Start isEmpty. Operand 1084 states and 1481 transitions. [2022-11-18 21:08:44,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-11-18 21:08:44,741 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 21:08:44,741 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-18 21:08:44,741 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-18 21:08:44,741 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 21:08:44,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 21:08:44,742 INFO L85 PathProgramCache]: Analyzing trace with hash -262931398, now seen corresponding path program 1 times [2022-11-18 21:08:44,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 21:08:44,742 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432791117] [2022-11-18 21:08:44,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 21:08:44,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 21:08:44,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:08:44,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-18 21:08:44,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:08:44,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-18 21:08:44,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:08:44,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-11-18 21:08:44,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:08:44,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-18 21:08:44,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:08:44,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-11-18 21:08:44,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:08:44,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-11-18 21:08:44,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:08:44,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-11-18 21:08:44,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:08:44,954 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-18 21:08:44,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 21:08:44,955 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432791117] [2022-11-18 21:08:44,955 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [432791117] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 21:08:44,955 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 21:08:44,955 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-18 21:08:44,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816478] [2022-11-18 21:08:44,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 21:08:44,956 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 21:08:44,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 21:08:44,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 21:08:44,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-18 21:08:44,957 INFO L87 Difference]: Start difference. First operand 1084 states and 1481 transitions. Second operand has 4 states, 4 states have (on average 17.5) internal successors, (70), 3 states have internal predecessors, (70), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-11-18 21:08:45,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 21:08:45,110 INFO L93 Difference]: Finished difference Result 2011 states and 2772 transitions. [2022-11-18 21:08:45,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-18 21:08:45,111 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-18 21:08:45,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 21:08:45,116 INFO L225 Difference]: With dead ends: 2011 [2022-11-18 21:08:45,117 INFO L226 Difference]: Without dead ends: 1108 [2022-11-18 21:08:45,120 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-18 21:08:45,122 INFO L413 NwaCegarLoop]: 260 mSDtfsCounter, 5 mSDsluCounter, 505 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 765 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-18 21:08:45,122 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 765 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-18 21:08:45,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1108 states. [2022-11-18 21:08:45,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1108 to 1108. [2022-11-18 21:08:45,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1108 states, 847 states have (on average 1.3636363636363635) internal successors, (1155), 852 states have internal predecessors, (1155), 172 states have call successors, (172), 88 states have call predecessors, (172), 88 states have return successors, (172), 167 states have call predecessors, (172), 172 states have call successors, (172) [2022-11-18 21:08:45,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1108 states to 1108 states and 1499 transitions. [2022-11-18 21:08:45,284 INFO L78 Accepts]: Start accepts. Automaton has 1108 states and 1499 transitions. Word has length 91 [2022-11-18 21:08:45,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 21:08:45,285 INFO L495 AbstractCegarLoop]: Abstraction has 1108 states and 1499 transitions. [2022-11-18 21:08:45,285 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-18 21:08:45,285 INFO L276 IsEmpty]: Start isEmpty. Operand 1108 states and 1499 transitions. [2022-11-18 21:08:45,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2022-11-18 21:08:45,290 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 21:08:45,290 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-18 21:08:45,290 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-18 21:08:45,290 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 21:08:45,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 21:08:45,291 INFO L85 PathProgramCache]: Analyzing trace with hash -1171844932, now seen corresponding path program 1 times [2022-11-18 21:08:45,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 21:08:45,291 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759060858] [2022-11-18 21:08:45,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 21:08:45,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 21:08:45,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:08:45,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-18 21:08:45,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:08:45,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-18 21:08:45,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:08:45,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-11-18 21:08:45,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:08:45,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-18 21:08:45,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:08:45,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-11-18 21:08:45,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:08:45,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-11-18 21:08:45,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:08:45,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-11-18 21:08:45,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:08:45,630 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-18 21:08:45,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 21:08:45,630 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759060858] [2022-11-18 21:08:45,633 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1759060858] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 21:08:45,633 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 21:08:45,633 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-18 21:08:45,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102766155] [2022-11-18 21:08:45,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 21:08:45,634 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-18 21:08:45,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 21:08:45,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-18 21:08:45,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-18 21:08:45,635 INFO L87 Difference]: Start difference. First operand 1108 states and 1499 transitions. Second operand has 8 states, 6 states have (on average 11.0) internal successors, (66), 7 states have internal predecessors, (66), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) [2022-11-18 21:08:46,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 21:08:46,085 INFO L93 Difference]: Finished difference Result 1540 states and 2191 transitions. [2022-11-18 21:08:46,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-18 21:08:46,086 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-18 21:08:46,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 21:08:46,093 INFO L225 Difference]: With dead ends: 1540 [2022-11-18 21:08:46,094 INFO L226 Difference]: Without dead ends: 1538 [2022-11-18 21:08:46,095 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-18 21:08:46,095 INFO L413 NwaCegarLoop]: 448 mSDtfsCounter, 332 mSDsluCounter, 2090 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 358 SdHoareTripleChecker+Valid, 2538 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 21:08:46,096 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [358 Valid, 2538 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 21:08:46,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1538 states. [2022-11-18 21:08:46,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1538 to 1116. [2022-11-18 21:08:46,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1116 states, 851 states have (on average 1.3619271445358403) internal successors, (1159), 858 states have internal predecessors, (1159), 174 states have call successors, (174), 90 states have call predecessors, (174), 90 states have return successors, (174), 167 states have call predecessors, (174), 174 states have call successors, (174) [2022-11-18 21:08:46,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1116 states to 1116 states and 1507 transitions. [2022-11-18 21:08:46,255 INFO L78 Accepts]: Start accepts. Automaton has 1116 states and 1507 transitions. Word has length 90 [2022-11-18 21:08:46,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 21:08:46,255 INFO L495 AbstractCegarLoop]: Abstraction has 1116 states and 1507 transitions. [2022-11-18 21:08:46,256 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-18 21:08:46,256 INFO L276 IsEmpty]: Start isEmpty. Operand 1116 states and 1507 transitions. [2022-11-18 21:08:46,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-11-18 21:08:46,257 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 21:08:46,258 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-18 21:08:46,258 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-18 21:08:46,258 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 21:08:46,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 21:08:46,259 INFO L85 PathProgramCache]: Analyzing trace with hash 1049695796, now seen corresponding path program 1 times [2022-11-18 21:08:46,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 21:08:46,259 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787186004] [2022-11-18 21:08:46,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 21:08:46,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 21:08:46,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:08:46,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-18 21:08:46,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:08:46,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-18 21:08:46,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:08:46,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-11-18 21:08:46,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:08:46,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-18 21:08:46,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:08:46,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-11-18 21:08:46,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:08:46,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-11-18 21:08:46,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:08:46,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-11-18 21:08:46,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:08:46,430 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-18 21:08:46,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 21:08:46,430 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787186004] [2022-11-18 21:08:46,431 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [787186004] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 21:08:46,431 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 21:08:46,431 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-18 21:08:46,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511513974] [2022-11-18 21:08:46,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 21:08:46,432 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-18 21:08:46,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 21:08:46,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-18 21:08:46,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-18 21:08:46,433 INFO L87 Difference]: Start difference. First operand 1116 states and 1507 transitions. Second operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 6 states have internal predecessors, (69), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-11-18 21:08:46,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 21:08:46,945 INFO L93 Difference]: Finished difference Result 2214 states and 3052 transitions. [2022-11-18 21:08:46,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-18 21:08:46,946 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-18 21:08:46,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 21:08:46,954 INFO L225 Difference]: With dead ends: 2214 [2022-11-18 21:08:46,955 INFO L226 Difference]: Without dead ends: 1361 [2022-11-18 21:08:46,958 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-18 21:08:46,959 INFO L413 NwaCegarLoop]: 344 mSDtfsCounter, 374 mSDsluCounter, 1557 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 379 SdHoareTripleChecker+Valid, 1901 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-18 21:08:46,960 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [379 Valid, 1901 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-18 21:08:46,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1361 states. [2022-11-18 21:08:47,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1361 to 1121. [2022-11-18 21:08:47,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1121 states, 867 states have (on average 1.3517877739331026) internal successors, (1172), 879 states have internal predecessors, (1172), 162 states have call successors, (162), 91 states have call predecessors, (162), 91 states have return successors, (162), 150 states have call predecessors, (162), 162 states have call successors, (162) [2022-11-18 21:08:47,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1121 states to 1121 states and 1496 transitions. [2022-11-18 21:08:47,170 INFO L78 Accepts]: Start accepts. Automaton has 1121 states and 1496 transitions. Word has length 93 [2022-11-18 21:08:47,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 21:08:47,171 INFO L495 AbstractCegarLoop]: Abstraction has 1121 states and 1496 transitions. [2022-11-18 21:08:47,171 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-18 21:08:47,171 INFO L276 IsEmpty]: Start isEmpty. Operand 1121 states and 1496 transitions. [2022-11-18 21:08:47,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2022-11-18 21:08:47,173 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 21:08:47,173 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-18 21:08:47,173 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-18 21:08:47,173 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 21:08:47,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 21:08:47,174 INFO L85 PathProgramCache]: Analyzing trace with hash 82901354, now seen corresponding path program 1 times [2022-11-18 21:08:47,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 21:08:47,174 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901291922] [2022-11-18 21:08:47,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 21:08:47,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 21:08:47,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:08:47,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-18 21:08:47,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:08:47,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-18 21:08:47,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:08:47,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-11-18 21:08:47,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:08:47,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-18 21:08:47,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:08:47,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-11-18 21:08:47,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:08:47,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-11-18 21:08:47,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:08:47,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-11-18 21:08:47,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:08:47,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-11-18 21:08:47,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:08:47,512 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-18 21:08:47,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 21:08:47,512 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901291922] [2022-11-18 21:08:47,512 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [901291922] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 21:08:47,513 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 21:08:47,513 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-18 21:08:47,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077952000] [2022-11-18 21:08:47,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 21:08:47,514 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-18 21:08:47,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 21:08:47,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-18 21:08:47,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-18 21:08:47,515 INFO L87 Difference]: Start difference. First operand 1121 states and 1496 transitions. Second operand has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 6 states have internal predecessors, (68), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2022-11-18 21:08:48,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 21:08:48,028 INFO L93 Difference]: Finished difference Result 2267 states and 3109 transitions. [2022-11-18 21:08:48,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-18 21:08:48,029 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-18 21:08:48,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 21:08:48,037 INFO L225 Difference]: With dead ends: 2267 [2022-11-18 21:08:48,037 INFO L226 Difference]: Without dead ends: 1389 [2022-11-18 21:08:48,040 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-18 21:08:48,043 INFO L413 NwaCegarLoop]: 374 mSDtfsCounter, 289 mSDsluCounter, 1677 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 303 SdHoareTripleChecker+Valid, 2051 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 21:08:48,043 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [303 Valid, 2051 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 21:08:48,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1389 states. [2022-11-18 21:08:48,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1389 to 1011. [2022-11-18 21:08:48,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1011 states, 784 states have (on average 1.3545918367346939) internal successors, (1062), 794 states have internal predecessors, (1062), 145 states have call successors, (145), 81 states have call predecessors, (145), 81 states have return successors, (145), 135 states have call predecessors, (145), 145 states have call successors, (145) [2022-11-18 21:08:48,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1011 states to 1011 states and 1352 transitions. [2022-11-18 21:08:48,247 INFO L78 Accepts]: Start accepts. Automaton has 1011 states and 1352 transitions. Word has length 95 [2022-11-18 21:08:48,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 21:08:48,248 INFO L495 AbstractCegarLoop]: Abstraction has 1011 states and 1352 transitions. [2022-11-18 21:08:48,248 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-18 21:08:48,249 INFO L276 IsEmpty]: Start isEmpty. Operand 1011 states and 1352 transitions. [2022-11-18 21:08:48,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-11-18 21:08:48,250 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 21:08:48,250 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-18 21:08:48,250 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-18 21:08:48,251 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 21:08:48,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 21:08:48,251 INFO L85 PathProgramCache]: Analyzing trace with hash -914641030, now seen corresponding path program 1 times [2022-11-18 21:08:48,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 21:08:48,252 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925442708] [2022-11-18 21:08:48,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 21:08:48,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 21:08:48,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:08:48,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-18 21:08:48,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:08:48,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-18 21:08:48,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:08:48,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-11-18 21:08:48,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:08:48,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-18 21:08:48,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:08:48,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-11-18 21:08:48,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:08:48,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-11-18 21:08:48,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:08:48,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-11-18 21:08:48,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:08:48,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-11-18 21:08:48,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:08:48,614 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-18 21:08:48,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 21:08:48,614 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925442708] [2022-11-18 21:08:48,615 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [925442708] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 21:08:48,615 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 21:08:48,615 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-18 21:08:48,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745987359] [2022-11-18 21:08:48,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 21:08:48,617 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-18 21:08:48,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 21:08:48,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-18 21:08:48,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-18 21:08:48,618 INFO L87 Difference]: Start difference. First operand 1011 states and 1352 transitions. Second operand has 8 states, 8 states have (on average 9.125) internal successors, (73), 7 states have internal predecessors, (73), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2022-11-18 21:08:49,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 21:08:49,635 INFO L93 Difference]: Finished difference Result 2326 states and 3198 transitions. [2022-11-18 21:08:49,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-18 21:08:49,636 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-18 21:08:49,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 21:08:49,643 INFO L225 Difference]: With dead ends: 2326 [2022-11-18 21:08:49,643 INFO L226 Difference]: Without dead ends: 1478 [2022-11-18 21:08:49,646 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-18 21:08:49,646 INFO L413 NwaCegarLoop]: 429 mSDtfsCounter, 800 mSDsluCounter, 1382 mSDsCounter, 0 mSdLazyCounter, 394 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 806 SdHoareTripleChecker+Valid, 1811 SdHoareTripleChecker+Invalid, 518 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 394 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-18 21:08:49,647 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [806 Valid, 1811 Invalid, 518 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 394 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-18 21:08:49,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1478 states. [2022-11-18 21:08:49,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1478 to 1027. [2022-11-18 21:08:49,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1027 states, 792 states have (on average 1.332070707070707) internal successors, (1055), 803 states have internal predecessors, (1055), 148 states have call successors, (148), 86 states have call predecessors, (148), 86 states have return successors, (148), 137 states have call predecessors, (148), 148 states have call successors, (148) [2022-11-18 21:08:49,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1027 states to 1027 states and 1351 transitions. [2022-11-18 21:08:49,838 INFO L78 Accepts]: Start accepts. Automaton has 1027 states and 1351 transitions. Word has length 96 [2022-11-18 21:08:49,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 21:08:49,839 INFO L495 AbstractCegarLoop]: Abstraction has 1027 states and 1351 transitions. [2022-11-18 21:08:49,839 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-18 21:08:49,839 INFO L276 IsEmpty]: Start isEmpty. Operand 1027 states and 1351 transitions. [2022-11-18 21:08:49,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-11-18 21:08:49,841 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 21:08:49,841 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 21:08:49,841 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-18 21:08:49,841 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 21:08:49,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 21:08:49,842 INFO L85 PathProgramCache]: Analyzing trace with hash 1010886925, now seen corresponding path program 1 times [2022-11-18 21:08:49,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 21:08:49,842 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523508648] [2022-11-18 21:08:49,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 21:08:49,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 21:08:49,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:08:49,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-18 21:08:49,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:08:49,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-18 21:08:49,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:08:49,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-18 21:08:49,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:08:49,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-11-18 21:08:49,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:08:49,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-11-18 21:08:49,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:08:49,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-11-18 21:08:49,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:08:50,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-11-18 21:08:50,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:08:50,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-11-18 21:08:50,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:08:50,028 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-18 21:08:50,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 21:08:50,028 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523508648] [2022-11-18 21:08:50,029 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [523508648] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 21:08:50,029 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 21:08:50,029 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-18 21:08:50,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116924374] [2022-11-18 21:08:50,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 21:08:50,030 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 21:08:50,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 21:08:50,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 21:08:50,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-18 21:08:50,031 INFO L87 Difference]: Start difference. First operand 1027 states and 1351 transitions. Second operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-11-18 21:08:50,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 21:08:50,610 INFO L93 Difference]: Finished difference Result 2890 states and 3877 transitions. [2022-11-18 21:08:50,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-18 21:08:50,611 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-18 21:08:50,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 21:08:50,620 INFO L225 Difference]: With dead ends: 2890 [2022-11-18 21:08:50,621 INFO L226 Difference]: Without dead ends: 2077 [2022-11-18 21:08:50,623 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-18 21:08:50,624 INFO L413 NwaCegarLoop]: 455 mSDtfsCounter, 375 mSDsluCounter, 646 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 375 SdHoareTripleChecker+Valid, 1101 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 21:08:50,625 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [375 Valid, 1101 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 21:08:50,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2077 states. [2022-11-18 21:08:50,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2077 to 1772. [2022-11-18 21:08:50,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1772 states, 1347 states have (on average 1.325909428359317) internal successors, (1786), 1366 states have internal predecessors, (1786), 272 states have call successors, (272), 152 states have call predecessors, (272), 152 states have return successors, (272), 253 states have call predecessors, (272), 272 states have call successors, (272) [2022-11-18 21:08:50,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1772 states to 1772 states and 2330 transitions. [2022-11-18 21:08:50,970 INFO L78 Accepts]: Start accepts. Automaton has 1772 states and 2330 transitions. Word has length 97 [2022-11-18 21:08:50,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 21:08:50,971 INFO L495 AbstractCegarLoop]: Abstraction has 1772 states and 2330 transitions. [2022-11-18 21:08:50,971 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-18 21:08:50,971 INFO L276 IsEmpty]: Start isEmpty. Operand 1772 states and 2330 transitions. [2022-11-18 21:08:50,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-11-18 21:08:50,973 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 21:08:50,973 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-18 21:08:50,973 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-18 21:08:50,974 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 21:08:50,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 21:08:50,974 INFO L85 PathProgramCache]: Analyzing trace with hash 1421619842, now seen corresponding path program 1 times [2022-11-18 21:08:50,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 21:08:50,975 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460603501] [2022-11-18 21:08:50,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 21:08:50,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 21:08:51,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:08:51,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-18 21:08:51,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:08:51,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-18 21:08:51,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:08:51,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-18 21:08:51,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:08:51,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-11-18 21:08:51,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:08:51,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-11-18 21:08:51,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:08:51,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-11-18 21:08:51,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:08:51,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-11-18 21:08:51,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:08:51,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-11-18 21:08:51,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:08:51,338 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-18 21:08:51,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 21:08:51,338 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460603501] [2022-11-18 21:08:51,339 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1460603501] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 21:08:51,339 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 21:08:51,339 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-18 21:08:51,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924219967] [2022-11-18 21:08:51,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 21:08:51,341 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-18 21:08:51,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 21:08:51,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-18 21:08:51,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-18 21:08:51,342 INFO L87 Difference]: Start difference. First operand 1772 states and 2330 transitions. Second operand has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 6 states have internal predecessors, (76), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2022-11-18 21:08:52,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 21:08:52,643 INFO L93 Difference]: Finished difference Result 3933 states and 5306 transitions. [2022-11-18 21:08:52,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-18 21:08:52,644 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-18 21:08:52,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 21:08:52,655 INFO L225 Difference]: With dead ends: 3933 [2022-11-18 21:08:52,655 INFO L226 Difference]: Without dead ends: 2457 [2022-11-18 21:08:52,659 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-18 21:08:52,660 INFO L413 NwaCegarLoop]: 470 mSDtfsCounter, 702 mSDsluCounter, 1554 mSDsCounter, 0 mSdLazyCounter, 397 mSolverCounterSat, 195 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 705 SdHoareTripleChecker+Valid, 2024 SdHoareTripleChecker+Invalid, 592 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 195 IncrementalHoareTripleChecker+Valid, 397 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-18 21:08:52,660 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [705 Valid, 2024 Invalid, 592 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [195 Valid, 397 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-18 21:08:52,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2457 states. [2022-11-18 21:08:53,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2457 to 1797. [2022-11-18 21:08:53,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1797 states, 1359 states have (on average 1.3200883002207506) internal successors, (1794), 1379 states have internal predecessors, (1794), 280 states have call successors, (280), 157 states have call predecessors, (280), 157 states have return successors, (280), 260 states have call predecessors, (280), 280 states have call successors, (280) [2022-11-18 21:08:53,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1797 states to 1797 states and 2354 transitions. [2022-11-18 21:08:53,056 INFO L78 Accepts]: Start accepts. Automaton has 1797 states and 2354 transitions. Word has length 99 [2022-11-18 21:08:53,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 21:08:53,056 INFO L495 AbstractCegarLoop]: Abstraction has 1797 states and 2354 transitions. [2022-11-18 21:08:53,057 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-18 21:08:53,057 INFO L276 IsEmpty]: Start isEmpty. Operand 1797 states and 2354 transitions. [2022-11-18 21:08:53,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-11-18 21:08:53,059 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 21:08:53,059 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-18 21:08:53,059 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-11-18 21:08:53,059 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 21:08:53,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 21:08:53,060 INFO L85 PathProgramCache]: Analyzing trace with hash 506581735, now seen corresponding path program 1 times [2022-11-18 21:08:53,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 21:08:53,060 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914423287] [2022-11-18 21:08:53,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 21:08:53,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 21:08:53,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:08:53,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-18 21:08:53,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:08:53,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-18 21:08:53,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:08:53,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-11-18 21:08:53,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:08:53,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-11-18 21:08:53,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:08:53,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-11-18 21:08:53,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:08:53,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-11-18 21:08:53,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:08:53,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-11-18 21:08:53,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:08:53,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-11-18 21:08:53,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:08:53,220 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-18 21:08:53,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 21:08:53,221 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914423287] [2022-11-18 21:08:53,221 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1914423287] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 21:08:53,221 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 21:08:53,221 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-18 21:08:53,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598195851] [2022-11-18 21:08:53,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 21:08:53,222 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 21:08:53,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 21:08:53,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 21:08:53,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-18 21:08:53,223 INFO L87 Difference]: Start difference. First operand 1797 states and 2354 transitions. Second operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-11-18 21:08:54,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 21:08:54,110 INFO L93 Difference]: Finished difference Result 4664 states and 6167 transitions. [2022-11-18 21:08:54,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-18 21:08:54,111 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-18 21:08:54,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 21:08:54,130 INFO L225 Difference]: With dead ends: 4664 [2022-11-18 21:08:54,130 INFO L226 Difference]: Without dead ends: 3204 [2022-11-18 21:08:54,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-18 21:08:54,137 INFO L413 NwaCegarLoop]: 471 mSDtfsCounter, 402 mSDsluCounter, 680 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 402 SdHoareTripleChecker+Valid, 1151 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 21:08:54,139 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [402 Valid, 1151 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 21:08:54,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3204 states. [2022-11-18 21:08:54,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3204 to 2818. [2022-11-18 21:08:54,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2818 states, 2105 states have (on average 1.3116389548693588) internal successors, (2761), 2136 states have internal predecessors, (2761), 460 states have call successors, (460), 252 states have call predecessors, (460), 252 states have return successors, (460), 429 states have call predecessors, (460), 460 states have call successors, (460) [2022-11-18 21:08:54,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2818 states to 2818 states and 3681 transitions. [2022-11-18 21:08:54,709 INFO L78 Accepts]: Start accepts. Automaton has 2818 states and 3681 transitions. Word has length 101 [2022-11-18 21:08:54,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 21:08:54,710 INFO L495 AbstractCegarLoop]: Abstraction has 2818 states and 3681 transitions. [2022-11-18 21:08:54,711 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-18 21:08:54,711 INFO L276 IsEmpty]: Start isEmpty. Operand 2818 states and 3681 transitions. [2022-11-18 21:08:54,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-11-18 21:08:54,714 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 21:08:54,715 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-18 21:08:54,715 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-11-18 21:08:54,715 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 21:08:54,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 21:08:54,716 INFO L85 PathProgramCache]: Analyzing trace with hash -1826960265, now seen corresponding path program 1 times [2022-11-18 21:08:54,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 21:08:54,716 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101528063] [2022-11-18 21:08:54,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 21:08:54,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 21:08:54,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:08:54,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-18 21:08:54,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:08:54,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-18 21:08:54,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:08:54,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-18 21:08:54,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:08:54,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-18 21:08:54,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:08:54,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-18 21:08:54,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:08:54,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-11-18 21:08:54,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:08:54,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-11-18 21:08:54,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:08:54,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-11-18 21:08:54,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:08:54,851 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-18 21:08:54,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 21:08:54,851 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101528063] [2022-11-18 21:08:54,852 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1101528063] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 21:08:54,852 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 21:08:54,852 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-18 21:08:54,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007523817] [2022-11-18 21:08:54,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 21:08:54,854 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 21:08:54,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 21:08:54,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 21:08:54,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-18 21:08:54,855 INFO L87 Difference]: Start difference. First operand 2818 states and 3681 transitions. Second operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-11-18 21:08:55,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 21:08:55,810 INFO L93 Difference]: Finished difference Result 6670 states and 8777 transitions. [2022-11-18 21:08:55,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-18 21:08:55,810 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-18 21:08:55,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 21:08:55,836 INFO L225 Difference]: With dead ends: 6670 [2022-11-18 21:08:55,837 INFO L226 Difference]: Without dead ends: 4309 [2022-11-18 21:08:55,844 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-18 21:08:55,845 INFO L413 NwaCegarLoop]: 479 mSDtfsCounter, 376 mSDsluCounter, 659 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 376 SdHoareTripleChecker+Valid, 1138 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 21:08:55,845 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [376 Valid, 1138 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 21:08:55,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4309 states. [2022-11-18 21:08:56,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4309 to 4035. [2022-11-18 21:08:56,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4035 states, 2998 states have (on average 1.3082054703135424) internal successors, (3922), 3042 states have internal predecessors, (3922), 672 states have call successors, (672), 364 states have call predecessors, (672), 364 states have return successors, (672), 628 states have call predecessors, (672), 672 states have call successors, (672) [2022-11-18 21:08:56,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4035 states to 4035 states and 5266 transitions. [2022-11-18 21:08:56,598 INFO L78 Accepts]: Start accepts. Automaton has 4035 states and 5266 transitions. Word has length 101 [2022-11-18 21:08:56,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 21:08:56,599 INFO L495 AbstractCegarLoop]: Abstraction has 4035 states and 5266 transitions. [2022-11-18 21:08:56,599 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-18 21:08:56,599 INFO L276 IsEmpty]: Start isEmpty. Operand 4035 states and 5266 transitions. [2022-11-18 21:08:56,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2022-11-18 21:08:56,601 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 21:08:56,602 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-18 21:08:56,602 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-11-18 21:08:56,602 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 21:08:56,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 21:08:56,603 INFO L85 PathProgramCache]: Analyzing trace with hash 1131002330, now seen corresponding path program 1 times [2022-11-18 21:08:56,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 21:08:56,603 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462946987] [2022-11-18 21:08:56,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 21:08:56,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 21:08:56,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:08:56,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-18 21:08:56,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:08:56,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-18 21:08:56,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:08:56,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-11-18 21:08:56,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:08:56,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-11-18 21:08:56,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:08:56,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-11-18 21:08:56,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:08:56,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-11-18 21:08:56,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:08:56,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-11-18 21:08:56,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:08:56,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-11-18 21:08:56,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:08:56,673 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-18 21:08:56,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 21:08:56,673 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462946987] [2022-11-18 21:08:56,674 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1462946987] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 21:08:56,674 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 21:08:56,674 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-18 21:08:56,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697691588] [2022-11-18 21:08:56,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 21:08:56,675 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 21:08:56,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 21:08:56,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 21:08:56,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 21:08:56,676 INFO L87 Difference]: Start difference. First operand 4035 states and 5266 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-11-18 21:08:57,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 21:08:57,995 INFO L93 Difference]: Finished difference Result 9107 states and 12324 transitions. [2022-11-18 21:08:57,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 21:08:57,996 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-18 21:08:57,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 21:08:58,026 INFO L225 Difference]: With dead ends: 9107 [2022-11-18 21:08:58,027 INFO L226 Difference]: Without dead ends: 5426 [2022-11-18 21:08:58,035 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-18 21:08:58,036 INFO L413 NwaCegarLoop]: 408 mSDtfsCounter, 124 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 633 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 21:08:58,037 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 633 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 21:08:58,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5426 states. [2022-11-18 21:08:58,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5426 to 4041. [2022-11-18 21:08:58,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4041 states, 3004 states have (on average 1.307589880159787) internal successors, (3928), 3048 states have internal predecessors, (3928), 672 states have call successors, (672), 364 states have call predecessors, (672), 364 states have return successors, (672), 628 states have call predecessors, (672), 672 states have call successors, (672) [2022-11-18 21:08:58,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4041 states to 4041 states and 5272 transitions. [2022-11-18 21:08:58,883 INFO L78 Accepts]: Start accepts. Automaton has 4041 states and 5272 transitions. Word has length 102 [2022-11-18 21:08:58,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 21:08:58,884 INFO L495 AbstractCegarLoop]: Abstraction has 4041 states and 5272 transitions. [2022-11-18 21:08:58,884 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-18 21:08:58,884 INFO L276 IsEmpty]: Start isEmpty. Operand 4041 states and 5272 transitions. [2022-11-18 21:08:58,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-11-18 21:08:58,887 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 21:08:58,887 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-18 21:08:58,887 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-11-18 21:08:58,888 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 21:08:58,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 21:08:58,888 INFO L85 PathProgramCache]: Analyzing trace with hash -1347241870, now seen corresponding path program 1 times [2022-11-18 21:08:58,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 21:08:58,889 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590972050] [2022-11-18 21:08:58,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 21:08:58,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 21:08:58,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:08:59,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-18 21:08:59,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:08:59,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-18 21:08:59,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:08:59,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-18 21:08:59,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:08:59,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-18 21:08:59,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:08:59,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-18 21:08:59,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:08:59,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-11-18 21:08:59,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:08:59,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-11-18 21:08:59,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:08:59,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-11-18 21:08:59,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:08:59,055 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-18 21:08:59,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 21:08:59,055 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590972050] [2022-11-18 21:08:59,055 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [590972050] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 21:08:59,056 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 21:08:59,056 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-18 21:08:59,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780051324] [2022-11-18 21:08:59,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 21:08:59,057 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 21:08:59,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 21:08:59,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 21:08:59,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-18 21:08:59,058 INFO L87 Difference]: Start difference. First operand 4041 states and 5272 transitions. Second operand has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-11-18 21:08:59,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 21:08:59,980 INFO L93 Difference]: Finished difference Result 8489 states and 11336 transitions. [2022-11-18 21:08:59,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-18 21:08:59,983 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-18 21:08:59,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 21:09:00,007 INFO L225 Difference]: With dead ends: 8489 [2022-11-18 21:09:00,007 INFO L226 Difference]: Without dead ends: 4524 [2022-11-18 21:09:00,017 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-18 21:09:00,017 INFO L413 NwaCegarLoop]: 295 mSDtfsCounter, 264 mSDsluCounter, 495 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 289 SdHoareTripleChecker+Valid, 790 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-18 21:09:00,018 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [289 Valid, 790 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-18 21:09:00,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4524 states. [2022-11-18 21:09:00,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4524 to 3686. [2022-11-18 21:09:00,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3686 states, 2732 states have (on average 1.3177159590043923) internal successors, (3600), 2766 states have internal predecessors, (3600), 620 states have call successors, (620), 333 states have call predecessors, (620), 333 states have return successors, (620), 586 states have call predecessors, (620), 620 states have call successors, (620) [2022-11-18 21:09:00,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3686 states to 3686 states and 4840 transitions. [2022-11-18 21:09:00,800 INFO L78 Accepts]: Start accepts. Automaton has 3686 states and 4840 transitions. Word has length 103 [2022-11-18 21:09:00,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 21:09:00,801 INFO L495 AbstractCegarLoop]: Abstraction has 3686 states and 4840 transitions. [2022-11-18 21:09:00,801 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-18 21:09:00,801 INFO L276 IsEmpty]: Start isEmpty. Operand 3686 states and 4840 transitions. [2022-11-18 21:09:00,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2022-11-18 21:09:00,804 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 21:09:00,804 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-18 21:09:00,804 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-11-18 21:09:00,804 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 21:09:00,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 21:09:00,805 INFO L85 PathProgramCache]: Analyzing trace with hash -2076713750, now seen corresponding path program 1 times [2022-11-18 21:09:00,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 21:09:00,805 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896076529] [2022-11-18 21:09:00,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 21:09:00,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 21:09:00,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:09:00,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-18 21:09:00,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:09:00,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-18 21:09:00,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:09:00,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-11-18 21:09:00,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:09:00,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-11-18 21:09:00,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:09:00,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-11-18 21:09:00,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:09:00,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-11-18 21:09:00,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:09:00,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-11-18 21:09:00,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:09:00,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-11-18 21:09:00,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:09:00,892 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-18 21:09:00,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 21:09:00,893 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896076529] [2022-11-18 21:09:00,893 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [896076529] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 21:09:00,893 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 21:09:00,893 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-18 21:09:00,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233921218] [2022-11-18 21:09:00,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 21:09:00,894 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 21:09:00,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 21:09:00,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 21:09:00,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 21:09:00,895 INFO L87 Difference]: Start difference. First operand 3686 states and 4840 transitions. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-11-18 21:09:02,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 21:09:02,057 INFO L93 Difference]: Finished difference Result 8085 states and 10894 transitions. [2022-11-18 21:09:02,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 21:09:02,057 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-18 21:09:02,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 21:09:02,073 INFO L225 Difference]: With dead ends: 8085 [2022-11-18 21:09:02,074 INFO L226 Difference]: Without dead ends: 4580 [2022-11-18 21:09:02,081 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-18 21:09:02,081 INFO L413 NwaCegarLoop]: 391 mSDtfsCounter, 124 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 617 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 21:09:02,083 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 617 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 21:09:02,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4580 states. [2022-11-18 21:09:02,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4580 to 3696. [2022-11-18 21:09:02,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3696 states, 2742 states have (on average 1.3165572574762947) internal successors, (3610), 2776 states have internal predecessors, (3610), 620 states have call successors, (620), 333 states have call predecessors, (620), 333 states have return successors, (620), 586 states have call predecessors, (620), 620 states have call successors, (620) [2022-11-18 21:09:02,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3696 states to 3696 states and 4850 transitions. [2022-11-18 21:09:02,776 INFO L78 Accepts]: Start accepts. Automaton has 3696 states and 4850 transitions. Word has length 104 [2022-11-18 21:09:02,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 21:09:02,777 INFO L495 AbstractCegarLoop]: Abstraction has 3696 states and 4850 transitions. [2022-11-18 21:09:02,777 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-18 21:09:02,777 INFO L276 IsEmpty]: Start isEmpty. Operand 3696 states and 4850 transitions. [2022-11-18 21:09:02,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2022-11-18 21:09:02,779 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 21:09:02,779 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-18 21:09:02,780 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-11-18 21:09:02,780 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 21:09:02,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 21:09:02,780 INFO L85 PathProgramCache]: Analyzing trace with hash -2022352177, now seen corresponding path program 1 times [2022-11-18 21:09:02,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 21:09:02,781 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975113394] [2022-11-18 21:09:02,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 21:09:02,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 21:09:02,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:09:02,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-18 21:09:02,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:09:02,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-18 21:09:02,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:09:02,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-11-18 21:09:02,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:09:02,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-11-18 21:09:02,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:09:02,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-11-18 21:09:02,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:09:02,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-11-18 21:09:02,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:09:02,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-11-18 21:09:02,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:09:02,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-11-18 21:09:02,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:09:02,951 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-18 21:09:02,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 21:09:02,952 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975113394] [2022-11-18 21:09:02,952 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [975113394] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 21:09:02,952 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 21:09:02,952 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-18 21:09:02,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474617714] [2022-11-18 21:09:02,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 21:09:02,953 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 21:09:02,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 21:09:02,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 21:09:02,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-18 21:09:02,954 INFO L87 Difference]: Start difference. First operand 3696 states and 4850 transitions. Second operand has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-11-18 21:09:03,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 21:09:03,880 INFO L93 Difference]: Finished difference Result 8067 states and 10862 transitions. [2022-11-18 21:09:03,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-18 21:09:03,881 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-18 21:09:03,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 21:09:03,899 INFO L225 Difference]: With dead ends: 8067 [2022-11-18 21:09:03,899 INFO L226 Difference]: Without dead ends: 4490 [2022-11-18 21:09:03,908 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-18 21:09:03,908 INFO L413 NwaCegarLoop]: 306 mSDtfsCounter, 212 mSDsluCounter, 501 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 807 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-18 21:09:03,909 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 807 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-18 21:09:03,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4490 states. [2022-11-18 21:09:04,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4490 to 2785. [2022-11-18 21:09:04,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2785 states, 2065 states have (on average 1.3113801452784504) internal successors, (2708), 2084 states have internal predecessors, (2708), 469 states have call successors, (469), 250 states have call predecessors, (469), 250 states have return successors, (469), 450 states have call predecessors, (469), 469 states have call successors, (469) [2022-11-18 21:09:04,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2785 states to 2785 states and 3646 transitions. [2022-11-18 21:09:04,529 INFO L78 Accepts]: Start accepts. Automaton has 2785 states and 3646 transitions. Word has length 104 [2022-11-18 21:09:04,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 21:09:04,530 INFO L495 AbstractCegarLoop]: Abstraction has 2785 states and 3646 transitions. [2022-11-18 21:09:04,530 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-18 21:09:04,530 INFO L276 IsEmpty]: Start isEmpty. Operand 2785 states and 3646 transitions. [2022-11-18 21:09:04,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2022-11-18 21:09:04,535 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 21:09:04,535 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 21:09:04,535 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-11-18 21:09:04,536 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 21:09:04,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 21:09:04,536 INFO L85 PathProgramCache]: Analyzing trace with hash 1445089110, now seen corresponding path program 1 times [2022-11-18 21:09:04,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 21:09:04,536 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473099996] [2022-11-18 21:09:04,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 21:09:04,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 21:09:04,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:09:04,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-18 21:09:04,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:09:04,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-18 21:09:04,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:09:04,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-11-18 21:09:04,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:09:04,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-18 21:09:04,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:09:04,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-11-18 21:09:04,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:09:04,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-11-18 21:09:04,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:09:04,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-11-18 21:09:04,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:09:04,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-11-18 21:09:04,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:09:04,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-11-18 21:09:04,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:09:04,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-11-18 21:09:04,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:09:04,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-11-18 21:09:04,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:09:04,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-11-18 21:09:04,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:09:04,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-11-18 21:09:04,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:09:04,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-11-18 21:09:04,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:09:04,896 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-18 21:09:04,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 21:09:04,897 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473099996] [2022-11-18 21:09:04,897 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1473099996] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 21:09:04,897 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [862865331] [2022-11-18 21:09:04,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 21:09:04,898 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 21:09:04,898 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a03a397-50b2-4fa7-9e70-08fdf5753c02/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 21:09:04,902 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a03a397-50b2-4fa7-9e70-08fdf5753c02/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 21:09:04,920 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a03a397-50b2-4fa7-9e70-08fdf5753c02/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-18 21:09:05,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:09:05,116 INFO L263 TraceCheckSpWp]: Trace formula consists of 702 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-18 21:09:05,133 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 21:09:05,436 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-18 21:09:05,436 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 21:09:05,637 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-18 21:09:05,638 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [862865331] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 21:09:05,638 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 21:09:05,638 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2022-11-18 21:09:05,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373693598] [2022-11-18 21:09:05,639 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 21:09:05,639 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-18 21:09:05,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 21:09:05,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-18 21:09:05,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2022-11-18 21:09:05,641 INFO L87 Difference]: Start difference. First operand 2785 states and 3646 transitions. Second operand has 13 states, 13 states have (on average 15.384615384615385) internal successors, (200), 12 states have internal predecessors, (200), 6 states have call successors, (37), 4 states have call predecessors, (37), 6 states have return successors, (37), 7 states have call predecessors, (37), 6 states have call successors, (37) [2022-11-18 21:09:11,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 21:09:11,286 INFO L93 Difference]: Finished difference Result 9108 states and 12776 transitions. [2022-11-18 21:09:11,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-11-18 21:09:11,287 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 15.384615384615385) internal successors, (200), 12 states have internal predecessors, (200), 6 states have call successors, (37), 4 states have call predecessors, (37), 6 states have return successors, (37), 7 states have call predecessors, (37), 6 states have call successors, (37) Word has length 154 [2022-11-18 21:09:11,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 21:09:11,312 INFO L225 Difference]: With dead ends: 9108 [2022-11-18 21:09:11,313 INFO L226 Difference]: Without dead ends: 6573 [2022-11-18 21:09:11,320 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 380 GetRequests, 337 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 499 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=383, Invalid=1509, Unknown=0, NotChecked=0, Total=1892 [2022-11-18 21:09:11,320 INFO L413 NwaCegarLoop]: 291 mSDtfsCounter, 3275 mSDsluCounter, 2024 mSDsCounter, 0 mSdLazyCounter, 1342 mSolverCounterSat, 1215 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3275 SdHoareTripleChecker+Valid, 2315 SdHoareTripleChecker+Invalid, 2557 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1215 IncrementalHoareTripleChecker+Valid, 1342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-11-18 21:09:11,321 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3275 Valid, 2315 Invalid, 2557 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1215 Valid, 1342 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-11-18 21:09:11,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6573 states. [2022-11-18 21:09:12,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6573 to 3536. [2022-11-18 21:09:12,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3536 states, 2627 states have (on average 1.3022459078797106) internal successors, (3421), 2651 states have internal predecessors, (3421), 585 states have call successors, (585), 323 states have call predecessors, (585), 323 states have return successors, (585), 561 states have call predecessors, (585), 585 states have call successors, (585) [2022-11-18 21:09:12,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3536 states to 3536 states and 4591 transitions. [2022-11-18 21:09:12,235 INFO L78 Accepts]: Start accepts. Automaton has 3536 states and 4591 transitions. Word has length 154 [2022-11-18 21:09:12,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 21:09:12,236 INFO L495 AbstractCegarLoop]: Abstraction has 3536 states and 4591 transitions. [2022-11-18 21:09:12,236 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 15.384615384615385) internal successors, (200), 12 states have internal predecessors, (200), 6 states have call successors, (37), 4 states have call predecessors, (37), 6 states have return successors, (37), 7 states have call predecessors, (37), 6 states have call successors, (37) [2022-11-18 21:09:12,237 INFO L276 IsEmpty]: Start isEmpty. Operand 3536 states and 4591 transitions. [2022-11-18 21:09:12,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2022-11-18 21:09:12,244 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 21:09:12,244 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 21:09:12,260 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a03a397-50b2-4fa7-9e70-08fdf5753c02/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-18 21:09:12,452 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a03a397-50b2-4fa7-9e70-08fdf5753c02/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-11-18 21:09:12,452 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 21:09:12,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 21:09:12,453 INFO L85 PathProgramCache]: Analyzing trace with hash 124995051, now seen corresponding path program 1 times [2022-11-18 21:09:12,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 21:09:12,453 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139390503] [2022-11-18 21:09:12,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 21:09:12,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 21:09:12,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:09:12,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-18 21:09:12,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:09:12,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-18 21:09:12,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:09:12,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-11-18 21:09:12,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:09:12,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-18 21:09:12,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:09:12,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-11-18 21:09:12,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:09:12,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-11-18 21:09:12,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:09:12,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-11-18 21:09:12,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:09:12,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-11-18 21:09:12,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:09:12,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-11-18 21:09:12,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:09:12,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-11-18 21:09:12,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:09:12,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-11-18 21:09:12,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:09:12,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-11-18 21:09:12,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:09:12,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-11-18 21:09:12,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:09:12,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-11-18 21:09:12,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:09:12,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2022-11-18 21:09:12,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:09:12,678 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-18 21:09:12,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 21:09:12,678 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139390503] [2022-11-18 21:09:12,678 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1139390503] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 21:09:12,679 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 21:09:12,679 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-18 21:09:12,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386903910] [2022-11-18 21:09:12,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 21:09:12,679 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-18 21:09:12,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 21:09:12,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-18 21:09:12,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-18 21:09:12,681 INFO L87 Difference]: Start difference. First operand 3536 states and 4591 transitions. Second operand has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 6 states have internal predecessors, (93), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) [2022-11-18 21:09:15,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 21:09:15,256 INFO L93 Difference]: Finished difference Result 12130 states and 16505 transitions. [2022-11-18 21:09:15,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-18 21:09:15,258 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 6 states have internal predecessors, (93), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) Word has length 163 [2022-11-18 21:09:15,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 21:09:15,294 INFO L225 Difference]: With dead ends: 12130 [2022-11-18 21:09:15,294 INFO L226 Difference]: Without dead ends: 8950 [2022-11-18 21:09:15,303 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-18 21:09:15,303 INFO L413 NwaCegarLoop]: 449 mSDtfsCounter, 638 mSDsluCounter, 1989 mSDsCounter, 0 mSdLazyCounter, 264 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 657 SdHoareTripleChecker+Valid, 2438 SdHoareTripleChecker+Invalid, 366 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-18 21:09:15,304 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [657 Valid, 2438 Invalid, 366 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 264 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-18 21:09:15,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8950 states. [2022-11-18 21:09:16,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8950 to 6294. [2022-11-18 21:09:16,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6294 states, 4617 states have (on average 1.3025774312324019) internal successors, (6014), 4663 states have internal predecessors, (6014), 1095 states have call successors, (1095), 581 states have call predecessors, (1095), 581 states have return successors, (1095), 1049 states have call predecessors, (1095), 1095 states have call successors, (1095) [2022-11-18 21:09:16,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6294 states to 6294 states and 8204 transitions. [2022-11-18 21:09:16,732 INFO L78 Accepts]: Start accepts. Automaton has 6294 states and 8204 transitions. Word has length 163 [2022-11-18 21:09:16,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 21:09:16,733 INFO L495 AbstractCegarLoop]: Abstraction has 6294 states and 8204 transitions. [2022-11-18 21:09:16,733 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 6 states have internal predecessors, (93), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) [2022-11-18 21:09:16,733 INFO L276 IsEmpty]: Start isEmpty. Operand 6294 states and 8204 transitions. [2022-11-18 21:09:16,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2022-11-18 21:09:16,745 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 21:09:16,745 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 21:09:16,746 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-11-18 21:09:16,746 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 21:09:16,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 21:09:16,747 INFO L85 PathProgramCache]: Analyzing trace with hash 655594681, now seen corresponding path program 1 times [2022-11-18 21:09:16,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 21:09:16,747 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226115177] [2022-11-18 21:09:16,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 21:09:16,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 21:09:16,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:09:17,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-18 21:09:17,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:09:17,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-18 21:09:17,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:09:17,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-18 21:09:17,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:09:17,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-11-18 21:09:17,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:09:17,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-11-18 21:09:17,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:09:17,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-11-18 21:09:17,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:09:17,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-11-18 21:09:17,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:09:17,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-11-18 21:09:17,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:09:17,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-11-18 21:09:17,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:09:17,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-11-18 21:09:17,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:09:17,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-11-18 21:09:17,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:09:17,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-11-18 21:09:17,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:09:17,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-11-18 21:09:17,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:09:17,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-11-18 21:09:17,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:09:17,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2022-11-18 21:09:17,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:09:17,247 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-18 21:09:17,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 21:09:17,248 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226115177] [2022-11-18 21:09:17,248 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [226115177] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 21:09:17,248 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [249483638] [2022-11-18 21:09:17,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 21:09:17,249 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 21:09:17,249 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a03a397-50b2-4fa7-9e70-08fdf5753c02/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 21:09:17,251 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a03a397-50b2-4fa7-9e70-08fdf5753c02/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 21:09:17,278 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a03a397-50b2-4fa7-9e70-08fdf5753c02/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-18 21:09:17,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:09:17,466 INFO L263 TraceCheckSpWp]: Trace formula consists of 738 conjuncts, 16 conjunts are in the unsatisfiable core [2022-11-18 21:09:17,471 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 21:09:17,876 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-18 21:09:17,876 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 21:09:18,138 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-18 21:09:18,139 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [249483638] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 21:09:18,139 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 21:09:18,139 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 16 [2022-11-18 21:09:18,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143083514] [2022-11-18 21:09:18,139 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 21:09:18,140 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-11-18 21:09:18,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 21:09:18,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-11-18 21:09:18,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2022-11-18 21:09:18,141 INFO L87 Difference]: Start difference. First operand 6294 states and 8204 transitions. Second operand has 16 states, 16 states have (on average 13.0) internal successors, (208), 14 states have internal predecessors, (208), 6 states have call successors, (43), 4 states have call predecessors, (43), 7 states have return successors, (42), 8 states have call predecessors, (42), 6 states have call successors, (42) [2022-11-18 21:09:33,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 21:09:33,870 INFO L93 Difference]: Finished difference Result 29252 states and 39452 transitions. [2022-11-18 21:09:33,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2022-11-18 21:09:33,871 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 13.0) internal successors, (208), 14 states have internal predecessors, (208), 6 states have call successors, (43), 4 states have call predecessors, (43), 7 states have return successors, (42), 8 states have call predecessors, (42), 6 states have call successors, (42) Word has length 163 [2022-11-18 21:09:33,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 21:09:33,963 INFO L225 Difference]: With dead ends: 29252 [2022-11-18 21:09:33,963 INFO L226 Difference]: Without dead ends: 23239 [2022-11-18 21:09:33,982 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 530 GetRequests, 412 SyntacticMatches, 1 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5081 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=1835, Invalid=12207, Unknown=0, NotChecked=0, Total=14042 [2022-11-18 21:09:33,983 INFO L413 NwaCegarLoop]: 1488 mSDtfsCounter, 5066 mSDsluCounter, 11731 mSDsCounter, 0 mSdLazyCounter, 5862 mSolverCounterSat, 3473 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5066 SdHoareTripleChecker+Valid, 13219 SdHoareTripleChecker+Invalid, 9335 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.2s SdHoareTripleChecker+Time, 3473 IncrementalHoareTripleChecker+Valid, 5862 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.5s IncrementalHoareTripleChecker+Time [2022-11-18 21:09:33,983 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5066 Valid, 13219 Invalid, 9335 Unknown, 0 Unchecked, 0.2s Time], IncrementalHoareTripleChecker [3473 Valid, 5862 Invalid, 0 Unknown, 0 Unchecked, 6.5s Time] [2022-11-18 21:09:34,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23239 states. [2022-11-18 21:09:35,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23239 to 8393. [2022-11-18 21:09:35,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8393 states, 6200 states have (on average 1.3038709677419356) internal successors, (8084), 6258 states have internal predecessors, (8084), 1423 states have call successors, (1423), 769 states have call predecessors, (1423), 769 states have return successors, (1423), 1365 states have call predecessors, (1423), 1423 states have call successors, (1423) [2022-11-18 21:09:35,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8393 states to 8393 states and 10930 transitions. [2022-11-18 21:09:35,951 INFO L78 Accepts]: Start accepts. Automaton has 8393 states and 10930 transitions. Word has length 163 [2022-11-18 21:09:35,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 21:09:35,952 INFO L495 AbstractCegarLoop]: Abstraction has 8393 states and 10930 transitions. [2022-11-18 21:09:35,952 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 13.0) internal successors, (208), 14 states have internal predecessors, (208), 6 states have call successors, (43), 4 states have call predecessors, (43), 7 states have return successors, (42), 8 states have call predecessors, (42), 6 states have call successors, (42) [2022-11-18 21:09:35,952 INFO L276 IsEmpty]: Start isEmpty. Operand 8393 states and 10930 transitions. [2022-11-18 21:09:35,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2022-11-18 21:09:35,968 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 21:09:35,969 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 21:09:35,981 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a03a397-50b2-4fa7-9e70-08fdf5753c02/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-18 21:09:36,175 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a03a397-50b2-4fa7-9e70-08fdf5753c02/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 21:09:36,176 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 21:09:36,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 21:09:36,176 INFO L85 PathProgramCache]: Analyzing trace with hash -1767398441, now seen corresponding path program 1 times [2022-11-18 21:09:36,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 21:09:36,177 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135294323] [2022-11-18 21:09:36,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 21:09:36,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 21:09:36,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:09:36,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-18 21:09:36,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:09:36,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-18 21:09:36,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:09:36,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-11-18 21:09:36,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:09:36,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-11-18 21:09:36,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:09:36,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-11-18 21:09:36,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:09:36,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-11-18 21:09:36,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:09:36,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-11-18 21:09:36,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:09:36,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-11-18 21:09:36,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:09:36,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-11-18 21:09:36,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:09:36,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-11-18 21:09:36,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:09:36,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-11-18 21:09:36,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:09:36,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-11-18 21:09:36,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:09:36,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-11-18 21:09:36,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:09:36,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-11-18 21:09:36,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:09:36,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2022-11-18 21:09:36,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:09:36,980 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-18 21:09:36,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 21:09:36,980 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135294323] [2022-11-18 21:09:36,981 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1135294323] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 21:09:36,981 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [132671911] [2022-11-18 21:09:36,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 21:09:36,981 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 21:09:36,981 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a03a397-50b2-4fa7-9e70-08fdf5753c02/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 21:09:36,982 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a03a397-50b2-4fa7-9e70-08fdf5753c02/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 21:09:36,999 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a03a397-50b2-4fa7-9e70-08fdf5753c02/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-18 21:09:37,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:09:37,190 INFO L263 TraceCheckSpWp]: Trace formula consists of 743 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-18 21:09:37,200 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 21:09:37,299 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-18 21:09:37,299 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 21:09:37,516 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-18 21:09:37,516 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [132671911] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-18 21:09:37,516 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-18 21:09:37,517 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8, 7] total 14 [2022-11-18 21:09:37,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835536072] [2022-11-18 21:09:37,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 21:09:37,518 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-18 21:09:37,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 21:09:37,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-18 21:09:37,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2022-11-18 21:09:37,519 INFO L87 Difference]: Start difference. First operand 8393 states and 10930 transitions. Second operand has 5 states, 4 states have (on average 23.5) internal successors, (94), 5 states have internal predecessors, (94), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) [2022-11-18 21:09:38,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 21:09:38,965 INFO L93 Difference]: Finished difference Result 13726 states and 17927 transitions. [2022-11-18 21:09:38,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-18 21:09:38,966 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 23.5) internal successors, (94), 5 states have internal predecessors, (94), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) Word has length 167 [2022-11-18 21:09:38,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 21:09:38,989 INFO L225 Difference]: With dead ends: 13726 [2022-11-18 21:09:38,989 INFO L226 Difference]: Without dead ends: 5530 [2022-11-18 21:09:39,004 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 370 GetRequests, 358 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2022-11-18 21:09:39,004 INFO L413 NwaCegarLoop]: 259 mSDtfsCounter, 2 mSDsluCounter, 764 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1023 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-18 21:09:39,005 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1023 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-18 21:09:39,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5530 states. [2022-11-18 21:09:40,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5530 to 5296. [2022-11-18 21:09:40,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5296 states, 3914 states have (on average 1.303270311701584) internal successors, (5101), 3948 states have internal predecessors, (5101), 901 states have call successors, (901), 480 states have call predecessors, (901), 480 states have return successors, (901), 867 states have call predecessors, (901), 901 states have call successors, (901) [2022-11-18 21:09:40,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5296 states to 5296 states and 6903 transitions. [2022-11-18 21:09:40,220 INFO L78 Accepts]: Start accepts. Automaton has 5296 states and 6903 transitions. Word has length 167 [2022-11-18 21:09:40,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 21:09:40,221 INFO L495 AbstractCegarLoop]: Abstraction has 5296 states and 6903 transitions. [2022-11-18 21:09:40,221 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 23.5) internal successors, (94), 5 states have internal predecessors, (94), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) [2022-11-18 21:09:40,221 INFO L276 IsEmpty]: Start isEmpty. Operand 5296 states and 6903 transitions. [2022-11-18 21:09:40,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2022-11-18 21:09:40,231 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 21:09:40,232 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 21:09:40,238 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a03a397-50b2-4fa7-9e70-08fdf5753c02/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-18 21:09:40,438 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a03a397-50b2-4fa7-9e70-08fdf5753c02/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 21:09:40,438 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 21:09:40,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 21:09:40,439 INFO L85 PathProgramCache]: Analyzing trace with hash 946763764, now seen corresponding path program 1 times [2022-11-18 21:09:40,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 21:09:40,439 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966052914] [2022-11-18 21:09:40,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 21:09:40,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 21:09:40,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:09:41,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-18 21:09:41,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:09:41,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-18 21:09:41,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:09:41,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-11-18 21:09:41,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:09:41,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-11-18 21:09:41,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:09:41,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-11-18 21:09:41,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:09:41,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-11-18 21:09:41,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:09:41,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-11-18 21:09:41,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:09:41,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-11-18 21:09:41,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:09:41,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-11-18 21:09:41,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:09:41,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-11-18 21:09:41,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:09:41,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-11-18 21:09:41,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:09:41,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-11-18 21:09:41,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:09:41,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-11-18 21:09:41,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:09:41,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2022-11-18 21:09:41,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:09:41,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2022-11-18 21:09:41,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:09:41,326 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 24 proven. 5 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2022-11-18 21:09:41,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 21:09:41,327 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966052914] [2022-11-18 21:09:41,327 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [966052914] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 21:09:41,327 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [479893681] [2022-11-18 21:09:41,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 21:09:41,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 21:09:41,328 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a03a397-50b2-4fa7-9e70-08fdf5753c02/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 21:09:41,329 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a03a397-50b2-4fa7-9e70-08fdf5753c02/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 21:09:41,334 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a03a397-50b2-4fa7-9e70-08fdf5753c02/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-18 21:09:41,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:09:41,543 INFO L263 TraceCheckSpWp]: Trace formula consists of 760 conjuncts, 27 conjunts are in the unsatisfiable core [2022-11-18 21:09:41,549 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 21:09:42,498 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-18 21:09:42,499 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 21:09:43,081 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-18 21:09:43,082 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [479893681] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 21:09:43,082 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 21:09:43,083 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 8] total 23 [2022-11-18 21:09:43,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892184916] [2022-11-18 21:09:43,083 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 21:09:43,084 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-11-18 21:09:43,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 21:09:43,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-11-18 21:09:43,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=424, Unknown=0, NotChecked=0, Total=506 [2022-11-18 21:09:43,085 INFO L87 Difference]: Start difference. First operand 5296 states and 6903 transitions. Second operand has 23 states, 23 states have (on average 11.91304347826087) internal successors, (274), 23 states have internal predecessors, (274), 9 states have call successors, (41), 5 states have call predecessors, (41), 5 states have return successors, (40), 9 states have call predecessors, (40), 9 states have call successors, (40) [2022-11-18 21:10:10,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 21:10:10,153 INFO L93 Difference]: Finished difference Result 24007 states and 33921 transitions. [2022-11-18 21:10:10,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 255 states. [2022-11-18 21:10:10,154 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 11.91304347826087) internal successors, (274), 23 states have internal predecessors, (274), 9 states have call successors, (41), 5 states have call predecessors, (41), 5 states have return successors, (40), 9 states have call predecessors, (40), 9 states have call successors, (40) Word has length 168 [2022-11-18 21:10:10,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 21:10:10,227 INFO L225 Difference]: With dead ends: 24007 [2022-11-18 21:10:10,228 INFO L226 Difference]: Without dead ends: 18964 [2022-11-18 21:10:10,342 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 643 GetRequests, 372 SyntacticMatches, 1 SemanticMatches, 270 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31895 ImplicationChecksByTransitivity, 12.1s TimeCoverageRelationStatistics Valid=7428, Invalid=66284, Unknown=0, NotChecked=0, Total=73712 [2022-11-18 21:10:10,342 INFO L413 NwaCegarLoop]: 785 mSDtfsCounter, 5614 mSDsluCounter, 5876 mSDsCounter, 0 mSdLazyCounter, 8558 mSolverCounterSat, 4148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5614 SdHoareTripleChecker+Valid, 6661 SdHoareTripleChecker+Invalid, 12706 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 4148 IncrementalHoareTripleChecker+Valid, 8558 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.7s IncrementalHoareTripleChecker+Time [2022-11-18 21:10:10,342 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5614 Valid, 6661 Invalid, 12706 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [4148 Valid, 8558 Invalid, 0 Unknown, 0 Unchecked, 8.7s Time] [2022-11-18 21:10:10,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18964 states. [2022-11-18 21:10:12,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18964 to 9202. [2022-11-18 21:10:12,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9202 states, 6909 states have (on average 1.3064119264727168) internal successors, (9026), 6963 states have internal predecessors, (9026), 1469 states have call successors, (1469), 823 states have call predecessors, (1469), 823 states have return successors, (1469), 1415 states have call predecessors, (1469), 1469 states have call successors, (1469) [2022-11-18 21:10:12,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9202 states to 9202 states and 11964 transitions. [2022-11-18 21:10:12,583 INFO L78 Accepts]: Start accepts. Automaton has 9202 states and 11964 transitions. Word has length 168 [2022-11-18 21:10:12,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 21:10:12,583 INFO L495 AbstractCegarLoop]: Abstraction has 9202 states and 11964 transitions. [2022-11-18 21:10:12,584 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 11.91304347826087) internal successors, (274), 23 states have internal predecessors, (274), 9 states have call successors, (41), 5 states have call predecessors, (41), 5 states have return successors, (40), 9 states have call predecessors, (40), 9 states have call successors, (40) [2022-11-18 21:10:12,584 INFO L276 IsEmpty]: Start isEmpty. Operand 9202 states and 11964 transitions. [2022-11-18 21:10:12,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2022-11-18 21:10:12,598 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 21:10:12,598 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 21:10:12,606 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a03a397-50b2-4fa7-9e70-08fdf5753c02/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-18 21:10:12,806 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a03a397-50b2-4fa7-9e70-08fdf5753c02/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2022-11-18 21:10:12,806 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 21:10:12,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 21:10:12,807 INFO L85 PathProgramCache]: Analyzing trace with hash 1376236573, now seen corresponding path program 1 times [2022-11-18 21:10:12,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 21:10:12,807 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998756905] [2022-11-18 21:10:12,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 21:10:12,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 21:10:12,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:10:13,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-18 21:10:13,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:10:13,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-18 21:10:13,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:10:13,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-11-18 21:10:13,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:10:13,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-11-18 21:10:13,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:10:13,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-11-18 21:10:13,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:10:13,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-11-18 21:10:13,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:10:13,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-11-18 21:10:13,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:10:13,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-11-18 21:10:13,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:10:13,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-11-18 21:10:13,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:10:13,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-11-18 21:10:13,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:10:13,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-11-18 21:10:13,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:10:13,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-11-18 21:10:13,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:10:13,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-11-18 21:10:13,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:10:13,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2022-11-18 21:10:13,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:10:13,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-11-18 21:10:13,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:10:13,966 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 24 proven. 9 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2022-11-18 21:10:13,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 21:10:13,967 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998756905] [2022-11-18 21:10:13,967 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1998756905] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 21:10:13,967 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1745938958] [2022-11-18 21:10:13,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 21:10:13,967 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 21:10:13,968 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a03a397-50b2-4fa7-9e70-08fdf5753c02/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 21:10:13,969 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a03a397-50b2-4fa7-9e70-08fdf5753c02/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 21:10:13,990 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a03a397-50b2-4fa7-9e70-08fdf5753c02/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-18 21:10:14,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:10:14,174 INFO L263 TraceCheckSpWp]: Trace formula consists of 759 conjuncts, 44 conjunts are in the unsatisfiable core [2022-11-18 21:10:14,178 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 21:10:15,496 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 72 proven. 13 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-18 21:10:15,496 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 21:10:17,061 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 16 proven. 17 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2022-11-18 21:10:17,062 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1745938958] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 21:10:17,062 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 21:10:17,062 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 12] total 27 [2022-11-18 21:10:17,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991321257] [2022-11-18 21:10:17,063 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 21:10:17,064 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-11-18 21:10:17,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 21:10:17,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-11-18 21:10:17,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=580, Unknown=0, NotChecked=0, Total=702 [2022-11-18 21:10:17,065 INFO L87 Difference]: Start difference. First operand 9202 states and 11964 transitions. Second operand has 27 states, 27 states have (on average 9.88888888888889) internal successors, (267), 27 states have internal predecessors, (267), 10 states have call successors, (41), 5 states have call predecessors, (41), 5 states have return successors, (40), 10 states have call predecessors, (40), 10 states have call successors, (40) [2022-11-18 21:11:06,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 21:11:06,696 INFO L93 Difference]: Finished difference Result 29348 states and 40898 transitions. [2022-11-18 21:11:06,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 211 states. [2022-11-18 21:11:06,696 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 9.88888888888889) internal successors, (267), 27 states have internal predecessors, (267), 10 states have call successors, (41), 5 states have call predecessors, (41), 5 states have return successors, (40), 10 states have call predecessors, (40), 10 states have call successors, (40) Word has length 169 [2022-11-18 21:11:06,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 21:11:06,760 INFO L225 Difference]: With dead ends: 29348 [2022-11-18 21:11:06,760 INFO L226 Difference]: Without dead ends: 20410 [2022-11-18 21:11:06,780 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 590 GetRequests, 359 SyntacticMatches, 2 SemanticMatches, 229 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22967 ImplicationChecksByTransitivity, 31.5s TimeCoverageRelationStatistics Valid=7936, Invalid=45194, Unknown=0, NotChecked=0, Total=53130 [2022-11-18 21:11:06,780 INFO L413 NwaCegarLoop]: 530 mSDtfsCounter, 8870 mSDsluCounter, 5869 mSDsCounter, 0 mSdLazyCounter, 9177 mSolverCounterSat, 6233 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8870 SdHoareTripleChecker+Valid, 6399 SdHoareTripleChecker+Invalid, 15410 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 6233 IncrementalHoareTripleChecker+Valid, 9177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.6s IncrementalHoareTripleChecker+Time [2022-11-18 21:11:06,781 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8870 Valid, 6399 Invalid, 15410 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [6233 Valid, 9177 Invalid, 0 Unknown, 0 Unchecked, 10.6s Time] [2022-11-18 21:11:06,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20410 states. [2022-11-18 21:11:09,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20410 to 9229. [2022-11-18 21:11:09,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9229 states, 6932 states have (on average 1.3026543566070399) internal successors, (9030), 6986 states have internal predecessors, (9030), 1471 states have call successors, (1471), 825 states have call predecessors, (1471), 825 states have return successors, (1471), 1417 states have call predecessors, (1471), 1471 states have call successors, (1471) [2022-11-18 21:11:09,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9229 states to 9229 states and 11972 transitions. [2022-11-18 21:11:09,219 INFO L78 Accepts]: Start accepts. Automaton has 9229 states and 11972 transitions. Word has length 169 [2022-11-18 21:11:09,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 21:11:09,220 INFO L495 AbstractCegarLoop]: Abstraction has 9229 states and 11972 transitions. [2022-11-18 21:11:09,220 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 9.88888888888889) internal successors, (267), 27 states have internal predecessors, (267), 10 states have call successors, (41), 5 states have call predecessors, (41), 5 states have return successors, (40), 10 states have call predecessors, (40), 10 states have call successors, (40) [2022-11-18 21:11:09,220 INFO L276 IsEmpty]: Start isEmpty. Operand 9229 states and 11972 transitions. [2022-11-18 21:11:09,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2022-11-18 21:11:09,229 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 21:11:09,229 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 21:11:09,241 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a03a397-50b2-4fa7-9e70-08fdf5753c02/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-18 21:11:09,436 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a03a397-50b2-4fa7-9e70-08fdf5753c02/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2022-11-18 21:11:09,436 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 21:11:09,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 21:11:09,437 INFO L85 PathProgramCache]: Analyzing trace with hash -1599527252, now seen corresponding path program 1 times [2022-11-18 21:11:09,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 21:11:09,437 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427189276] [2022-11-18 21:11:09,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 21:11:09,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 21:11:09,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:11:09,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-18 21:11:09,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:11:09,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-18 21:11:09,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:11:09,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-18 21:11:09,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:11:09,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-11-18 21:11:09,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:11:09,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-11-18 21:11:09,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:11:09,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-11-18 21:11:09,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:11:09,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-11-18 21:11:09,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:11:09,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-11-18 21:11:09,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:11:09,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-11-18 21:11:09,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:11:09,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-11-18 21:11:09,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:11:09,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-11-18 21:11:09,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:11:09,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-11-18 21:11:09,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:11:09,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2022-11-18 21:11:09,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:11:09,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-11-18 21:11:09,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:11:09,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-11-18 21:11:09,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:11:09,686 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-18 21:11:09,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 21:11:09,687 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427189276] [2022-11-18 21:11:09,687 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427189276] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 21:11:09,687 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1370877645] [2022-11-18 21:11:09,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 21:11:09,687 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 21:11:09,688 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a03a397-50b2-4fa7-9e70-08fdf5753c02/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 21:11:09,689 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a03a397-50b2-4fa7-9e70-08fdf5753c02/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 21:11:09,711 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a03a397-50b2-4fa7-9e70-08fdf5753c02/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-18 21:11:09,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:11:09,877 INFO L263 TraceCheckSpWp]: Trace formula consists of 760 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-18 21:11:09,880 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 21:11:10,170 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-18 21:11:10,170 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 21:11:10,425 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-18 21:11:10,425 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1370877645] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 21:11:10,425 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 21:11:10,426 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 10 [2022-11-18 21:11:10,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592110766] [2022-11-18 21:11:10,426 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 21:11:10,428 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-18 21:11:10,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 21:11:10,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-18 21:11:10,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-11-18 21:11:10,429 INFO L87 Difference]: Start difference. First operand 9229 states and 11972 transitions. Second operand has 10 states, 10 states have (on average 15.6) internal successors, (156), 9 states have internal predecessors, (156), 4 states have call successors, (32), 5 states have call predecessors, (32), 7 states have return successors, (31), 4 states have call predecessors, (31), 3 states have call successors, (31) [2022-11-18 21:11:15,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 21:11:15,378 INFO L93 Difference]: Finished difference Result 25786 states and 33663 transitions. [2022-11-18 21:11:15,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-18 21:11:15,378 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 15.6) internal successors, (156), 9 states have internal predecessors, (156), 4 states have call successors, (32), 5 states have call predecessors, (32), 7 states have return successors, (31), 4 states have call predecessors, (31), 3 states have call successors, (31) Word has length 170 [2022-11-18 21:11:15,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 21:11:15,417 INFO L225 Difference]: With dead ends: 25786 [2022-11-18 21:11:15,417 INFO L226 Difference]: Without dead ends: 16821 [2022-11-18 21:11:15,434 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 388 GetRequests, 365 SyntacticMatches, 5 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=299, Unknown=0, NotChecked=0, Total=380 [2022-11-18 21:11:15,435 INFO L413 NwaCegarLoop]: 351 mSDtfsCounter, 506 mSDsluCounter, 1947 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 511 SdHoareTripleChecker+Valid, 2298 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-18 21:11:15,435 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [511 Valid, 2298 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-18 21:11:15,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16821 states. [2022-11-18 21:11:18,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16821 to 11770. [2022-11-18 21:11:18,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11770 states, 8903 states have (on average 1.2885544198584746) internal successors, (11472), 8973 states have internal predecessors, (11472), 1809 states have call successors, (1809), 1057 states have call predecessors, (1809), 1057 states have return successors, (1809), 1739 states have call predecessors, (1809), 1809 states have call successors, (1809) [2022-11-18 21:11:18,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11770 states to 11770 states and 15090 transitions. [2022-11-18 21:11:18,678 INFO L78 Accepts]: Start accepts. Automaton has 11770 states and 15090 transitions. Word has length 170 [2022-11-18 21:11:18,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 21:11:18,678 INFO L495 AbstractCegarLoop]: Abstraction has 11770 states and 15090 transitions. [2022-11-18 21:11:18,679 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 15.6) internal successors, (156), 9 states have internal predecessors, (156), 4 states have call successors, (32), 5 states have call predecessors, (32), 7 states have return successors, (31), 4 states have call predecessors, (31), 3 states have call successors, (31) [2022-11-18 21:11:18,679 INFO L276 IsEmpty]: Start isEmpty. Operand 11770 states and 15090 transitions. [2022-11-18 21:11:18,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2022-11-18 21:11:18,686 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 21:11:18,686 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 21:11:18,697 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a03a397-50b2-4fa7-9e70-08fdf5753c02/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-18 21:11:18,893 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a03a397-50b2-4fa7-9e70-08fdf5753c02/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2022-11-18 21:11:18,893 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 21:11:18,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 21:11:18,893 INFO L85 PathProgramCache]: Analyzing trace with hash 1095158754, now seen corresponding path program 1 times [2022-11-18 21:11:18,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 21:11:18,894 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638374584] [2022-11-18 21:11:18,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 21:11:18,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 21:11:18,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:11:19,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-18 21:11:19,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:11:19,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-18 21:11:19,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:11:19,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-18 21:11:19,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:11:19,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-11-18 21:11:19,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:11:19,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-11-18 21:11:19,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:11:19,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-11-18 21:11:19,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:11:19,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-11-18 21:11:19,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:11:19,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-11-18 21:11:19,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:11:19,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-11-18 21:11:19,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:11:19,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-11-18 21:11:19,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:11:19,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-11-18 21:11:19,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:11:19,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-11-18 21:11:19,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:11:19,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2022-11-18 21:11:19,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:11:19,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-11-18 21:11:19,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:11:19,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-11-18 21:11:19,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:11:19,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2022-11-18 21:11:19,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:11:19,128 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-18 21:11:19,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 21:11:19,129 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638374584] [2022-11-18 21:11:19,129 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1638374584] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 21:11:19,129 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 21:11:19,129 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-18 21:11:19,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793213743] [2022-11-18 21:11:19,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 21:11:19,130 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-18 21:11:19,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 21:11:19,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-18 21:11:19,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-18 21:11:19,131 INFO L87 Difference]: Start difference. First operand 11770 states and 15090 transitions. Second operand has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 6 states have internal predecessors, (95), 3 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) [2022-11-18 21:11:26,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 21:11:26,843 INFO L93 Difference]: Finished difference Result 33636 states and 44436 transitions. [2022-11-18 21:11:26,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-18 21:11:26,844 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 6 states have internal predecessors, (95), 3 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) Word has length 172 [2022-11-18 21:11:26,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 21:11:26,904 INFO L225 Difference]: With dead ends: 33636 [2022-11-18 21:11:26,905 INFO L226 Difference]: Without dead ends: 24629 [2022-11-18 21:11:26,919 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-18 21:11:26,919 INFO L413 NwaCegarLoop]: 499 mSDtfsCounter, 508 mSDsluCounter, 2065 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 523 SdHoareTripleChecker+Valid, 2564 SdHoareTripleChecker+Invalid, 355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-18 21:11:26,919 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [523 Valid, 2564 Invalid, 355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 265 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-18 21:11:26,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24629 states. [2022-11-18 21:11:31,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24629 to 17338. [2022-11-18 21:11:31,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17338 states, 12936 states have (on average 1.2804576376004948) internal successors, (16564), 13055 states have internal predecessors, (16564), 2807 states have call successors, (2807), 1594 states have call predecessors, (2807), 1594 states have return successors, (2807), 2688 states have call predecessors, (2807), 2807 states have call successors, (2807) [2022-11-18 21:11:31,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17338 states to 17338 states and 22178 transitions. [2022-11-18 21:11:31,269 INFO L78 Accepts]: Start accepts. Automaton has 17338 states and 22178 transitions. Word has length 172 [2022-11-18 21:11:31,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 21:11:31,269 INFO L495 AbstractCegarLoop]: Abstraction has 17338 states and 22178 transitions. [2022-11-18 21:11:31,270 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 6 states have internal predecessors, (95), 3 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) [2022-11-18 21:11:31,270 INFO L276 IsEmpty]: Start isEmpty. Operand 17338 states and 22178 transitions. [2022-11-18 21:11:31,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2022-11-18 21:11:31,276 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 21:11:31,276 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 21:11:31,276 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-11-18 21:11:31,276 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 21:11:31,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 21:11:31,277 INFO L85 PathProgramCache]: Analyzing trace with hash -359260583, now seen corresponding path program 1 times [2022-11-18 21:11:31,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 21:11:31,277 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623863838] [2022-11-18 21:11:31,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 21:11:31,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 21:11:31,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:11:32,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-18 21:11:32,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:11:32,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-18 21:11:32,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:11:32,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-18 21:11:32,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:11:32,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-11-18 21:11:32,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:11:32,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-11-18 21:11:32,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:11:32,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-11-18 21:11:32,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:11:32,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-11-18 21:11:32,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:11:32,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-11-18 21:11:32,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:11:32,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-11-18 21:11:32,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:11:32,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-11-18 21:11:32,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:11:32,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-11-18 21:11:32,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:11:32,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-11-18 21:11:32,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:11:32,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-11-18 21:11:32,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:11:32,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2022-11-18 21:11:32,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:11:32,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2022-11-18 21:11:32,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:11:32,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2022-11-18 21:11:32,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:11:32,057 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-18 21:11:32,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 21:11:32,058 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623863838] [2022-11-18 21:11:32,058 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1623863838] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 21:11:32,058 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [768098293] [2022-11-18 21:11:32,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 21:11:32,058 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 21:11:32,059 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a03a397-50b2-4fa7-9e70-08fdf5753c02/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 21:11:32,060 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a03a397-50b2-4fa7-9e70-08fdf5753c02/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 21:11:32,078 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a03a397-50b2-4fa7-9e70-08fdf5753c02/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-18 21:11:32,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:11:32,255 INFO L263 TraceCheckSpWp]: Trace formula consists of 774 conjuncts, 11 conjunts are in the unsatisfiable core [2022-11-18 21:11:32,259 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 21:11:32,405 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 48 proven. 4 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-11-18 21:11:32,406 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 21:11:32,544 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 25 proven. 2 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2022-11-18 21:11:32,544 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [768098293] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 21:11:32,544 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 21:11:32,545 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 15 [2022-11-18 21:11:32,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363925772] [2022-11-18 21:11:32,545 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 21:11:32,546 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-18 21:11:32,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 21:11:32,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-18 21:11:32,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2022-11-18 21:11:32,547 INFO L87 Difference]: Start difference. First operand 17338 states and 22178 transitions. Second operand has 15 states, 15 states have (on average 12.933333333333334) internal successors, (194), 14 states have internal predecessors, (194), 6 states have call successors, (35), 4 states have call predecessors, (35), 6 states have return successors, (35), 7 states have call predecessors, (35), 6 states have call successors, (35) [2022-11-18 21:11:46,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 21:11:46,828 INFO L93 Difference]: Finished difference Result 44819 states and 60083 transitions. [2022-11-18 21:11:46,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-11-18 21:11:46,829 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 12.933333333333334) internal successors, (194), 14 states have internal predecessors, (194), 6 states have call successors, (35), 4 states have call predecessors, (35), 6 states have return successors, (35), 7 states have call predecessors, (35), 6 states have call successors, (35) Word has length 173 [2022-11-18 21:11:46,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 21:11:46,898 INFO L225 Difference]: With dead ends: 44819 [2022-11-18 21:11:46,898 INFO L226 Difference]: Without dead ends: 27661 [2022-11-18 21:11:46,917 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 433 GetRequests, 383 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 680 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=369, Invalid=2283, Unknown=0, NotChecked=0, Total=2652 [2022-11-18 21:11:46,917 INFO L413 NwaCegarLoop]: 808 mSDtfsCounter, 1594 mSDsluCounter, 6262 mSDsCounter, 0 mSdLazyCounter, 4343 mSolverCounterSat, 956 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1594 SdHoareTripleChecker+Valid, 7070 SdHoareTripleChecker+Invalid, 5299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 956 IncrementalHoareTripleChecker+Valid, 4343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2022-11-18 21:11:46,918 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1594 Valid, 7070 Invalid, 5299 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [956 Valid, 4343 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2022-11-18 21:11:46,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27661 states. [2022-11-18 21:11:52,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27661 to 17446. [2022-11-18 21:11:52,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17446 states, 13016 states have (on average 1.2799631223110017) internal successors, (16660), 13137 states have internal predecessors, (16660), 2823 states have call successors, (2823), 1606 states have call predecessors, (2823), 1606 states have return successors, (2823), 2702 states have call predecessors, (2823), 2823 states have call successors, (2823) [2022-11-18 21:11:52,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17446 states to 17446 states and 22306 transitions. [2022-11-18 21:11:52,047 INFO L78 Accepts]: Start accepts. Automaton has 17446 states and 22306 transitions. Word has length 173 [2022-11-18 21:11:52,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 21:11:52,048 INFO L495 AbstractCegarLoop]: Abstraction has 17446 states and 22306 transitions. [2022-11-18 21:11:52,048 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 12.933333333333334) internal successors, (194), 14 states have internal predecessors, (194), 6 states have call successors, (35), 4 states have call predecessors, (35), 6 states have return successors, (35), 7 states have call predecessors, (35), 6 states have call successors, (35) [2022-11-18 21:11:52,048 INFO L276 IsEmpty]: Start isEmpty. Operand 17446 states and 22306 transitions. [2022-11-18 21:11:52,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2022-11-18 21:11:52,056 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 21:11:52,056 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 21:11:52,064 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a03a397-50b2-4fa7-9e70-08fdf5753c02/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-18 21:11:52,262 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a03a397-50b2-4fa7-9e70-08fdf5753c02/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 21:11:52,263 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 21:11:52,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 21:11:52,263 INFO L85 PathProgramCache]: Analyzing trace with hash -1136109205, now seen corresponding path program 1 times [2022-11-18 21:11:52,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 21:11:52,263 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061472443] [2022-11-18 21:11:52,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 21:11:52,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 21:11:52,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:11:52,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-18 21:11:52,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:11:52,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-18 21:11:52,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:11:52,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-18 21:11:52,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:11:52,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-11-18 21:11:52,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:11:52,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-11-18 21:11:52,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:11:52,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-11-18 21:11:52,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:11:52,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-11-18 21:11:52,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:11:52,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-11-18 21:11:52,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:11:52,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-11-18 21:11:52,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:11:52,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-11-18 21:11:52,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:11:52,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-11-18 21:11:52,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:11:52,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-11-18 21:11:52,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:11:52,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-11-18 21:11:52,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:11:52,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-11-18 21:11:52,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:11:52,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2022-11-18 21:11:52,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:11:52,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2022-11-18 21:11:52,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:11:52,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2022-11-18 21:11:52,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:11:52,951 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 26 proven. 8 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2022-11-18 21:11:52,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 21:11:52,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061472443] [2022-11-18 21:11:52,951 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1061472443] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 21:11:52,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [388979597] [2022-11-18 21:11:52,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 21:11:52,952 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 21:11:52,952 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a03a397-50b2-4fa7-9e70-08fdf5753c02/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 21:11:52,953 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a03a397-50b2-4fa7-9e70-08fdf5753c02/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 21:11:52,974 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a03a397-50b2-4fa7-9e70-08fdf5753c02/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-18 21:11:53,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:11:53,152 INFO L263 TraceCheckSpWp]: Trace formula consists of 793 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-18 21:11:53,156 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 21:11:53,346 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 66 proven. 4 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-11-18 21:11:53,346 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 21:11:53,525 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 23 proven. 8 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2022-11-18 21:11:53,525 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [388979597] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 21:11:53,525 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 21:11:53,525 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 15 [2022-11-18 21:11:53,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78940532] [2022-11-18 21:11:53,525 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 21:11:53,526 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-18 21:11:53,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 21:11:53,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-18 21:11:53,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2022-11-18 21:11:53,527 INFO L87 Difference]: Start difference. First operand 17446 states and 22306 transitions. Second operand has 15 states, 15 states have (on average 13.733333333333333) internal successors, (206), 14 states have internal predecessors, (206), 6 states have call successors, (38), 4 states have call predecessors, (38), 6 states have return successors, (38), 7 states have call predecessors, (38), 6 states have call successors, (38) [2022-11-18 21:12:06,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 21:12:06,522 INFO L93 Difference]: Finished difference Result 43669 states and 58357 transitions. [2022-11-18 21:12:06,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-11-18 21:12:06,523 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 13.733333333333333) internal successors, (206), 14 states have internal predecessors, (206), 6 states have call successors, (38), 4 states have call predecessors, (38), 6 states have return successors, (38), 7 states have call predecessors, (38), 6 states have call successors, (38) Word has length 182 [2022-11-18 21:12:06,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 21:12:06,610 INFO L225 Difference]: With dead ends: 43669 [2022-11-18 21:12:06,610 INFO L226 Difference]: Without dead ends: 26403 [2022-11-18 21:12:06,634 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 456 GetRequests, 403 SyntacticMatches, 1 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 775 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=389, Invalid=2473, Unknown=0, NotChecked=0, Total=2862 [2022-11-18 21:12:06,635 INFO L413 NwaCegarLoop]: 721 mSDtfsCounter, 1534 mSDsluCounter, 5342 mSDsCounter, 0 mSdLazyCounter, 3580 mSolverCounterSat, 737 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1534 SdHoareTripleChecker+Valid, 6063 SdHoareTripleChecker+Invalid, 4317 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 737 IncrementalHoareTripleChecker+Valid, 3580 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-11-18 21:12:06,635 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1534 Valid, 6063 Invalid, 4317 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [737 Valid, 3580 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2022-11-18 21:12:06,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26403 states. [2022-11-18 21:12:11,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26403 to 17430. [2022-11-18 21:12:11,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17430 states, 13006 states have (on average 1.2794095033061663) internal successors, (16640), 13127 states have internal predecessors, (16640), 2820 states have call successors, (2820), 1603 states have call predecessors, (2820), 1603 states have return successors, (2820), 2699 states have call predecessors, (2820), 2820 states have call successors, (2820) [2022-11-18 21:12:11,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17430 states to 17430 states and 22280 transitions. [2022-11-18 21:12:11,512 INFO L78 Accepts]: Start accepts. Automaton has 17430 states and 22280 transitions. Word has length 182 [2022-11-18 21:12:11,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 21:12:11,512 INFO L495 AbstractCegarLoop]: Abstraction has 17430 states and 22280 transitions. [2022-11-18 21:12:11,512 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 13.733333333333333) internal successors, (206), 14 states have internal predecessors, (206), 6 states have call successors, (38), 4 states have call predecessors, (38), 6 states have return successors, (38), 7 states have call predecessors, (38), 6 states have call successors, (38) [2022-11-18 21:12:11,512 INFO L276 IsEmpty]: Start isEmpty. Operand 17430 states and 22280 transitions. [2022-11-18 21:12:11,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2022-11-18 21:12:11,517 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 21:12:11,518 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 21:12:11,523 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a03a397-50b2-4fa7-9e70-08fdf5753c02/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-18 21:12:11,719 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a03a397-50b2-4fa7-9e70-08fdf5753c02/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2022-11-18 21:12:11,719 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 21:12:11,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 21:12:11,719 INFO L85 PathProgramCache]: Analyzing trace with hash -996153312, now seen corresponding path program 1 times [2022-11-18 21:12:11,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 21:12:11,720 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661744239] [2022-11-18 21:12:11,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 21:12:11,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 21:12:11,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:12:12,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-18 21:12:12,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:12:12,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-18 21:12:12,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:12:12,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-18 21:12:12,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:12:12,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-11-18 21:12:12,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:12:12,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-11-18 21:12:12,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:12:12,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-11-18 21:12:12,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:12:12,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-11-18 21:12:12,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:12:12,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-11-18 21:12:12,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:12:12,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-11-18 21:12:12,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:12:12,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-11-18 21:12:12,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:12:12,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-11-18 21:12:12,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:12:12,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-11-18 21:12:12,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:12:12,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-11-18 21:12:12,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:12:12,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-11-18 21:12:12,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:12:12,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2022-11-18 21:12:12,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:12:12,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2022-11-18 21:12:12,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:12:12,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2022-11-18 21:12:12,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:12:12,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2022-11-18 21:12:12,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:12:12,311 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 30 proven. 6 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2022-11-18 21:12:12,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 21:12:12,312 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661744239] [2022-11-18 21:12:12,312 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1661744239] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 21:12:12,313 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1959325795] [2022-11-18 21:12:12,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 21:12:12,313 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 21:12:12,313 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a03a397-50b2-4fa7-9e70-08fdf5753c02/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 21:12:12,314 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a03a397-50b2-4fa7-9e70-08fdf5753c02/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 21:12:12,334 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a03a397-50b2-4fa7-9e70-08fdf5753c02/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-18 21:12:12,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:12:12,525 INFO L263 TraceCheckSpWp]: Trace formula consists of 811 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-18 21:12:12,529 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 21:12:12,687 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2022-11-18 21:12:12,687 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 21:12:12,687 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1959325795] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 21:12:12,687 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-18 21:12:12,688 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 13 [2022-11-18 21:12:12,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260665396] [2022-11-18 21:12:12,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 21:12:12,688 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-18 21:12:12,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 21:12:12,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-18 21:12:12,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2022-11-18 21:12:12,689 INFO L87 Difference]: Start difference. First operand 17430 states and 22280 transitions. Second operand has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 6 states have internal predecessors, (124), 3 states have call successors, (15), 3 states have call predecessors, (15), 4 states have return successors, (15), 4 states have call predecessors, (15), 3 states have call successors, (15) [2022-11-18 21:12:19,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 21:12:19,702 INFO L93 Difference]: Finished difference Result 38484 states and 50506 transitions. [2022-11-18 21:12:19,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-18 21:12:19,703 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 6 states have internal predecessors, (124), 3 states have call successors, (15), 3 states have call predecessors, (15), 4 states have return successors, (15), 4 states have call predecessors, (15), 3 states have call successors, (15) Word has length 190 [2022-11-18 21:12:19,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 21:12:19,749 INFO L225 Difference]: With dead ends: 38484 [2022-11-18 21:12:19,749 INFO L226 Difference]: Without dead ends: 21652 [2022-11-18 21:12:19,767 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 224 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2022-11-18 21:12:19,767 INFO L413 NwaCegarLoop]: 515 mSDtfsCounter, 593 mSDsluCounter, 1472 mSDsCounter, 0 mSdLazyCounter, 325 mSolverCounterSat, 172 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 593 SdHoareTripleChecker+Valid, 1987 SdHoareTripleChecker+Invalid, 497 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 172 IncrementalHoareTripleChecker+Valid, 325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-18 21:12:19,767 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [593 Valid, 1987 Invalid, 497 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [172 Valid, 325 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-18 21:12:19,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21652 states. [2022-11-18 21:12:24,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21652 to 17430. [2022-11-18 21:12:24,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17430 states, 13006 states have (on average 1.2723358449946178) internal successors, (16548), 13127 states have internal predecessors, (16548), 2820 states have call successors, (2820), 1603 states have call predecessors, (2820), 1603 states have return successors, (2820), 2699 states have call predecessors, (2820), 2820 states have call successors, (2820) [2022-11-18 21:12:24,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17430 states to 17430 states and 22188 transitions. [2022-11-18 21:12:24,600 INFO L78 Accepts]: Start accepts. Automaton has 17430 states and 22188 transitions. Word has length 190 [2022-11-18 21:12:24,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 21:12:24,601 INFO L495 AbstractCegarLoop]: Abstraction has 17430 states and 22188 transitions. [2022-11-18 21:12:24,601 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 6 states have internal predecessors, (124), 3 states have call successors, (15), 3 states have call predecessors, (15), 4 states have return successors, (15), 4 states have call predecessors, (15), 3 states have call successors, (15) [2022-11-18 21:12:24,601 INFO L276 IsEmpty]: Start isEmpty. Operand 17430 states and 22188 transitions. [2022-11-18 21:12:24,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2022-11-18 21:12:24,606 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 21:12:24,606 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 21:12:24,611 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a03a397-50b2-4fa7-9e70-08fdf5753c02/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-18 21:12:24,806 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a03a397-50b2-4fa7-9e70-08fdf5753c02/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2022-11-18 21:12:24,807 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 21:12:24,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 21:12:24,807 INFO L85 PathProgramCache]: Analyzing trace with hash -1498967951, now seen corresponding path program 1 times [2022-11-18 21:12:24,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 21:12:24,807 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661542656] [2022-11-18 21:12:24,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 21:12:24,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 21:12:24,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:12:25,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-18 21:12:25,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:12:25,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-18 21:12:25,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:12:25,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-11-18 21:12:25,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:12:25,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-11-18 21:12:25,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:12:25,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-11-18 21:12:25,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:12:25,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-11-18 21:12:25,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:12:25,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-11-18 21:12:25,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:12:25,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-11-18 21:12:25,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:12:25,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-11-18 21:12:25,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:12:25,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-11-18 21:12:25,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:12:25,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-11-18 21:12:25,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:12:25,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-11-18 21:12:25,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:12:25,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2022-11-18 21:12:25,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:12:25,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2022-11-18 21:12:25,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:12:25,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-11-18 21:12:25,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:12:25,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2022-11-18 21:12:25,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:12:25,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2022-11-18 21:12:25,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:12:25,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2022-11-18 21:12:25,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:12:25,305 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 21 proven. 26 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2022-11-18 21:12:25,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 21:12:25,305 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661542656] [2022-11-18 21:12:25,305 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1661542656] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 21:12:25,306 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [753578167] [2022-11-18 21:12:25,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 21:12:25,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 21:12:25,306 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a03a397-50b2-4fa7-9e70-08fdf5753c02/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 21:12:25,308 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a03a397-50b2-4fa7-9e70-08fdf5753c02/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 21:12:25,311 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a03a397-50b2-4fa7-9e70-08fdf5753c02/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-18 21:12:25,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:12:25,512 INFO L263 TraceCheckSpWp]: Trace formula consists of 816 conjuncts, 16 conjunts are in the unsatisfiable core [2022-11-18 21:12:25,515 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 21:12:25,829 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 62 proven. 60 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-11-18 21:12:25,830 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 21:12:26,092 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 21 proven. 26 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2022-11-18 21:12:26,093 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [753578167] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 21:12:26,093 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 21:12:26,093 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 12 [2022-11-18 21:12:26,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881934877] [2022-11-18 21:12:26,093 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 21:12:26,094 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-18 21:12:26,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 21:12:26,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-18 21:12:26,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2022-11-18 21:12:26,095 INFO L87 Difference]: Start difference. First operand 17430 states and 22188 transitions. Second operand has 12 states, 12 states have (on average 15.916666666666666) internal successors, (191), 11 states have internal predecessors, (191), 5 states have call successors, (37), 4 states have call predecessors, (37), 7 states have return successors, (37), 6 states have call predecessors, (37), 5 states have call successors, (37) [2022-11-18 21:12:33,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 21:12:33,504 INFO L93 Difference]: Finished difference Result 33603 states and 43202 transitions. [2022-11-18 21:12:33,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-18 21:12:33,505 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 15.916666666666666) internal successors, (191), 11 states have internal predecessors, (191), 5 states have call successors, (37), 4 states have call predecessors, (37), 7 states have return successors, (37), 6 states have call predecessors, (37), 5 states have call successors, (37) Word has length 194 [2022-11-18 21:12:33,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 21:12:33,559 INFO L225 Difference]: With dead ends: 33603 [2022-11-18 21:12:33,559 INFO L226 Difference]: Without dead ends: 19680 [2022-11-18 21:12:33,579 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 450 GetRequests, 421 SyntacticMatches, 4 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=167, Invalid=535, Unknown=0, NotChecked=0, Total=702 [2022-11-18 21:12:33,580 INFO L413 NwaCegarLoop]: 729 mSDtfsCounter, 938 mSDsluCounter, 3031 mSDsCounter, 0 mSdLazyCounter, 672 mSolverCounterSat, 278 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 950 SdHoareTripleChecker+Valid, 3760 SdHoareTripleChecker+Invalid, 950 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 278 IncrementalHoareTripleChecker+Valid, 672 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-18 21:12:33,580 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [950 Valid, 3760 Invalid, 950 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [278 Valid, 672 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-18 21:12:33,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19680 states. [2022-11-18 21:12:38,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19680 to 17430. [2022-11-18 21:12:38,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17430 states, 13006 states have (on average 1.2678763647547286) internal successors, (16490), 13127 states have internal predecessors, (16490), 2820 states have call successors, (2820), 1603 states have call predecessors, (2820), 1603 states have return successors, (2820), 2699 states have call predecessors, (2820), 2820 states have call successors, (2820) [2022-11-18 21:12:38,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17430 states to 17430 states and 22130 transitions. [2022-11-18 21:12:38,547 INFO L78 Accepts]: Start accepts. Automaton has 17430 states and 22130 transitions. Word has length 194 [2022-11-18 21:12:38,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 21:12:38,548 INFO L495 AbstractCegarLoop]: Abstraction has 17430 states and 22130 transitions. [2022-11-18 21:12:38,548 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 15.916666666666666) internal successors, (191), 11 states have internal predecessors, (191), 5 states have call successors, (37), 4 states have call predecessors, (37), 7 states have return successors, (37), 6 states have call predecessors, (37), 5 states have call successors, (37) [2022-11-18 21:12:38,548 INFO L276 IsEmpty]: Start isEmpty. Operand 17430 states and 22130 transitions. [2022-11-18 21:12:38,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2022-11-18 21:12:38,553 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 21:12:38,553 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 21:12:38,559 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a03a397-50b2-4fa7-9e70-08fdf5753c02/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-18 21:12:38,753 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a03a397-50b2-4fa7-9e70-08fdf5753c02/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2022-11-18 21:12:38,754 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 21:12:38,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 21:12:38,754 INFO L85 PathProgramCache]: Analyzing trace with hash -469535662, now seen corresponding path program 1 times [2022-11-18 21:12:38,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 21:12:38,754 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612642464] [2022-11-18 21:12:38,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 21:12:38,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 21:12:38,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:12:39,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-18 21:12:39,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:12:39,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-18 21:12:39,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:12:39,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-11-18 21:12:39,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:12:39,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-11-18 21:12:39,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:12:39,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-11-18 21:12:39,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:12:39,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-11-18 21:12:39,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:12:39,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-11-18 21:12:39,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:12:39,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-11-18 21:12:39,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:12:39,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-11-18 21:12:39,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:12:39,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-11-18 21:12:39,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:12:39,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-11-18 21:12:39,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:12:39,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-11-18 21:12:39,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:12:39,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2022-11-18 21:12:39,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:12:39,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2022-11-18 21:12:39,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:12:39,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-11-18 21:12:39,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:12:39,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2022-11-18 21:12:39,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:12:39,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2022-11-18 21:12:39,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:12:39,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2022-11-18 21:12:39,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:12:39,124 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2022-11-18 21:12:39,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 21:12:39,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612642464] [2022-11-18 21:12:39,124 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612642464] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 21:12:39,125 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 21:12:39,125 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-18 21:12:39,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807862204] [2022-11-18 21:12:39,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 21:12:39,125 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-18 21:12:39,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 21:12:39,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-18 21:12:39,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-18 21:12:39,126 INFO L87 Difference]: Start difference. First operand 17430 states and 22130 transitions. Second operand has 7 states, 7 states have (on average 16.571428571428573) internal successors, (116), 6 states have internal predecessors, (116), 3 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (18), 3 states have call predecessors, (18), 2 states have call successors, (18) [2022-11-18 21:12:46,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 21:12:46,363 INFO L93 Difference]: Finished difference Result 34929 states and 45576 transitions. [2022-11-18 21:12:46,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-18 21:12:46,364 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.571428571428573) internal successors, (116), 6 states have internal predecessors, (116), 3 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (18), 3 states have call predecessors, (18), 2 states have call successors, (18) Word has length 194 [2022-11-18 21:12:46,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 21:12:46,404 INFO L225 Difference]: With dead ends: 34929 [2022-11-18 21:12:46,404 INFO L226 Difference]: Without dead ends: 21157 [2022-11-18 21:12:46,418 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2022-11-18 21:12:46,418 INFO L413 NwaCegarLoop]: 502 mSDtfsCounter, 603 mSDsluCounter, 1600 mSDsCounter, 0 mSdLazyCounter, 372 mSolverCounterSat, 165 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 606 SdHoareTripleChecker+Valid, 2102 SdHoareTripleChecker+Invalid, 537 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 165 IncrementalHoareTripleChecker+Valid, 372 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-18 21:12:46,419 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [606 Valid, 2102 Invalid, 537 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [165 Valid, 372 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-18 21:12:46,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21157 states. [2022-11-18 21:12:51,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21157 to 17418. [2022-11-18 21:12:51,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17418 states, 12994 states have (on average 1.2662767431122057) internal successors, (16454), 13115 states have internal predecessors, (16454), 2820 states have call successors, (2820), 1603 states have call predecessors, (2820), 1603 states have return successors, (2820), 2699 states have call predecessors, (2820), 2820 states have call successors, (2820) [2022-11-18 21:12:51,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17418 states to 17418 states and 22094 transitions. [2022-11-18 21:12:51,290 INFO L78 Accepts]: Start accepts. Automaton has 17418 states and 22094 transitions. Word has length 194 [2022-11-18 21:12:51,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 21:12:51,291 INFO L495 AbstractCegarLoop]: Abstraction has 17418 states and 22094 transitions. [2022-11-18 21:12:51,291 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.571428571428573) internal successors, (116), 6 states have internal predecessors, (116), 3 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (18), 3 states have call predecessors, (18), 2 states have call successors, (18) [2022-11-18 21:12:51,291 INFO L276 IsEmpty]: Start isEmpty. Operand 17418 states and 22094 transitions. [2022-11-18 21:12:51,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2022-11-18 21:12:51,297 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 21:12:51,297 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 21:12:51,297 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2022-11-18 21:12:51,298 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 21:12:51,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 21:12:51,298 INFO L85 PathProgramCache]: Analyzing trace with hash -66218514, now seen corresponding path program 1 times [2022-11-18 21:12:51,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 21:12:51,298 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588239651] [2022-11-18 21:12:51,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 21:12:51,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 21:12:51,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-18 21:12:51,350 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-18 21:12:51,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-18 21:12:51,493 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-18 21:12:51,493 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-18 21:12:51,494 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-18 21:12:51,496 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2022-11-18 21:12:51,499 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] [2022-11-18 21:12:51,511 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-18 21:12:51,743 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 09:12:51 BoogieIcfgContainer [2022-11-18 21:12:51,743 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-18 21:12:51,744 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-18 21:12:51,744 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-18 21:12:51,744 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-18 21:12:51,744 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 09:08:37" (3/4) ... [2022-11-18 21:12:51,746 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-18 21:12:51,977 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a03a397-50b2-4fa7-9e70-08fdf5753c02/bin/uautomizer-TMbwUNV5ro/witness.graphml [2022-11-18 21:12:51,978 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-18 21:12:51,979 INFO L158 Benchmark]: Toolchain (without parser) took 256530.48ms. Allocated memory was 107.0MB in the beginning and 4.9GB in the end (delta: 4.7GB). Free memory was 67.3MB in the beginning and 2.1GB in the end (delta: -2.0GB). Peak memory consumption was 2.7GB. Max. memory is 16.1GB. [2022-11-18 21:12:51,980 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 107.0MB. Free memory is still 84.6MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-18 21:12:51,980 INFO L158 Benchmark]: CACSL2BoogieTranslator took 576.92ms. Allocated memory is still 107.0MB. Free memory was 67.1MB in the beginning and 74.0MB in the end (delta: -6.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-11-18 21:12:51,983 INFO L158 Benchmark]: Boogie Procedure Inliner took 85.95ms. Allocated memory is still 107.0MB. Free memory was 74.0MB in the beginning and 70.5MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-18 21:12:51,983 INFO L158 Benchmark]: Boogie Preprocessor took 41.60ms. Allocated memory is still 107.0MB. Free memory was 70.5MB in the beginning and 67.8MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-18 21:12:51,984 INFO L158 Benchmark]: RCFGBuilder took 1013.97ms. Allocated memory was 107.0MB in the beginning and 144.7MB in the end (delta: 37.7MB). Free memory was 67.8MB in the beginning and 114.3MB in the end (delta: -46.5MB). Peak memory consumption was 32.5MB. Max. memory is 16.1GB. [2022-11-18 21:12:51,984 INFO L158 Benchmark]: TraceAbstraction took 254569.53ms. Allocated memory was 144.7MB in the beginning and 4.9GB in the end (delta: 4.7GB). Free memory was 113.4MB in the beginning and 2.1GB in the end (delta: -2.0GB). Peak memory consumption was 2.7GB. Max. memory is 16.1GB. [2022-11-18 21:12:51,984 INFO L158 Benchmark]: Witness Printer took 234.24ms. Allocated memory is still 4.9GB. Free memory was 2.1GB in the beginning and 2.1GB in the end (delta: 32.5MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2022-11-18 21:12:51,985 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.29ms. Allocated memory is still 107.0MB. Free memory is still 84.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 576.92ms. Allocated memory is still 107.0MB. Free memory was 67.1MB in the beginning and 74.0MB in the end (delta: -6.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 85.95ms. Allocated memory is still 107.0MB. Free memory was 74.0MB in the beginning and 70.5MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 41.60ms. Allocated memory is still 107.0MB. Free memory was 70.5MB in the beginning and 67.8MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1013.97ms. Allocated memory was 107.0MB in the beginning and 144.7MB in the end (delta: 37.7MB). Free memory was 67.8MB in the beginning and 114.3MB in the end (delta: -46.5MB). Peak memory consumption was 32.5MB. Max. memory is 16.1GB. * TraceAbstraction took 254569.53ms. Allocated memory was 144.7MB in the beginning and 4.9GB in the end (delta: 4.7GB). Free memory was 113.4MB in the beginning and 2.1GB in the end (delta: -2.0GB). Peak memory consumption was 2.7GB. Max. memory is 16.1GB. * Witness Printer took 234.24ms. Allocated memory is still 4.9GB. Free memory was 2.1GB in the beginning and 2.1GB 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: 619]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L25] port_t cs1 ; [L28] port_t cs2 ; [L48] int8_t s2p_new ; [L32] int8_t s1s2_old ; [L27] int8_t cs1_new ; [L31] port_t s1s2 ; [L36] int8_t s1s1_new ; [L37] port_t s2s1 ; [L34] port_t s1s1 ; [L40] port_t s2s2 ; [L26] int8_t cs1_old ; [L62] static _Bool side1Failed_History_2 ; [L61] static _Bool side1Failed_History_1 ; [L60] static _Bool side1Failed_History_0 ; [L47] int8_t s2p_old ; [L30] int8_t cs2_new ; [L70] static msg_t manual_selection_History_1 ; [L71] static msg_t manual_selection_History_2 ; [L45] int8_t s1p_new ; [L54] msg_t side2_written ; [L43] port_t s1p ; [L69] static msg_t manual_selection_History_0 ; [L42] int8_t s2s2_new ; [L29] int8_t cs2_old ; [L44] int8_t s1p_old ; [L65] static _Bool side2Failed_History_2 ; [L38] int8_t s2s1_old ; [L24] msg_t nomsg = (msg_t )-1; [L64] static _Bool side2Failed_History_1 ; [L63] static _Bool side2Failed_History_0 ; [L39] int8_t s2s1_new ; [L51] _Bool side1Failed ; [L41] int8_t s2s2_old ; [L53] msg_t side1_written ; [L46] port_t s2p ; [L35] int8_t s1s1_old ; [L66] static int8_t active_side_History_0 ; [L67] static int8_t active_side_History_1 ; [L52] _Bool side2Failed ; [L68] static int8_t active_side_History_2 ; [L33] int8_t s1s2_new ; VAL [active_side_History_0=0, active_side_History_1=0, active_side_History_2=0, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L542] int c1 ; [L543] int i2 ; [L546] c1 = 0 [L547] side1Failed = __VERIFIER_nondet_bool() [L548] side2Failed = __VERIFIER_nondet_bool() [L549] side1_written = __VERIFIER_nondet_char() [L550] side2_written = __VERIFIER_nondet_char() [L551] side1Failed_History_0 = __VERIFIER_nondet_bool() [L552] side1Failed_History_1 = __VERIFIER_nondet_bool() [L553] side1Failed_History_2 = __VERIFIER_nondet_bool() [L554] side2Failed_History_0 = __VERIFIER_nondet_bool() [L555] side2Failed_History_1 = __VERIFIER_nondet_bool() [L556] side2Failed_History_2 = __VERIFIER_nondet_bool() [L557] active_side_History_0 = __VERIFIER_nondet_char() [L558] active_side_History_1 = __VERIFIER_nondet_char() [L559] active_side_History_2 = __VERIFIER_nondet_char() [L560] manual_selection_History_0 = __VERIFIER_nondet_char() [L561] manual_selection_History_1 = __VERIFIER_nondet_char() [L562] manual_selection_History_2 = __VERIFIER_nondet_char() [L563] CALL, EXPR init() [L197] COND FALSE !((int )side1Failed_History_0 != 0) VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=0, side1Failed_History_0=0, side2_written=0] [L200] COND FALSE !((int )side2Failed_History_0 != 0) VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=0, side1Failed_History_0=0, side2_written=0, side2Failed_History_0=0] [L203] COND FALSE !((int )active_side_History_0 != -2) VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=0, side1Failed_History_0=0, side2_written=0, side2Failed_History_0=0] [L206] COND FALSE !((int )manual_selection_History_0 != 0) VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=0, side1Failed_History_0=0, side2_written=0, side2Failed_History_0=0] [L209] COND FALSE !((int )side1Failed_History_1 != 0) VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=0, side1Failed_History_0=0, side1Failed_History_1=0, side2_written=0, side2Failed_History_0=0] [L212] COND FALSE !((int )side2Failed_History_1 != 0) VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=0, side1Failed_History_0=0, side1Failed_History_1=0, side2_written=0, side2Failed_History_0=0, side2Failed_History_1=0] [L215] COND FALSE !((int )active_side_History_1 != -2) VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=0, side1Failed_History_0=0, side1Failed_History_1=0, side2_written=0, side2Failed_History_0=0, side2Failed_History_1=0] [L218] COND FALSE !((int )manual_selection_History_1 != 0) VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=0, side1Failed_History_0=0, side1Failed_History_1=0, side2_written=0, side2Failed_History_0=0, side2Failed_History_1=0] [L221] COND FALSE !((int )side1Failed_History_2 != 0) VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed_History_0=0, side2Failed_History_1=0] [L224] COND FALSE !((int )side2Failed_History_2 != 0) VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L227] COND FALSE !((int )active_side_History_2 != -2) VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L230] COND FALSE !((int )manual_selection_History_2 != 0) [L233] return (1); VAL [\result=1, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L563] RET, EXPR init() [L563] i2 = init() [L564] CALL assume_abort_if_not(i2) VAL [\old(cond)=1, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L58] COND FALSE !(!cond) VAL [\old(cond)=1, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cond=1, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L564] RET assume_abort_if_not(i2) VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, c1=0, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, i2=1, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L565] cs1_old = nomsg [L566] cs1_new = nomsg [L567] cs2_old = nomsg [L568] cs2_new = nomsg [L569] s1s2_old = nomsg [L570] s1s2_new = nomsg [L571] s1s1_old = nomsg [L572] s1s1_new = nomsg [L573] s2s1_old = nomsg [L574] s2s1_new = nomsg [L575] s2s2_old = nomsg [L576] s2s2_new = nomsg [L577] s1p_old = nomsg [L578] s1p_new = nomsg [L579] s2p_old = nomsg [L580] s2p_new = nomsg [L581] i2 = 0 VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, c1=0, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, i2=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L582] COND TRUE i2 < 10 [L584] CALL Console_task_each_pals_period() [L251] msg_t manual_selection ; [L252] char tmp ; [L255] tmp = __VERIFIER_nondet_char() [L256] manual_selection = tmp [L257] CALL write_manual_selection_history(manual_selection) [L167] manual_selection_History_2 = manual_selection_History_1 [L168] manual_selection_History_1 = manual_selection_History_0 [L169] manual_selection_History_0 = val VAL [\old(val)=-1, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, val=-1] [L257] RET write_manual_selection_history(manual_selection) [L258] cs1_new = manual_selection != nomsg && cs1_new == nomsg ? manual_selection : cs1_new [L259] cs2_new = manual_selection != nomsg && cs2_new == nomsg ? manual_selection : cs2_new [L260] manual_selection = (msg_t )0 VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection=0, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=-1] [L584] RET Console_task_each_pals_period() [L585] CALL Side1_activestandby_task_each_pals_period() [L266] int8_t side1 ; [L267] int8_t side2 ; [L268] msg_t manual_selection ; [L269] int8_t next_state ; [L272] side1 = nomsg [L273] side2 = nomsg [L274] manual_selection = (msg_t )0 [L275] side1Failed = __VERIFIER_nondet_bool() [L276] CALL write_side1_failed_history(side1Failed) [L77] side1Failed_History_2 = side1Failed_History_1 [L78] side1Failed_History_1 = side1Failed_History_0 [L79] side1Failed_History_0 = val VAL [\old(val)=-255, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=0, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, val=-255] [L276] RET write_side1_failed_history(side1Failed) [L277] COND TRUE \read(side1Failed) [L278] s1s1_new = nomsg != nomsg && s1s1_new == nomsg ? nomsg : s1s1_new [L279] s1s2_new = nomsg != nomsg && s1s2_new == nomsg ? nomsg : s1s2_new [L280] s1p_new = nomsg != nomsg && s1p_new == nomsg ? nomsg : s1p_new [L281] side1_written = nomsg VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection=0, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2=-1, side2_written=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L585] RET Side1_activestandby_task_each_pals_period() [L586] CALL Side2_activestandby_task_each_pals_period() [L323] int8_t side1 ; [L324] int8_t side2 ; [L325] msg_t manual_selection ; [L326] int8_t next_state ; [L329] side1 = nomsg [L330] side2 = nomsg [L331] manual_selection = (msg_t )0 [L332] side2Failed = __VERIFIER_nondet_bool() [L333] CALL write_side2_failed_history(side2Failed) [L107] side2Failed_History_2 = side2Failed_History_1 [L108] side2Failed_History_1 = side2Failed_History_0 [L109] side2Failed_History_0 = val VAL [\old(val)=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, val=0] [L333] RET write_side2_failed_history(side2Failed) [L334] COND FALSE !(\read(side2Failed)) [L341] side1 = s1s2_old [L342] s1s2_old = nomsg [L343] side2 = s2s2_old [L344] s2s2_old = nomsg [L345] manual_selection = cs2_old [L346] cs2_old = nomsg VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2=-1, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L347] COND TRUE (int )side1 == (int )side2 [L348] next_state = (int8_t )0 VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, next_state=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2=-1, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L371] s2s1_new = next_state != nomsg && s2s1_new == nomsg ? next_state : s2s1_new [L372] s2s2_new = next_state != nomsg && s2s2_new == nomsg ? next_state : s2s2_new [L373] s2p_new = next_state != nomsg && s2p_new == nomsg ? next_state : s2p_new [L374] side2_written = next_state VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, next_state=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=0, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=-1, s2s2=0, s2s2_new=0, s2s2_old=-1, side1=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2=-1, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L586] RET Side2_activestandby_task_each_pals_period() [L587] CALL Pendulum_prism_task_each_pals_period() [L380] int8_t active_side ; [L381] int8_t tmp ; [L382] int8_t side1 ; [L383] int8_t side2 ; VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=0, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=-1, s2s2=0, s2s2_new=0, s2s2_old=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L386] CALL, EXPR read_active_side_history((unsigned char)0) VAL [\old(index)=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=0, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=-1, s2s2=0, s2s2_new=0, s2s2_old=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L148] COND TRUE (int )index == 0 [L149] return (active_side_History_0); VAL [\old(index)=0, \result=-2, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, index=0, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=0, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=-1, s2s2=0, s2s2_new=0, s2s2_old=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L386] RET, EXPR read_active_side_history((unsigned char)0) VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, read_active_side_history((unsigned char)0)=-2, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=0, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=-1, s2s2=0, s2s2_new=0, s2s2_old=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L386] tmp = read_active_side_history((unsigned char)0) [L387] active_side = tmp [L388] side1 = nomsg [L389] side2 = nomsg [L390] side1 = s1p_old [L391] s1p_old = nomsg [L392] side2 = s2p_old [L393] s2p_old = nomsg VAL [active_side=-2, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=0, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=-1, s2s2=0, s2s2_new=0, s2s2_old=-1, side1=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2=-1, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=-2] [L394] COND FALSE !((int )side1 == 1) VAL [active_side=-2, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=0, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=-1, s2s2=0, s2s2_new=0, s2s2_old=-1, side1=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2=-1, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=-2] [L397] COND FALSE !((int )side2 == 1) VAL [active_side=-2, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=0, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=-1, s2s2=0, s2s2_new=0, s2s2_old=-1, side1=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2=-1, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=-2] [L400] COND FALSE !((int )side1 == 0) VAL [active_side=-2, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=0, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=-1, s2s2=0, s2s2_new=0, s2s2_old=-1, side1=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2=-1, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=-2] [L408] COND TRUE (int )side1 == (int )nomsg VAL [active_side=-2, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=0, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=-1, s2s2=0, s2s2_new=0, s2s2_old=-1, side1=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2=-1, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=-2] [L409] COND FALSE !((int )side2 == 0) [L412] active_side = (int8_t )0 VAL [active_side=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=0, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=-1, s2s2=0, s2s2_new=0, s2s2_old=-1, side1=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2=-1, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=-2] [L417] CALL write_active_side_history(active_side) [L137] active_side_History_2 = active_side_History_1 [L138] active_side_History_1 = active_side_History_0 [L139] active_side_History_0 = val VAL [\old(val)=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=0, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=-1, s2s2=0, s2s2_new=0, s2s2_old=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, val=0] [L417] RET write_active_side_history(active_side) [L587] RET Pendulum_prism_task_each_pals_period() [L588] cs1_old = cs1_new [L589] cs1_new = nomsg [L590] cs2_old = cs2_new [L591] cs2_new = nomsg [L592] s1s2_old = s1s2_new [L593] s1s2_new = nomsg [L594] s1s1_old = s1s1_new [L595] s1s1_new = nomsg [L596] s2s1_old = s2s1_new [L597] s2s1_new = nomsg [L598] s2s2_old = s2s2_new [L599] s2s2_new = nomsg [L600] s1p_old = s1p_new [L601] s1p_new = nomsg [L602] s2p_old = s2p_new [L603] s2p_new = nomsg [L604] CALL, EXPR check() [L423] int tmp ; [L424] msg_t tmp___0 ; [L425] _Bool tmp___1 ; [L426] _Bool tmp___2 ; [L427] _Bool tmp___3 ; [L428] _Bool tmp___4 ; [L429] int8_t tmp___5 ; [L430] _Bool tmp___6 ; [L431] _Bool tmp___7 ; [L432] _Bool tmp___8 ; [L433] int8_t tmp___9 ; [L434] _Bool tmp___10 ; [L435] _Bool tmp___11 ; [L436] _Bool tmp___12 ; [L437] msg_t tmp___13 ; [L438] _Bool tmp___14 ; [L439] _Bool tmp___15 ; [L440] _Bool tmp___16 ; [L441] _Bool tmp___17 ; [L442] int8_t tmp___18 ; [L443] int8_t tmp___19 ; [L444] int8_t tmp___20 ; VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L447] COND FALSE !(! side1Failed) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L450] COND TRUE ! side2Failed [L451] tmp = 1 VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1] [L455] CALL assume_abort_if_not((_Bool )tmp) VAL [\old(cond)=1, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L58] COND FALSE !(!cond) VAL [\old(cond)=1, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cond=1, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L455] RET assume_abort_if_not((_Bool )tmp) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1] [L456] CALL, EXPR read_manual_selection_history((unsigned char)1) VAL [\old(index)=1, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L178] COND FALSE !((int )index == 0) VAL [\old(index)=1, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, index=1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L181] COND TRUE (int )index == 1 [L182] return (manual_selection_History_1); VAL [\old(index)=1, \result=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, index=1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L456] RET, EXPR read_manual_selection_history((unsigned char)1) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, read_manual_selection_history((unsigned char)1)=0, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1] [L456] tmp___0 = read_manual_selection_history((unsigned char)1) [L457] COND TRUE ! tmp___0 VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0] [L458] CALL, EXPR read_side1_failed_history((unsigned char)1) VAL [\old(index)=1, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L88] COND FALSE !((int )index == 0) VAL [\old(index)=1, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, index=1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L91] COND TRUE (int )index == 1 [L92] return (side1Failed_History_1); VAL [\old(index)=1, \result=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, index=1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L458] RET, EXPR read_side1_failed_history((unsigned char)1) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, read_side1_failed_history((unsigned char)1)=0, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0] [L458] tmp___1 = read_side1_failed_history((unsigned char)1) [L459] COND TRUE ! tmp___1 VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0, tmp___1=0] [L460] CALL, EXPR read_side1_failed_history((unsigned char)0) VAL [\old(index)=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L88] COND TRUE (int )index == 0 [L89] return (side1Failed_History_0); VAL [\old(index)=0, \result=-255, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, index=0, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L460] RET, EXPR read_side1_failed_history((unsigned char)0) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, read_side1_failed_history((unsigned char)0)=-255, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0, tmp___1=0] [L460] tmp___2 = read_side1_failed_history((unsigned char)0) [L461] COND FALSE !(! tmp___2) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0, tmp___1=0, tmp___2=1] [L486] CALL, EXPR read_side1_failed_history((unsigned char)1) VAL [\old(index)=1, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L88] COND FALSE !((int )index == 0) VAL [\old(index)=1, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, index=1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L91] COND TRUE (int )index == 1 [L92] return (side1Failed_History_1); VAL [\old(index)=1, \result=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, index=1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L486] RET, EXPR read_side1_failed_history((unsigned char)1) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, read_side1_failed_history((unsigned char)1)=0, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0, tmp___1=0, tmp___2=1] [L486] tmp___7 = read_side1_failed_history((unsigned char)1) [L487] COND FALSE !(\read(tmp___7)) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0, tmp___1=0, tmp___2=1, tmp___7=0] [L502] CALL, EXPR read_side1_failed_history((unsigned char)1) VAL [\old(index)=1, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L88] COND FALSE !((int )index == 0) VAL [\old(index)=1, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, index=1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L91] COND TRUE (int )index == 1 [L92] return (side1Failed_History_1); VAL [\old(index)=1, \result=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, index=1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L502] RET, EXPR read_side1_failed_history((unsigned char)1) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, read_side1_failed_history((unsigned char)1)=0, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0, tmp___1=0, tmp___2=1, tmp___7=0] [L502] tmp___11 = read_side1_failed_history((unsigned char)1) [L503] COND TRUE ! tmp___11 VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0, tmp___1=0, tmp___11=0, tmp___2=1, tmp___7=0] [L504] CALL, EXPR read_side2_failed_history((unsigned char)1) VAL [\old(index)=1, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L118] COND FALSE !((int )index == 0) VAL [\old(index)=1, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, index=1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L121] COND TRUE (int )index == 1 [L122] return (side2Failed_History_1); VAL [\old(index)=1, \result=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, index=1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L504] RET, EXPR read_side2_failed_history((unsigned char)1) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, read_side2_failed_history((unsigned char)1)=0, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0, tmp___1=0, tmp___11=0, tmp___2=1, tmp___7=0] [L504] tmp___12 = read_side2_failed_history((unsigned char)1) [L505] COND FALSE !(\read(tmp___12)) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0, tmp___1=0, tmp___11=0, tmp___12=0, tmp___2=1, tmp___7=0] [L518] CALL, EXPR read_active_side_history((unsigned char)2) VAL [\old(index)=2, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L148] COND FALSE !((int )index == 0) VAL [\old(index)=2, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, index=2, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L151] COND FALSE !((int )index == 1) VAL [\old(index)=2, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, index=2, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L154] COND TRUE (int )index == 2 [L155] return (active_side_History_2); VAL [\old(index)=2, \result=-2, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, index=2, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L518] RET, EXPR read_active_side_history((unsigned char)2) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, read_active_side_history((unsigned char)2)=-2, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0, tmp___1=0, tmp___11=0, tmp___12=0, tmp___2=1, tmp___7=0] [L518] tmp___20 = read_active_side_history((unsigned char)2) [L519] COND FALSE !((int )tmp___20 > -2) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0, tmp___1=0, tmp___11=0, tmp___12=0, tmp___2=1, tmp___20=-2, tmp___7=0] [L537] return (1); VAL [\result=1, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0, tmp___1=0, tmp___11=0, tmp___12=0, tmp___2=1, tmp___20=-2, tmp___7=0] [L604] RET, EXPR check() [L604] c1 = check() [L605] CALL assert(c1) VAL [\old(arg)=1, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L617] COND FALSE !(! arg) VAL [\old(arg)=1, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, arg=1, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L605] RET assert(c1) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, c1=1, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, i2=0, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L606] i2 ++ VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, c1=1, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, i2=1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L582] COND TRUE i2 < 10 [L584] CALL Console_task_each_pals_period() [L251] msg_t manual_selection ; [L252] char tmp ; [L255] tmp = __VERIFIER_nondet_char() [L256] manual_selection = tmp [L257] CALL write_manual_selection_history(manual_selection) [L167] manual_selection_History_2 = manual_selection_History_1 [L168] manual_selection_History_1 = manual_selection_History_0 [L169] manual_selection_History_0 = val VAL [\old(val)=4, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=4, manual_selection_History_1=-1, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, val=4] [L257] RET write_manual_selection_history(manual_selection) [L258] cs1_new = manual_selection != nomsg && cs1_new == nomsg ? manual_selection : cs1_new [L259] cs2_new = manual_selection != nomsg && cs2_new == nomsg ? manual_selection : cs2_new [L260] manual_selection = (msg_t )0 VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=4, cs1_old=-1, cs2=0, cs2_new=4, cs2_old=-1, manual_selection=0, manual_selection_History_0=4, manual_selection_History_1=-1, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=4] [L584] RET Console_task_each_pals_period() [L585] CALL Side1_activestandby_task_each_pals_period() [L266] int8_t side1 ; [L267] int8_t side2 ; [L268] msg_t manual_selection ; [L269] int8_t next_state ; [L272] side1 = nomsg [L273] side2 = nomsg [L274] manual_selection = (msg_t )0 [L275] side1Failed = __VERIFIER_nondet_bool() [L276] CALL write_side1_failed_history(side1Failed) [L77] side1Failed_History_2 = side1Failed_History_1 [L78] side1Failed_History_1 = side1Failed_History_0 [L79] side1Failed_History_0 = val VAL [\old(val)=257, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=4, cs1_old=-1, cs2=0, cs2_new=4, cs2_old=-1, manual_selection_History_0=4, manual_selection_History_1=-1, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, val=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=4, cs1_old=-1, cs2=0, cs2_new=4, cs2_old=-1, manual_selection=0, manual_selection_History_0=4, manual_selection_History_1=-1, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2=-1, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L585] RET Side1_activestandby_task_each_pals_period() [L586] CALL Side2_activestandby_task_each_pals_period() [L323] int8_t side1 ; [L324] int8_t side2 ; [L325] msg_t manual_selection ; [L326] int8_t next_state ; [L329] side1 = nomsg [L330] side2 = nomsg [L331] manual_selection = (msg_t )0 [L332] side2Failed = __VERIFIER_nondet_bool() [L333] CALL write_side2_failed_history(side2Failed) [L107] side2Failed_History_2 = side2Failed_History_1 [L108] side2Failed_History_1 = side2Failed_History_0 [L109] side2Failed_History_0 = val VAL [\old(val)=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=4, cs1_old=-1, cs2=0, cs2_new=4, cs2_old=-1, manual_selection_History_0=4, manual_selection_History_1=-1, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, val=0] [L333] RET write_side2_failed_history(side2Failed) [L334] COND FALSE !(\read(side2Failed)) [L341] side1 = s1s2_old [L342] s1s2_old = nomsg [L343] side2 = s2s2_old [L344] s2s2_old = nomsg [L345] manual_selection = cs2_old [L346] cs2_old = nomsg VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=4, cs1_old=-1, cs2=0, cs2_new=4, cs2_old=-1, manual_selection=-1, manual_selection_History_0=4, manual_selection_History_1=-1, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L347] COND FALSE !((int )side1 == (int )side2) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=4, cs1_old=-1, cs2=0, cs2_new=4, cs2_old=-1, manual_selection=-1, manual_selection_History_0=4, manual_selection_History_1=-1, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L350] COND TRUE (int )side1 == (int )nomsg VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=4, cs1_old=-1, cs2=0, cs2_new=4, cs2_old=-1, manual_selection=-1, manual_selection_History_0=4, manual_selection_History_1=-1, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L351] COND TRUE (int )side2 != (int )nomsg [L352] next_state = (int8_t )0 VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=4, cs1_old=-1, cs2=0, cs2_new=4, cs2_old=-1, manual_selection=-1, manual_selection_History_0=4, manual_selection_History_1=-1, manual_selection_History_2=0, next_state=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L371] s2s1_new = next_state != nomsg && s2s1_new == nomsg ? next_state : s2s1_new [L372] s2s2_new = next_state != nomsg && s2s2_new == nomsg ? next_state : s2s2_new [L373] s2p_new = next_state != nomsg && s2p_new == nomsg ? next_state : s2p_new [L374] side2_written = next_state VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=4, cs1_old=-1, cs2=0, cs2_new=4, cs2_old=-1, manual_selection=-1, manual_selection_History_0=4, manual_selection_History_1=-1, manual_selection_History_2=0, next_state=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=-1, side1=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L586] RET Side2_activestandby_task_each_pals_period() [L587] CALL Pendulum_prism_task_each_pals_period() [L380] int8_t active_side ; [L381] int8_t tmp ; [L382] int8_t side1 ; [L383] int8_t side2 ; VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=4, cs1_old=-1, cs2=0, cs2_new=4, cs2_old=-1, manual_selection_History_0=4, manual_selection_History_1=-1, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L386] CALL, EXPR read_active_side_history((unsigned char)0) VAL [\old(index)=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=4, cs1_old=-1, cs2=0, cs2_new=4, cs2_old=-1, manual_selection_History_0=4, manual_selection_History_1=-1, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L148] COND TRUE (int )index == 0 [L149] return (active_side_History_0); VAL [\old(index)=0, \result=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=4, cs1_old=-1, cs2=0, cs2_new=4, cs2_old=-1, index=0, manual_selection_History_0=4, manual_selection_History_1=-1, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L386] RET, EXPR read_active_side_history((unsigned char)0) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=4, cs1_old=-1, cs2=0, cs2_new=4, cs2_old=-1, manual_selection_History_0=4, manual_selection_History_1=-1, manual_selection_History_2=0, nomsg=-1, read_active_side_history((unsigned char)0)=0, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L386] tmp = read_active_side_history((unsigned char)0) [L387] active_side = tmp [L388] side1 = nomsg [L389] side2 = nomsg [L390] side1 = s1p_old [L391] s1p_old = nomsg [L392] side2 = s2p_old [L393] s2p_old = nomsg VAL [active_side=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=4, cs1_old=-1, cs2=0, cs2_new=4, cs2_old=-1, manual_selection_History_0=4, manual_selection_History_1=-1, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=0, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=-1, side1=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=0] [L394] COND FALSE !((int )side1 == 1) VAL [active_side=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=4, cs1_old=-1, cs2=0, cs2_new=4, cs2_old=-1, manual_selection_History_0=4, manual_selection_History_1=-1, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=0, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=-1, side1=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=0] [L397] COND FALSE !((int )side2 == 1) VAL [active_side=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=4, cs1_old=-1, cs2=0, cs2_new=4, cs2_old=-1, manual_selection_History_0=4, manual_selection_History_1=-1, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=0, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=-1, side1=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=0] [L400] COND FALSE !((int )side1 == 0) VAL [active_side=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=4, cs1_old=-1, cs2=0, cs2_new=4, cs2_old=-1, manual_selection_History_0=4, manual_selection_History_1=-1, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=0, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=-1, side1=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=0] [L408] COND TRUE (int )side1 == (int )nomsg VAL [active_side=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=4, cs1_old=-1, cs2=0, cs2_new=4, cs2_old=-1, manual_selection_History_0=4, manual_selection_History_1=-1, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=0, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=-1, side1=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=0] [L409] COND TRUE (int )side2 == 0 [L410] active_side = (int8_t )2 VAL [active_side=2, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=4, cs1_old=-1, cs2=0, cs2_new=4, cs2_old=-1, manual_selection_History_0=4, manual_selection_History_1=-1, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=0, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=-1, side1=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=0] [L417] CALL write_active_side_history(active_side) [L137] active_side_History_2 = active_side_History_1 [L138] active_side_History_1 = active_side_History_0 [L139] active_side_History_0 = val VAL [\old(val)=2, active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=4, cs1_old=-1, cs2=0, cs2_new=4, cs2_old=-1, manual_selection_History_0=4, manual_selection_History_1=-1, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=0, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, val=2] [L417] RET write_active_side_history(active_side) [L587] RET Pendulum_prism_task_each_pals_period() [L588] cs1_old = cs1_new [L589] cs1_new = nomsg [L590] cs2_old = cs2_new [L591] cs2_new = nomsg [L592] s1s2_old = s1s2_new [L593] s1s2_new = nomsg [L594] s1s1_old = s1s1_new [L595] s1s1_new = nomsg [L596] s2s1_old = s2s1_new [L597] s2s1_new = nomsg [L598] s2s2_old = s2s2_new [L599] s2s2_new = nomsg [L600] s1p_old = s1p_new [L601] s1p_new = nomsg [L602] s2p_old = s2p_new [L603] s2p_new = nomsg [L604] CALL, EXPR check() [L423] int tmp ; [L424] msg_t tmp___0 ; [L425] _Bool tmp___1 ; [L426] _Bool tmp___2 ; [L427] _Bool tmp___3 ; [L428] _Bool tmp___4 ; [L429] int8_t tmp___5 ; [L430] _Bool tmp___6 ; [L431] _Bool tmp___7 ; [L432] _Bool tmp___8 ; [L433] int8_t tmp___9 ; [L434] _Bool tmp___10 ; [L435] _Bool tmp___11 ; [L436] _Bool tmp___12 ; [L437] msg_t tmp___13 ; [L438] _Bool tmp___14 ; [L439] _Bool tmp___15 ; [L440] _Bool tmp___16 ; [L441] _Bool tmp___17 ; [L442] int8_t tmp___18 ; [L443] int8_t tmp___19 ; [L444] int8_t tmp___20 ; VAL [active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=4, cs2=0, cs2_new=-1, cs2_old=4, manual_selection_History_0=4, manual_selection_History_1=-1, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L447] COND FALSE !(! side1Failed) VAL [active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=4, cs2=0, cs2_new=-1, cs2_old=4, manual_selection_History_0=4, manual_selection_History_1=-1, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L450] COND TRUE ! side2Failed [L451] tmp = 1 VAL [active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=4, cs2=0, cs2_new=-1, cs2_old=4, manual_selection_History_0=4, manual_selection_History_1=-1, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1] [L455] CALL assume_abort_if_not((_Bool )tmp) VAL [\old(cond)=1, active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=4, cs2=0, cs2_new=-1, cs2_old=4, manual_selection_History_0=4, manual_selection_History_1=-1, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L58] COND FALSE !(!cond) VAL [\old(cond)=1, active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cond=1, cs1=0, cs1_new=-1, cs1_old=4, cs2=0, cs2_new=-1, cs2_old=4, manual_selection_History_0=4, manual_selection_History_1=-1, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L455] RET assume_abort_if_not((_Bool )tmp) VAL [active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=4, cs2=0, cs2_new=-1, cs2_old=4, manual_selection_History_0=4, manual_selection_History_1=-1, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1] [L456] CALL, EXPR read_manual_selection_history((unsigned char)1) VAL [\old(index)=1, active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=4, cs2=0, cs2_new=-1, cs2_old=4, manual_selection_History_0=4, manual_selection_History_1=-1, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L178] COND FALSE !((int )index == 0) VAL [\old(index)=1, active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=4, cs2=0, cs2_new=-1, cs2_old=4, index=1, manual_selection_History_0=4, manual_selection_History_1=-1, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L181] COND TRUE (int )index == 1 [L182] return (manual_selection_History_1); VAL [\old(index)=1, \result=-1, active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=4, cs2=0, cs2_new=-1, cs2_old=4, index=1, manual_selection_History_0=4, manual_selection_History_1=-1, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L456] RET, EXPR read_manual_selection_history((unsigned char)1) VAL [active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=4, cs2=0, cs2_new=-1, cs2_old=4, manual_selection_History_0=4, manual_selection_History_1=-1, manual_selection_History_2=0, nomsg=-1, read_manual_selection_history((unsigned char)1)=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1] [L456] tmp___0 = read_manual_selection_history((unsigned char)1) [L457] COND FALSE !(! tmp___0) VAL [active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=4, cs2=0, cs2_new=-1, cs2_old=4, manual_selection_History_0=4, manual_selection_History_1=-1, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=-1] [L486] CALL, EXPR read_side1_failed_history((unsigned char)1) VAL [\old(index)=1, active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=4, cs2=0, cs2_new=-1, cs2_old=4, manual_selection_History_0=4, manual_selection_History_1=-1, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L88] COND FALSE !((int )index == 0) VAL [\old(index)=1, active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=4, cs2=0, cs2_new=-1, cs2_old=4, index=1, manual_selection_History_0=4, manual_selection_History_1=-1, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L91] COND TRUE (int )index == 1 [L92] return (side1Failed_History_1); VAL [\old(index)=1, \result=-255, active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=4, cs2=0, cs2_new=-1, cs2_old=4, index=1, manual_selection_History_0=4, manual_selection_History_1=-1, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L486] RET, EXPR read_side1_failed_history((unsigned char)1) VAL [active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=4, cs2=0, cs2_new=-1, cs2_old=4, manual_selection_History_0=4, manual_selection_History_1=-1, manual_selection_History_2=0, nomsg=-1, read_side1_failed_history((unsigned char)1)=-255, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=-1] [L486] tmp___7 = read_side1_failed_history((unsigned char)1) [L487] COND TRUE \read(tmp___7) VAL [active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=4, cs2=0, cs2_new=-1, cs2_old=4, manual_selection_History_0=4, manual_selection_History_1=-1, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=-1, tmp___7=1] [L488] CALL, EXPR read_side2_failed_history((unsigned char)1) VAL [\old(index)=1, active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=4, cs2=0, cs2_new=-1, cs2_old=4, manual_selection_History_0=4, manual_selection_History_1=-1, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L118] COND FALSE !((int )index == 0) VAL [\old(index)=1, active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=4, cs2=0, cs2_new=-1, cs2_old=4, index=1, manual_selection_History_0=4, manual_selection_History_1=-1, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L121] COND TRUE (int )index == 1 [L122] return (side2Failed_History_1); VAL [\old(index)=1, \result=0, active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=4, cs2=0, cs2_new=-1, cs2_old=4, index=1, manual_selection_History_0=4, manual_selection_History_1=-1, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L488] RET, EXPR read_side2_failed_history((unsigned char)1) VAL [active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=4, cs2=0, cs2_new=-1, cs2_old=4, manual_selection_History_0=4, manual_selection_History_1=-1, manual_selection_History_2=0, nomsg=-1, read_side2_failed_history((unsigned char)1)=0, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=-1, tmp___7=1] [L488] tmp___8 = read_side2_failed_history((unsigned char)1) [L489] COND TRUE ! tmp___8 VAL [active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=4, cs2=0, cs2_new=-1, cs2_old=4, manual_selection_History_0=4, manual_selection_History_1=-1, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=-1, tmp___7=1, tmp___8=0] [L490] CALL, EXPR read_active_side_history((unsigned char)0) VAL [\old(index)=0, active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=4, cs2=0, cs2_new=-1, cs2_old=4, manual_selection_History_0=4, manual_selection_History_1=-1, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L148] COND TRUE (int )index == 0 [L149] return (active_side_History_0); VAL [\old(index)=0, \result=2, active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=4, cs2=0, cs2_new=-1, cs2_old=4, index=0, manual_selection_History_0=4, manual_selection_History_1=-1, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L490] RET, EXPR read_active_side_history((unsigned char)0) VAL [active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=4, cs2=0, cs2_new=-1, cs2_old=4, manual_selection_History_0=4, manual_selection_History_1=-1, manual_selection_History_2=0, nomsg=-1, read_active_side_history((unsigned char)0)=2, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=-1, tmp___7=1, tmp___8=0] [L490] tmp___5 = read_active_side_history((unsigned char)0) [L491] COND FALSE !(! ((int )tmp___5 == 2)) VAL [active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=4, cs2=0, cs2_new=-1, cs2_old=4, manual_selection_History_0=4, manual_selection_History_1=-1, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=-1, tmp___5=2, tmp___7=1, tmp___8=0] [L494] CALL, EXPR read_side2_failed_history((unsigned char)0) VAL [\old(index)=0, active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=4, cs2=0, cs2_new=-1, cs2_old=4, manual_selection_History_0=4, manual_selection_History_1=-1, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L118] COND TRUE (int )index == 0 [L119] return (side2Failed_History_0); VAL [\old(index)=0, \result=0, active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=4, cs2=0, cs2_new=-1, cs2_old=4, index=0, manual_selection_History_0=4, manual_selection_History_1=-1, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L494] RET, EXPR read_side2_failed_history((unsigned char)0) VAL [active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=4, cs2=0, cs2_new=-1, cs2_old=4, manual_selection_History_0=4, manual_selection_History_1=-1, manual_selection_History_2=0, nomsg=-1, read_side2_failed_history((unsigned char)0)=0, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=-1, tmp___5=2, tmp___7=1, tmp___8=0] [L494] tmp___6 = read_side2_failed_history((unsigned char)0) [L495] COND TRUE ! tmp___6 VAL [active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=4, cs2=0, cs2_new=-1, cs2_old=4, manual_selection_History_0=4, manual_selection_History_1=-1, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=-1, tmp___5=2, tmp___6=0, tmp___7=1, tmp___8=0] [L496] COND TRUE ! ((int )side2_written == 1) [L497] return (0); VAL [\result=0, active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=4, cs2=0, cs2_new=-1, cs2_old=4, manual_selection_History_0=4, manual_selection_History_1=-1, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=-1, tmp___5=2, tmp___6=0, tmp___7=1, tmp___8=0] [L604] RET, EXPR check() [L604] c1 = check() [L605] CALL assert(c1) VAL [\old(arg)=0, active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=4, cs2=0, cs2_new=-1, cs2_old=4, manual_selection_History_0=4, manual_selection_History_1=-1, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L617] COND TRUE ! arg VAL [\old(arg)=0, active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, arg=0, cs1=0, cs1_new=-1, cs1_old=4, cs2=0, cs2_new=-1, cs2_old=4, manual_selection_History_0=4, manual_selection_History_1=-1, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L619] reach_error() VAL [\old(arg)=0, active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, arg=0, cs1=0, cs1_new=-1, cs1_old=4, cs2=0, cs2_new=-1, cs2_old=4, manual_selection_History_0=4, manual_selection_History_1=-1, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 8 procedures, 181 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 254.3s, OverallIterations: 41, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.2s, AutomataDifference: 178.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 36782 SdHoareTripleChecker+Valid, 40.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 36503 mSDsluCounter, 86603 SdHoareTripleChecker+Invalid, 34.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 69693 mSDsCounter, 18424 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 37283 IncrementalHoareTripleChecker+Invalid, 55707 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 18424 mSolverCounterUnsat, 16910 mSDtfsCounter, 37283 mSolverCounterSat, 0.8s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 5137 GetRequests, 4137 SyntacticMatches, 15 SemanticMatches, 985 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62196 ImplicationChecksByTransitivity, 51.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=17446occurred in iteration=36, InterpolantAutomatonStates: 920, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 49.5s AutomataMinimizationTime, 40 MinimizatonAttempts, 93152 StatesRemovedByMinimization, 32 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.6s SsaConstructionTime, 2.2s SatisfiabilityAnalysisTime, 19.3s InterpolantComputationTime, 6289 NumberOfCodeBlocks, 6289 NumberOfCodeBlocksAsserted, 51 NumberOfCheckSat, 7575 ConstructedInterpolants, 0 QuantifiedInterpolants, 26509 SizeOfPredicates, 36 NumberOfNonLiveVariables, 7656 ConjunctsInSsa, 167 ConjunctsInUnsatCore, 59 InterpolantComputations, 32 PerfectInterpolantSequences, 3213/3717 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-11-18 21:12:52,013 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a03a397-50b2-4fa7-9e70-08fdf5753c02/bin/uautomizer-TMbwUNV5ro/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