./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.1.ufo.BOUNDED-10.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2329fc70 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_30b44354-3cd3-449d-bfc4-e017850c821e/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30b44354-3cd3-449d-bfc4-e017850c821e/bin/uautomizer-uyxdKDjOR8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30b44354-3cd3-449d-bfc4-e017850c821e/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30b44354-3cd3-449d-bfc4-e017850c821e/bin/uautomizer-uyxdKDjOR8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.1.ufo.BOUNDED-10.pals.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30b44354-3cd3-449d-bfc4-e017850c821e/bin/uautomizer-uyxdKDjOR8/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30b44354-3cd3-449d-bfc4-e017850c821e/bin/uautomizer-uyxdKDjOR8 --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 d6dd7af8c681da9a32811252853803422c95f4df19741eb4bc23f2d0511fe647 --- 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-2329fc7 [2022-12-13 14:45:01,164 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 14:45:01,165 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 14:45:01,177 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 14:45:01,178 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 14:45:01,178 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 14:45:01,179 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 14:45:01,180 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 14:45:01,181 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 14:45:01,182 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 14:45:01,182 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 14:45:01,183 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 14:45:01,183 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 14:45:01,184 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 14:45:01,184 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 14:45:01,185 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 14:45:01,186 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 14:45:01,186 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 14:45:01,187 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 14:45:01,188 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 14:45:01,189 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 14:45:01,190 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 14:45:01,191 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 14:45:01,191 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 14:45:01,193 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 14:45:01,194 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 14:45:01,194 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 14:45:01,194 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 14:45:01,195 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 14:45:01,195 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 14:45:01,195 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 14:45:01,196 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 14:45:01,196 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 14:45:01,197 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 14:45:01,197 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 14:45:01,198 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 14:45:01,198 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 14:45:01,198 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 14:45:01,198 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 14:45:01,199 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 14:45:01,199 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 14:45:01,200 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30b44354-3cd3-449d-bfc4-e017850c821e/bin/uautomizer-uyxdKDjOR8/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-12-13 14:45:01,213 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 14:45:01,214 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 14:45:01,214 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 14:45:01,214 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 14:45:01,220 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 14:45:01,220 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 14:45:01,220 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 14:45:01,221 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 14:45:01,221 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 14:45:01,221 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 14:45:01,221 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 14:45:01,221 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 14:45:01,221 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 14:45:01,221 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 14:45:01,222 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 14:45:01,222 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 14:45:01,222 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 14:45:01,222 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 14:45:01,222 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 14:45:01,222 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 14:45:01,222 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 14:45:01,222 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 14:45:01,222 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 14:45:01,223 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 14:45:01,223 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 14:45:01,223 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 14:45:01,223 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 14:45:01,223 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 14:45:01,223 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 14:45:01,223 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 14:45:01,223 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 14:45:01,224 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-13 14:45:01,224 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 14:45:01,224 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 14:45:01,224 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 14:45:01,224 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30b44354-3cd3-449d-bfc4-e017850c821e/bin/uautomizer-uyxdKDjOR8/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_30b44354-3cd3-449d-bfc4-e017850c821e/bin/uautomizer-uyxdKDjOR8 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 -> d6dd7af8c681da9a32811252853803422c95f4df19741eb4bc23f2d0511fe647 [2022-12-13 14:45:01,430 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 14:45:01,446 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 14:45:01,448 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 14:45:01,449 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 14:45:01,450 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 14:45:01,451 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30b44354-3cd3-449d-bfc4-e017850c821e/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.1.ufo.BOUNDED-10.pals.c [2022-12-13 14:45:04,105 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 14:45:04,243 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 14:45:04,243 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30b44354-3cd3-449d-bfc4-e017850c821e/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.1.ufo.BOUNDED-10.pals.c [2022-12-13 14:45:04,249 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30b44354-3cd3-449d-bfc4-e017850c821e/bin/uautomizer-uyxdKDjOR8/data/315198113/69c59c31006b4098aba2b5131cc65e9b/FLAGcc98d6806 [2022-12-13 14:45:04,259 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30b44354-3cd3-449d-bfc4-e017850c821e/bin/uautomizer-uyxdKDjOR8/data/315198113/69c59c31006b4098aba2b5131cc65e9b [2022-12-13 14:45:04,261 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 14:45:04,262 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 14:45:04,263 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 14:45:04,263 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 14:45:04,266 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 14:45:04,266 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 02:45:04" (1/1) ... [2022-12-13 14:45:04,267 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c9b3a2a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:45:04, skipping insertion in model container [2022-12-13 14:45:04,267 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 02:45:04" (1/1) ... [2022-12-13 14:45:04,272 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 14:45:04,294 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 14:45:04,438 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30b44354-3cd3-449d-bfc4-e017850c821e/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.1.ufo.BOUNDED-10.pals.c[11956,11969] [2022-12-13 14:45:04,441 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 14:45:04,449 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 14:45:04,486 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30b44354-3cd3-449d-bfc4-e017850c821e/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.1.ufo.BOUNDED-10.pals.c[11956,11969] [2022-12-13 14:45:04,486 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 14:45:04,496 INFO L208 MainTranslator]: Completed translation [2022-12-13 14:45:04,497 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:45:04 WrapperNode [2022-12-13 14:45:04,497 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 14:45:04,498 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 14:45:04,498 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 14:45:04,498 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 14:45:04,503 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:45:04" (1/1) ... [2022-12-13 14:45:04,511 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:45:04" (1/1) ... [2022-12-13 14:45:04,531 INFO L138 Inliner]: procedures = 27, calls = 46, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 389 [2022-12-13 14:45:04,532 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 14:45:04,532 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 14:45:04,532 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 14:45:04,532 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 14:45:04,539 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:45:04" (1/1) ... [2022-12-13 14:45:04,539 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:45:04" (1/1) ... [2022-12-13 14:45:04,542 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:45:04" (1/1) ... [2022-12-13 14:45:04,542 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:45:04" (1/1) ... [2022-12-13 14:45:04,547 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:45:04" (1/1) ... [2022-12-13 14:45:04,551 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:45:04" (1/1) ... [2022-12-13 14:45:04,553 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:45:04" (1/1) ... [2022-12-13 14:45:04,554 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:45:04" (1/1) ... [2022-12-13 14:45:04,556 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 14:45:04,557 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 14:45:04,557 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 14:45:04,557 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 14:45:04,558 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:45:04" (1/1) ... [2022-12-13 14:45:04,563 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 14:45:04,575 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30b44354-3cd3-449d-bfc4-e017850c821e/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 14:45:04,586 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30b44354-3cd3-449d-bfc4-e017850c821e/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 14:45:04,588 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30b44354-3cd3-449d-bfc4-e017850c821e/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 14:45:04,617 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 14:45:04,617 INFO L130 BoogieDeclarations]: Found specification of procedure write_history_bool [2022-12-13 14:45:04,617 INFO L138 BoogieDeclarations]: Found implementation of procedure write_history_bool [2022-12-13 14:45:04,617 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2022-12-13 14:45:04,617 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2022-12-13 14:45:04,617 INFO L130 BoogieDeclarations]: Found specification of procedure read_history_int8 [2022-12-13 14:45:04,618 INFO L138 BoogieDeclarations]: Found implementation of procedure read_history_int8 [2022-12-13 14:45:04,618 INFO L130 BoogieDeclarations]: Found specification of procedure read_history_bool [2022-12-13 14:45:04,618 INFO L138 BoogieDeclarations]: Found implementation of procedure read_history_bool [2022-12-13 14:45:04,618 INFO L130 BoogieDeclarations]: Found specification of procedure add_history_type [2022-12-13 14:45:04,618 INFO L138 BoogieDeclarations]: Found implementation of procedure add_history_type [2022-12-13 14:45:04,618 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 14:45:04,618 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 14:45:04,619 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 14:45:04,696 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 14:45:04,699 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 14:45:05,128 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 14:45:05,137 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 14:45:05,137 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-12-13 14:45:05,139 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 02:45:05 BoogieIcfgContainer [2022-12-13 14:45:05,139 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 14:45:05,142 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 14:45:05,143 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 14:45:05,146 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 14:45:05,146 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 02:45:04" (1/3) ... [2022-12-13 14:45:05,147 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46690660 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 02:45:05, skipping insertion in model container [2022-12-13 14:45:05,147 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:45:04" (2/3) ... [2022-12-13 14:45:05,147 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46690660 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 02:45:05, skipping insertion in model container [2022-12-13 14:45:05,148 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 02:45:05" (3/3) ... [2022-12-13 14:45:05,149 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_STARTPALS_Triplicated.1.ufo.BOUNDED-10.pals.c [2022-12-13 14:45:05,165 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 14:45:05,165 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-13 14:45:05,203 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 14:45:05,207 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;@42f87b09, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 14:45:05,207 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-12-13 14:45:05,211 INFO L276 IsEmpty]: Start isEmpty. Operand has 175 states, 136 states have (on average 1.6029411764705883) internal successors, (218), 140 states have internal predecessors, (218), 32 states have call successors, (32), 5 states have call predecessors, (32), 5 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2022-12-13 14:45:05,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-12-13 14:45:05,217 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:45:05,218 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 14:45:05,218 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 14:45:05,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:45:05,222 INFO L85 PathProgramCache]: Analyzing trace with hash -1581125196, now seen corresponding path program 1 times [2022-12-13 14:45:05,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:45:05,228 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976620905] [2022-12-13 14:45:05,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:45:05,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:45:05,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:05,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 14:45:05,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:45:05,427 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976620905] [2022-12-13 14:45:05,427 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1976620905] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:45:05,428 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:45:05,428 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 14:45:05,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255478331] [2022-12-13 14:45:05,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:45:05,433 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 14:45:05,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:45:05,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 14:45:05,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 14:45:05,460 INFO L87 Difference]: Start difference. First operand has 175 states, 136 states have (on average 1.6029411764705883) internal successors, (218), 140 states have internal predecessors, (218), 32 states have call successors, (32), 5 states have call predecessors, (32), 5 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:45:05,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:45:05,540 INFO L93 Difference]: Finished difference Result 355 states and 607 transitions. [2022-12-13 14:45:05,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 14:45:05,542 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-12-13 14:45:05,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:45:05,549 INFO L225 Difference]: With dead ends: 355 [2022-12-13 14:45:05,549 INFO L226 Difference]: Without dead ends: 179 [2022-12-13 14:45:05,553 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-12-13 14:45:05,555 INFO L413 NwaCegarLoop]: 269 mSDtfsCounter, 18 mSDsluCounter, 521 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 790 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-12-13 14:45:05,555 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 790 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 14:45:05,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2022-12-13 14:45:05,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 177. [2022-12-13 14:45:05,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 138 states have (on average 1.5434782608695652) internal successors, (213), 141 states have internal predecessors, (213), 32 states have call successors, (32), 6 states have call predecessors, (32), 6 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2022-12-13 14:45:05,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 277 transitions. [2022-12-13 14:45:05,597 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 277 transitions. Word has length 15 [2022-12-13 14:45:05,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:45:05,598 INFO L495 AbstractCegarLoop]: Abstraction has 177 states and 277 transitions. [2022-12-13 14:45:05,598 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:45:05,598 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 277 transitions. [2022-12-13 14:45:05,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-12-13 14:45:05,605 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:45:05,605 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 14:45:05,605 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 14:45:05,605 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 14:45:05,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:45:05,606 INFO L85 PathProgramCache]: Analyzing trace with hash -1712914003, now seen corresponding path program 1 times [2022-12-13 14:45:05,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:45:05,606 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35792389] [2022-12-13 14:45:05,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:45:05,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:45:05,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:05,655 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 14:45:05,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:45:05,656 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35792389] [2022-12-13 14:45:05,656 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [35792389] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:45:05,656 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:45:05,656 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 14:45:05,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851764534] [2022-12-13 14:45:05,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:45:05,657 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 14:45:05,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:45:05,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 14:45:05,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 14:45:05,658 INFO L87 Difference]: Start difference. First operand 177 states and 277 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:45:05,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:45:05,708 INFO L93 Difference]: Finished difference Result 367 states and 577 transitions. [2022-12-13 14:45:05,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 14:45:05,708 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-12-13 14:45:05,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:45:05,709 INFO L225 Difference]: With dead ends: 367 [2022-12-13 14:45:05,710 INFO L226 Difference]: Without dead ends: 193 [2022-12-13 14:45:05,710 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-12-13 14:45:05,711 INFO L413 NwaCegarLoop]: 270 mSDtfsCounter, 25 mSDsluCounter, 529 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 799 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 14:45:05,712 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 799 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 14:45:05,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2022-12-13 14:45:05,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 190. [2022-12-13 14:45:05,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 149 states have (on average 1.523489932885906) internal successors, (227), 152 states have internal predecessors, (227), 33 states have call successors, (33), 7 states have call predecessors, (33), 7 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2022-12-13 14:45:05,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 293 transitions. [2022-12-13 14:45:05,723 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 293 transitions. Word has length 16 [2022-12-13 14:45:05,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:45:05,723 INFO L495 AbstractCegarLoop]: Abstraction has 190 states and 293 transitions. [2022-12-13 14:45:05,723 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:45:05,723 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 293 transitions. [2022-12-13 14:45:05,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-12-13 14:45:05,724 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:45:05,724 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] [2022-12-13 14:45:05,724 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 14:45:05,725 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 14:45:05,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:45:05,725 INFO L85 PathProgramCache]: Analyzing trace with hash -218612603, now seen corresponding path program 1 times [2022-12-13 14:45:05,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:45:05,725 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705296587] [2022-12-13 14:45:05,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:45:05,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:45:05,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:05,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 14:45:05,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:05,775 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 14:45:05,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:45:05,776 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705296587] [2022-12-13 14:45:05,776 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1705296587] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:45:05,776 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:45:05,776 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 14:45:05,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123252182] [2022-12-13 14:45:05,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:45:05,777 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 14:45:05,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:45:05,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 14:45:05,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 14:45:05,778 INFO L87 Difference]: Start difference. First operand 190 states and 293 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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-12-13 14:45:05,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:45:05,799 INFO L93 Difference]: Finished difference Result 399 states and 623 transitions. [2022-12-13 14:45:05,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 14:45:05,799 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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 23 [2022-12-13 14:45:05,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:45:05,801 INFO L225 Difference]: With dead ends: 399 [2022-12-13 14:45:05,801 INFO L226 Difference]: Without dead ends: 219 [2022-12-13 14:45:05,801 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-12-13 14:45:05,802 INFO L413 NwaCegarLoop]: 273 mSDtfsCounter, 22 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 540 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 14:45:05,803 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 540 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 14:45:05,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2022-12-13 14:45:05,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 192. [2022-12-13 14:45:05,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 151 states have (on average 1.5165562913907285) internal successors, (229), 154 states have internal predecessors, (229), 33 states have call successors, (33), 7 states have call predecessors, (33), 7 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2022-12-13 14:45:05,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 295 transitions. [2022-12-13 14:45:05,814 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 295 transitions. Word has length 23 [2022-12-13 14:45:05,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:45:05,815 INFO L495 AbstractCegarLoop]: Abstraction has 192 states and 295 transitions. [2022-12-13 14:45:05,815 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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-12-13 14:45:05,815 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 295 transitions. [2022-12-13 14:45:05,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-12-13 14:45:05,815 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:45:05,816 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] [2022-12-13 14:45:05,816 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 14:45:05,816 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 14:45:05,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:45:05,816 INFO L85 PathProgramCache]: Analyzing trace with hash 805469494, now seen corresponding path program 1 times [2022-12-13 14:45:05,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:45:05,816 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394968767] [2022-12-13 14:45:05,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:45:05,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:45:05,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:05,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 14:45:05,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:05,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 14:45:05,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:05,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 14:45:05,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:45:05,877 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394968767] [2022-12-13 14:45:05,878 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [394968767] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:45:05,878 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:45:05,878 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 14:45:05,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433102424] [2022-12-13 14:45:05,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:45:05,879 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 14:45:05,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:45:05,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 14:45:05,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 14:45:05,880 INFO L87 Difference]: Start difference. First operand 192 states and 295 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-12-13 14:45:05,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:45:05,912 INFO L93 Difference]: Finished difference Result 430 states and 678 transitions. [2022-12-13 14:45:05,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 14:45:05,913 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 31 [2022-12-13 14:45:05,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:45:05,914 INFO L225 Difference]: With dead ends: 430 [2022-12-13 14:45:05,914 INFO L226 Difference]: Without dead ends: 289 [2022-12-13 14:45:05,915 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 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-12-13 14:45:05,915 INFO L413 NwaCegarLoop]: 288 mSDtfsCounter, 120 mSDsluCounter, 546 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 834 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 14:45:05,916 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 834 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 14:45:05,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2022-12-13 14:45:05,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 192. [2022-12-13 14:45:05,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 151 states have (on average 1.490066225165563) internal successors, (225), 154 states have internal predecessors, (225), 33 states have call successors, (33), 7 states have call predecessors, (33), 7 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2022-12-13 14:45:05,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 291 transitions. [2022-12-13 14:45:05,926 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 291 transitions. Word has length 31 [2022-12-13 14:45:05,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:45:05,927 INFO L495 AbstractCegarLoop]: Abstraction has 192 states and 291 transitions. [2022-12-13 14:45:05,927 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-12-13 14:45:05,927 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 291 transitions. [2022-12-13 14:45:05,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-12-13 14:45:05,928 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:45:05,928 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] [2022-12-13 14:45:05,928 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 14:45:05,928 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 14:45:05,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:45:05,928 INFO L85 PathProgramCache]: Analyzing trace with hash -956786536, now seen corresponding path program 1 times [2022-12-13 14:45:05,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:45:05,929 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093053366] [2022-12-13 14:45:05,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:45:05,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:45:05,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:05,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 14:45:05,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:05,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 14:45:05,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:05,995 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 14:45:05,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:45:05,995 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093053366] [2022-12-13 14:45:05,995 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1093053366] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:45:05,996 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:45:05,996 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 14:45:05,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859160557] [2022-12-13 14:45:05,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:45:05,996 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 14:45:05,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:45:05,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 14:45:05,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 14:45:05,997 INFO L87 Difference]: Start difference. First operand 192 states and 291 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-12-13 14:45:06,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:45:06,026 INFO L93 Difference]: Finished difference Result 374 states and 571 transitions. [2022-12-13 14:45:06,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 14:45:06,026 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 32 [2022-12-13 14:45:06,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:45:06,027 INFO L225 Difference]: With dead ends: 374 [2022-12-13 14:45:06,027 INFO L226 Difference]: Without dead ends: 194 [2022-12-13 14:45:06,028 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 14:45:06,028 INFO L413 NwaCegarLoop]: 266 mSDtfsCounter, 0 mSDsluCounter, 786 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1052 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 14:45:06,029 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1052 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 14:45:06,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2022-12-13 14:45:06,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 192. [2022-12-13 14:45:06,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 151 states have (on average 1.4834437086092715) internal successors, (224), 154 states have internal predecessors, (224), 33 states have call successors, (33), 7 states have call predecessors, (33), 7 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2022-12-13 14:45:06,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 290 transitions. [2022-12-13 14:45:06,037 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 290 transitions. Word has length 32 [2022-12-13 14:45:06,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:45:06,037 INFO L495 AbstractCegarLoop]: Abstraction has 192 states and 290 transitions. [2022-12-13 14:45:06,038 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-12-13 14:45:06,038 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 290 transitions. [2022-12-13 14:45:06,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-12-13 14:45:06,038 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:45:06,039 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] [2022-12-13 14:45:06,039 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 14:45:06,039 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 14:45:06,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:45:06,039 INFO L85 PathProgramCache]: Analyzing trace with hash -1412048612, now seen corresponding path program 1 times [2022-12-13 14:45:06,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:45:06,039 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736838473] [2022-12-13 14:45:06,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:45:06,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:45:06,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:06,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 14:45:06,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:06,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 14:45:06,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:06,097 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 14:45:06,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:45:06,097 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736838473] [2022-12-13 14:45:06,098 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [736838473] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 14:45:06,098 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [682361629] [2022-12-13 14:45:06,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:45:06,098 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 14:45:06,098 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30b44354-3cd3-449d-bfc4-e017850c821e/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 14:45:06,099 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30b44354-3cd3-449d-bfc4-e017850c821e/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 14:45:06,100 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30b44354-3cd3-449d-bfc4-e017850c821e/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-13 14:45:06,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:06,171 INFO L263 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-13 14:45:06,174 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 14:45:06,216 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 14:45:06,217 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 14:45:06,251 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 14:45:06,251 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [682361629] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 14:45:06,251 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 14:45:06,251 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2022-12-13 14:45:06,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952830114] [2022-12-13 14:45:06,252 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 14:45:06,252 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 14:45:06,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:45:06,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 14:45:06,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-13 14:45:06,252 INFO L87 Difference]: Start difference. First operand 192 states and 290 transitions. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-13 14:45:06,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:45:06,295 INFO L93 Difference]: Finished difference Result 432 states and 667 transitions. [2022-12-13 14:45:06,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 14:45:06,296 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 35 [2022-12-13 14:45:06,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:45:06,298 INFO L225 Difference]: With dead ends: 432 [2022-12-13 14:45:06,298 INFO L226 Difference]: Without dead ends: 251 [2022-12-13 14:45:06,299 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 72 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-13 14:45:06,300 INFO L413 NwaCegarLoop]: 279 mSDtfsCounter, 58 mSDsluCounter, 764 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 1043 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 14:45:06,301 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 1043 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 14:45:06,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2022-12-13 14:45:06,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 245. [2022-12-13 14:45:06,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 194 states have (on average 1.458762886597938) internal successors, (283), 197 states have internal predecessors, (283), 43 states have call successors, (43), 7 states have call predecessors, (43), 7 states have return successors, (43), 43 states have call predecessors, (43), 43 states have call successors, (43) [2022-12-13 14:45:06,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 369 transitions. [2022-12-13 14:45:06,318 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 369 transitions. Word has length 35 [2022-12-13 14:45:06,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:45:06,318 INFO L495 AbstractCegarLoop]: Abstraction has 245 states and 369 transitions. [2022-12-13 14:45:06,319 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-13 14:45:06,319 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 369 transitions. [2022-12-13 14:45:06,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-12-13 14:45:06,320 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:45:06,320 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 14:45:06,326 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30b44354-3cd3-449d-bfc4-e017850c821e/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-13 14:45:06,521 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30b44354-3cd3-449d-bfc4-e017850c821e/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 14:45:06,522 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 14:45:06,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:45:06,524 INFO L85 PathProgramCache]: Analyzing trace with hash 1166895868, now seen corresponding path program 2 times [2022-12-13 14:45:06,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:45:06,525 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792858603] [2022-12-13 14:45:06,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:45:06,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:45:06,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:06,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 14:45:06,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:06,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 14:45:06,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:06,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-12-13 14:45:06,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:06,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-12-13 14:45:06,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:06,699 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-12-13 14:45:06,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:45:06,700 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792858603] [2022-12-13 14:45:06,700 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1792858603] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:45:06,700 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:45:06,700 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 14:45:06,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073234122] [2022-12-13 14:45:06,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:45:06,701 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 14:45:06,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:45:06,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 14:45:06,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 14:45:06,701 INFO L87 Difference]: Start difference. First operand 245 states and 369 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-12-13 14:45:06,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:45:06,750 INFO L93 Difference]: Finished difference Result 470 states and 728 transitions. [2022-12-13 14:45:06,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 14:45:06,750 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 57 [2022-12-13 14:45:06,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:45:06,752 INFO L225 Difference]: With dead ends: 470 [2022-12-13 14:45:06,752 INFO L226 Difference]: Without dead ends: 254 [2022-12-13 14:45:06,753 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 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-12-13 14:45:06,754 INFO L413 NwaCegarLoop]: 265 mSDtfsCounter, 19 mSDsluCounter, 512 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 777 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 14:45:06,755 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 777 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 14:45:06,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2022-12-13 14:45:06,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 252. [2022-12-13 14:45:06,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 200 states have (on average 1.455) internal successors, (291), 203 states have internal predecessors, (291), 43 states have call successors, (43), 8 states have call predecessors, (43), 8 states have return successors, (43), 43 states have call predecessors, (43), 43 states have call successors, (43) [2022-12-13 14:45:06,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 377 transitions. [2022-12-13 14:45:06,771 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 377 transitions. Word has length 57 [2022-12-13 14:45:06,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:45:06,771 INFO L495 AbstractCegarLoop]: Abstraction has 252 states and 377 transitions. [2022-12-13 14:45:06,772 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-12-13 14:45:06,772 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 377 transitions. [2022-12-13 14:45:06,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-12-13 14:45:06,773 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:45:06,773 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 14:45:06,773 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 14:45:06,773 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 14:45:06,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:45:06,773 INFO L85 PathProgramCache]: Analyzing trace with hash 1021652299, now seen corresponding path program 1 times [2022-12-13 14:45:06,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:45:06,774 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489432950] [2022-12-13 14:45:06,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:45:06,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:45:06,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:06,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 14:45:06,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:06,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 14:45:06,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:06,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-12-13 14:45:06,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:06,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-12-13 14:45:06,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:06,823 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-12-13 14:45:06,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:45:06,824 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489432950] [2022-12-13 14:45:06,824 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [489432950] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:45:06,824 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:45:06,824 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 14:45:06,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717153638] [2022-12-13 14:45:06,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:45:06,825 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 14:45:06,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:45:06,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 14:45:06,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 14:45:06,826 INFO L87 Difference]: Start difference. First operand 252 states and 377 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-12-13 14:45:06,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:45:06,865 INFO L93 Difference]: Finished difference Result 514 states and 780 transitions. [2022-12-13 14:45:06,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 14:45:06,866 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 57 [2022-12-13 14:45:06,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:45:06,868 INFO L225 Difference]: With dead ends: 514 [2022-12-13 14:45:06,868 INFO L226 Difference]: Without dead ends: 291 [2022-12-13 14:45:06,868 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 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-12-13 14:45:06,869 INFO L413 NwaCegarLoop]: 272 mSDtfsCounter, 24 mSDsluCounter, 519 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 791 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 14:45:06,870 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 791 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 14:45:06,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2022-12-13 14:45:06,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 288. [2022-12-13 14:45:06,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 232 states have (on average 1.4137931034482758) internal successors, (328), 235 states have internal predecessors, (328), 46 states have call successors, (46), 9 states have call predecessors, (46), 9 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2022-12-13 14:45:06,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 420 transitions. [2022-12-13 14:45:06,885 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 420 transitions. Word has length 57 [2022-12-13 14:45:06,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:45:06,886 INFO L495 AbstractCegarLoop]: Abstraction has 288 states and 420 transitions. [2022-12-13 14:45:06,886 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-12-13 14:45:06,886 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 420 transitions. [2022-12-13 14:45:06,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-12-13 14:45:06,887 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:45:06,887 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-12-13 14:45:06,887 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 14:45:06,887 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 14:45:06,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:45:06,888 INFO L85 PathProgramCache]: Analyzing trace with hash -1670828143, now seen corresponding path program 1 times [2022-12-13 14:45:06,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:45:06,888 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401355728] [2022-12-13 14:45:06,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:45:06,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:45:06,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:06,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 14:45:06,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:06,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 14:45:06,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:06,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-12-13 14:45:06,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:06,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-12-13 14:45:06,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:06,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-12-13 14:45:06,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:06,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 14:45:06,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:06,989 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2022-12-13 14:45:06,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:45:06,990 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401355728] [2022-12-13 14:45:06,990 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401355728] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:45:06,990 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:45:06,990 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 14:45:06,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888030109] [2022-12-13 14:45:06,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:45:06,990 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 14:45:06,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:45:06,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 14:45:06,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 14:45:06,991 INFO L87 Difference]: Start difference. First operand 288 states and 420 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-12-13 14:45:07,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:45:07,020 INFO L93 Difference]: Finished difference Result 525 states and 779 transitions. [2022-12-13 14:45:07,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 14:45:07,020 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 75 [2022-12-13 14:45:07,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:45:07,021 INFO L225 Difference]: With dead ends: 525 [2022-12-13 14:45:07,021 INFO L226 Difference]: Without dead ends: 290 [2022-12-13 14:45:07,022 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 14:45:07,023 INFO L413 NwaCegarLoop]: 266 mSDtfsCounter, 0 mSDsluCounter, 786 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1052 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 14:45:07,023 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1052 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 14:45:07,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2022-12-13 14:45:07,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 288. [2022-12-13 14:45:07,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 232 states have (on average 1.4008620689655173) internal successors, (325), 235 states have internal predecessors, (325), 46 states have call successors, (46), 9 states have call predecessors, (46), 9 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2022-12-13 14:45:07,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 417 transitions. [2022-12-13 14:45:07,032 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 417 transitions. Word has length 75 [2022-12-13 14:45:07,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:45:07,032 INFO L495 AbstractCegarLoop]: Abstraction has 288 states and 417 transitions. [2022-12-13 14:45:07,032 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-12-13 14:45:07,032 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 417 transitions. [2022-12-13 14:45:07,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2022-12-13 14:45:07,033 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:45:07,033 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 6, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 14:45:07,033 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 14:45:07,033 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 14:45:07,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:45:07,034 INFO L85 PathProgramCache]: Analyzing trace with hash -1243330431, now seen corresponding path program 1 times [2022-12-13 14:45:07,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:45:07,034 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855955707] [2022-12-13 14:45:07,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:45:07,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:45:07,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:07,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 14:45:07,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:07,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 14:45:07,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:07,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-12-13 14:45:07,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:07,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-12-13 14:45:07,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:07,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-12-13 14:45:07,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:07,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 14:45:07,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:07,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-12-13 14:45:07,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:07,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-12-13 14:45:07,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:07,109 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2022-12-13 14:45:07,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:45:07,109 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855955707] [2022-12-13 14:45:07,109 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [855955707] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:45:07,109 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:45:07,109 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 14:45:07,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398025763] [2022-12-13 14:45:07,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:45:07,110 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 14:45:07,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:45:07,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 14:45:07,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 14:45:07,110 INFO L87 Difference]: Start difference. First operand 288 states and 417 transitions. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-12-13 14:45:07,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:45:07,150 INFO L93 Difference]: Finished difference Result 562 states and 835 transitions. [2022-12-13 14:45:07,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 14:45:07,151 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 104 [2022-12-13 14:45:07,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:45:07,152 INFO L225 Difference]: With dead ends: 562 [2022-12-13 14:45:07,152 INFO L226 Difference]: Without dead ends: 332 [2022-12-13 14:45:07,153 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-12-13 14:45:07,153 INFO L413 NwaCegarLoop]: 272 mSDtfsCounter, 25 mSDsluCounter, 519 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 791 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 14:45:07,153 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 791 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 14:45:07,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2022-12-13 14:45:07,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 329. [2022-12-13 14:45:07,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 329 states, 269 states have (on average 1.3643122676579926) internal successors, (367), 272 states have internal predecessors, (367), 49 states have call successors, (49), 10 states have call predecessors, (49), 10 states have return successors, (49), 49 states have call predecessors, (49), 49 states have call successors, (49) [2022-12-13 14:45:07,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 465 transitions. [2022-12-13 14:45:07,163 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 465 transitions. Word has length 104 [2022-12-13 14:45:07,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:45:07,164 INFO L495 AbstractCegarLoop]: Abstraction has 329 states and 465 transitions. [2022-12-13 14:45:07,164 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-12-13 14:45:07,164 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 465 transitions. [2022-12-13 14:45:07,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-12-13 14:45:07,164 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:45:07,164 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 14:45:07,165 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 14:45:07,165 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 14:45:07,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:45:07,165 INFO L85 PathProgramCache]: Analyzing trace with hash -712190712, now seen corresponding path program 1 times [2022-12-13 14:45:07,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:45:07,165 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512104477] [2022-12-13 14:45:07,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:45:07,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:45:07,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:07,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 14:45:07,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:07,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 14:45:07,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:07,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-12-13 14:45:07,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:07,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-12-13 14:45:07,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:07,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-12-13 14:45:07,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:07,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 14:45:07,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:07,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-12-13 14:45:07,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:07,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-12-13 14:45:07,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:07,238 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2022-12-13 14:45:07,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:45:07,238 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512104477] [2022-12-13 14:45:07,238 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1512104477] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:45:07,238 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:45:07,238 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 14:45:07,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292674017] [2022-12-13 14:45:07,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:45:07,239 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 14:45:07,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:45:07,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 14:45:07,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 14:45:07,239 INFO L87 Difference]: Start difference. First operand 329 states and 465 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, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-12-13 14:45:07,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:45:07,273 INFO L93 Difference]: Finished difference Result 588 states and 855 transitions. [2022-12-13 14:45:07,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 14:45:07,273 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, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 105 [2022-12-13 14:45:07,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:45:07,275 INFO L225 Difference]: With dead ends: 588 [2022-12-13 14:45:07,275 INFO L226 Difference]: Without dead ends: 323 [2022-12-13 14:45:07,275 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-12-13 14:45:07,276 INFO L413 NwaCegarLoop]: 258 mSDtfsCounter, 15 mSDsluCounter, 492 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 750 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 14:45:07,276 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 750 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 14:45:07,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2022-12-13 14:45:07,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 323. [2022-12-13 14:45:07,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 323 states, 264 states have (on average 1.3446969696969697) internal successors, (355), 267 states have internal predecessors, (355), 48 states have call successors, (48), 10 states have call predecessors, (48), 10 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2022-12-13 14:45:07,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 451 transitions. [2022-12-13 14:45:07,286 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 451 transitions. Word has length 105 [2022-12-13 14:45:07,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:45:07,286 INFO L495 AbstractCegarLoop]: Abstraction has 323 states and 451 transitions. [2022-12-13 14:45:07,286 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, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-12-13 14:45:07,286 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 451 transitions. [2022-12-13 14:45:07,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-12-13 14:45:07,287 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:45:07,287 INFO L195 NwaCegarLoop]: trace histogram [8, 7, 7, 6, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-12-13 14:45:07,287 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 14:45:07,287 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 14:45:07,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:45:07,288 INFO L85 PathProgramCache]: Analyzing trace with hash 1828942627, now seen corresponding path program 1 times [2022-12-13 14:45:07,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:45:07,288 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593113852] [2022-12-13 14:45:07,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:45:07,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:45:07,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:07,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 14:45:07,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:07,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 14:45:07,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:07,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-12-13 14:45:07,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:07,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-12-13 14:45:07,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:07,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-12-13 14:45:07,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:07,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 14:45:07,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:07,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-12-13 14:45:07,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:07,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-12-13 14:45:07,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:07,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-12-13 14:45:07,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:07,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-12-13 14:45:07,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:07,373 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 198 trivial. 0 not checked. [2022-12-13 14:45:07,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:45:07,374 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593113852] [2022-12-13 14:45:07,374 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [593113852] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:45:07,374 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:45:07,374 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 14:45:07,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915113816] [2022-12-13 14:45:07,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:45:07,374 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 14:45:07,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:45:07,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 14:45:07,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 14:45:07,375 INFO L87 Difference]: Start difference. First operand 323 states and 451 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2022-12-13 14:45:07,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:45:07,396 INFO L93 Difference]: Finished difference Result 563 states and 804 transitions. [2022-12-13 14:45:07,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 14:45:07,396 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) Word has length 124 [2022-12-13 14:45:07,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:45:07,398 INFO L225 Difference]: With dead ends: 563 [2022-12-13 14:45:07,398 INFO L226 Difference]: Without dead ends: 325 [2022-12-13 14:45:07,398 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 14:45:07,399 INFO L413 NwaCegarLoop]: 262 mSDtfsCounter, 0 mSDsluCounter, 775 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1037 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 14:45:07,399 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1037 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 14:45:07,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2022-12-13 14:45:07,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 323. [2022-12-13 14:45:07,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 323 states, 264 states have (on average 1.3333333333333333) internal successors, (352), 267 states have internal predecessors, (352), 48 states have call successors, (48), 10 states have call predecessors, (48), 10 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2022-12-13 14:45:07,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 448 transitions. [2022-12-13 14:45:07,408 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 448 transitions. Word has length 124 [2022-12-13 14:45:07,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:45:07,409 INFO L495 AbstractCegarLoop]: Abstraction has 323 states and 448 transitions. [2022-12-13 14:45:07,409 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2022-12-13 14:45:07,409 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 448 transitions. [2022-12-13 14:45:07,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2022-12-13 14:45:07,410 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:45:07,410 INFO L195 NwaCegarLoop]: trace histogram [10, 9, 9, 9, 7, 6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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-12-13 14:45:07,410 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-13 14:45:07,410 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 14:45:07,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:45:07,411 INFO L85 PathProgramCache]: Analyzing trace with hash 1531403375, now seen corresponding path program 1 times [2022-12-13 14:45:07,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:45:07,411 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609257191] [2022-12-13 14:45:07,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:45:07,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:45:07,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:07,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 14:45:07,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:07,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 14:45:07,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:07,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-12-13 14:45:07,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:07,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-12-13 14:45:07,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:07,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-12-13 14:45:07,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:07,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 14:45:07,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:07,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-12-13 14:45:07,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:07,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-12-13 14:45:07,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:07,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-12-13 14:45:07,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:07,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-12-13 14:45:07,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:07,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-12-13 14:45:07,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:07,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-12-13 14:45:07,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:07,496 INFO L134 CoverageAnalysis]: Checked inductivity of 399 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 399 trivial. 0 not checked. [2022-12-13 14:45:07,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:45:07,496 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609257191] [2022-12-13 14:45:07,496 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1609257191] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:45:07,496 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:45:07,496 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 14:45:07,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051020343] [2022-12-13 14:45:07,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:45:07,497 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 14:45:07,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:45:07,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 14:45:07,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 14:45:07,497 INFO L87 Difference]: Start difference. First operand 323 states and 448 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 3 states have internal predecessors, (42), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-12-13 14:45:07,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:45:07,534 INFO L93 Difference]: Finished difference Result 526 states and 764 transitions. [2022-12-13 14:45:07,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 14:45:07,534 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 3 states have internal predecessors, (42), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 157 [2022-12-13 14:45:07,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:45:07,535 INFO L225 Difference]: With dead ends: 526 [2022-12-13 14:45:07,535 INFO L226 Difference]: Without dead ends: 321 [2022-12-13 14:45:07,536 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 26 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-12-13 14:45:07,536 INFO L413 NwaCegarLoop]: 246 mSDtfsCounter, 13 mSDsluCounter, 472 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 718 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 14:45:07,537 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 718 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 14:45:07,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2022-12-13 14:45:07,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 321. [2022-12-13 14:45:07,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 321 states, 263 states have (on average 1.3307984790874525) internal successors, (350), 266 states have internal predecessors, (350), 47 states have call successors, (47), 10 states have call predecessors, (47), 10 states have return successors, (47), 47 states have call predecessors, (47), 47 states have call successors, (47) [2022-12-13 14:45:07,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 444 transitions. [2022-12-13 14:45:07,545 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 444 transitions. Word has length 157 [2022-12-13 14:45:07,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:45:07,546 INFO L495 AbstractCegarLoop]: Abstraction has 321 states and 444 transitions. [2022-12-13 14:45:07,546 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 3 states have internal predecessors, (42), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-12-13 14:45:07,546 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 444 transitions. [2022-12-13 14:45:07,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2022-12-13 14:45:07,547 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:45:07,547 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 9, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-13 14:45:07,547 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-13 14:45:07,548 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 14:45:07,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:45:07,548 INFO L85 PathProgramCache]: Analyzing trace with hash -124413893, now seen corresponding path program 1 times [2022-12-13 14:45:07,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:45:07,548 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256271077] [2022-12-13 14:45:07,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:45:07,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:45:07,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:07,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 14:45:07,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:07,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 14:45:07,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:07,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-12-13 14:45:07,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:07,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-12-13 14:45:07,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:07,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-12-13 14:45:07,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:07,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 14:45:07,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:07,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-12-13 14:45:07,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:07,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-12-13 14:45:07,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:07,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-12-13 14:45:07,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:07,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-12-13 14:45:07,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:07,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-12-13 14:45:07,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:07,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-12-13 14:45:07,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:07,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-12-13 14:45:07,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:07,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 14:45:07,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:07,645 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 408 trivial. 0 not checked. [2022-12-13 14:45:07,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:45:07,645 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256271077] [2022-12-13 14:45:07,645 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1256271077] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:45:07,645 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:45:07,645 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 14:45:07,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503675033] [2022-12-13 14:45:07,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:45:07,646 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 14:45:07,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:45:07,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 14:45:07,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 14:45:07,646 INFO L87 Difference]: Start difference. First operand 321 states and 444 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 3 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2022-12-13 14:45:07,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:45:07,682 INFO L93 Difference]: Finished difference Result 466 states and 660 transitions. [2022-12-13 14:45:07,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 14:45:07,682 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 3 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) Word has length 172 [2022-12-13 14:45:07,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:45:07,684 INFO L225 Difference]: With dead ends: 466 [2022-12-13 14:45:07,684 INFO L226 Difference]: Without dead ends: 304 [2022-12-13 14:45:07,684 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 30 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-12-13 14:45:07,685 INFO L413 NwaCegarLoop]: 245 mSDtfsCounter, 35 mSDsluCounter, 454 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 699 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 14:45:07,685 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 699 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 14:45:07,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2022-12-13 14:45:07,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 304. [2022-12-13 14:45:07,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 304 states, 249 states have (on average 1.321285140562249) internal successors, (329), 252 states have internal predecessors, (329), 44 states have call successors, (44), 10 states have call predecessors, (44), 10 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2022-12-13 14:45:07,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 417 transitions. [2022-12-13 14:45:07,694 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 417 transitions. Word has length 172 [2022-12-13 14:45:07,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:45:07,695 INFO L495 AbstractCegarLoop]: Abstraction has 304 states and 417 transitions. [2022-12-13 14:45:07,695 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 3 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2022-12-13 14:45:07,695 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 417 transitions. [2022-12-13 14:45:07,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2022-12-13 14:45:07,696 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:45:07,696 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 9, 7, 7, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-13 14:45:07,696 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-13 14:45:07,697 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 14:45:07,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:45:07,697 INFO L85 PathProgramCache]: Analyzing trace with hash -225788768, now seen corresponding path program 1 times [2022-12-13 14:45:07,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:45:07,697 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320004667] [2022-12-13 14:45:07,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:45:07,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:45:07,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:07,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 14:45:07,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:07,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 14:45:07,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:07,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-12-13 14:45:07,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:07,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-12-13 14:45:07,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:07,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-12-13 14:45:07,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:07,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 14:45:07,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:07,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-12-13 14:45:07,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:07,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-12-13 14:45:07,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:07,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-12-13 14:45:07,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:07,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-12-13 14:45:07,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:07,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-12-13 14:45:07,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:07,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-12-13 14:45:07,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:07,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-12-13 14:45:07,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:07,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 14:45:07,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:07,796 INFO L134 CoverageAnalysis]: Checked inductivity of 456 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 414 trivial. 0 not checked. [2022-12-13 14:45:07,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:45:07,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320004667] [2022-12-13 14:45:07,796 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [320004667] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:45:07,796 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:45:07,796 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 14:45:07,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207828424] [2022-12-13 14:45:07,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:45:07,797 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 14:45:07,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:45:07,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 14:45:07,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 14:45:07,797 INFO L87 Difference]: Start difference. First operand 304 states and 417 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 3 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2022-12-13 14:45:07,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:45:07,834 INFO L93 Difference]: Finished difference Result 449 states and 633 transitions. [2022-12-13 14:45:07,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 14:45:07,834 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 3 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) Word has length 174 [2022-12-13 14:45:07,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:45:07,835 INFO L225 Difference]: With dead ends: 449 [2022-12-13 14:45:07,835 INFO L226 Difference]: Without dead ends: 285 [2022-12-13 14:45:07,836 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 30 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-12-13 14:45:07,836 INFO L413 NwaCegarLoop]: 250 mSDtfsCounter, 30 mSDsluCounter, 453 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 703 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 14:45:07,836 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 703 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 14:45:07,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2022-12-13 14:45:07,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 285. [2022-12-13 14:45:07,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 285 states, 233 states have (on average 1.3133047210300428) internal successors, (306), 236 states have internal predecessors, (306), 41 states have call successors, (41), 10 states have call predecessors, (41), 10 states have return successors, (41), 41 states have call predecessors, (41), 41 states have call successors, (41) [2022-12-13 14:45:07,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 388 transitions. [2022-12-13 14:45:07,844 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 388 transitions. Word has length 174 [2022-12-13 14:45:07,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:45:07,845 INFO L495 AbstractCegarLoop]: Abstraction has 285 states and 388 transitions. [2022-12-13 14:45:07,845 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 3 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2022-12-13 14:45:07,845 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 388 transitions. [2022-12-13 14:45:07,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2022-12-13 14:45:07,846 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:45:07,846 INFO L195 NwaCegarLoop]: trace histogram [10, 9, 9, 9, 7, 6, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-13 14:45:07,846 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-13 14:45:07,846 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 14:45:07,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:45:07,847 INFO L85 PathProgramCache]: Analyzing trace with hash -771772203, now seen corresponding path program 1 times [2022-12-13 14:45:07,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:45:07,847 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574536833] [2022-12-13 14:45:07,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:45:07,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:45:07,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:07,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 14:45:07,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:07,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 14:45:07,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:07,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-12-13 14:45:07,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:07,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-12-13 14:45:07,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:07,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-12-13 14:45:07,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:07,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 14:45:07,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:07,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-12-13 14:45:07,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:07,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-12-13 14:45:07,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:07,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-12-13 14:45:07,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:07,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-12-13 14:45:07,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:07,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-12-13 14:45:07,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:07,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-12-13 14:45:07,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:07,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-12-13 14:45:07,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:07,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 14:45:07,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:07,941 INFO L134 CoverageAnalysis]: Checked inductivity of 405 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 399 trivial. 0 not checked. [2022-12-13 14:45:07,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:45:07,941 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574536833] [2022-12-13 14:45:07,942 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [574536833] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:45:07,942 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:45:07,942 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 14:45:07,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366720318] [2022-12-13 14:45:07,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:45:07,942 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 14:45:07,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:45:07,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 14:45:07,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 14:45:07,943 INFO L87 Difference]: Start difference. First operand 285 states and 388 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2022-12-13 14:45:07,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:45:07,959 INFO L93 Difference]: Finished difference Result 429 states and 603 transitions. [2022-12-13 14:45:07,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 14:45:07,960 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) Word has length 175 [2022-12-13 14:45:07,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:45:07,961 INFO L225 Difference]: With dead ends: 429 [2022-12-13 14:45:07,961 INFO L226 Difference]: Without dead ends: 285 [2022-12-13 14:45:07,961 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 14:45:07,962 INFO L413 NwaCegarLoop]: 256 mSDtfsCounter, 0 mSDsluCounter, 760 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1016 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 14:45:07,962 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1016 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 14:45:07,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2022-12-13 14:45:07,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 285. [2022-12-13 14:45:07,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 285 states, 233 states have (on average 1.2875536480686696) internal successors, (300), 236 states have internal predecessors, (300), 41 states have call successors, (41), 10 states have call predecessors, (41), 10 states have return successors, (41), 41 states have call predecessors, (41), 41 states have call successors, (41) [2022-12-13 14:45:07,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 382 transitions. [2022-12-13 14:45:07,970 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 382 transitions. Word has length 175 [2022-12-13 14:45:07,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:45:07,970 INFO L495 AbstractCegarLoop]: Abstraction has 285 states and 382 transitions. [2022-12-13 14:45:07,971 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2022-12-13 14:45:07,971 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 382 transitions. [2022-12-13 14:45:07,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2022-12-13 14:45:07,972 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:45:07,972 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 9, 9, 9, 6, 6, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 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-12-13 14:45:07,972 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-13 14:45:07,972 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 14:45:07,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:45:07,973 INFO L85 PathProgramCache]: Analyzing trace with hash 171596258, now seen corresponding path program 1 times [2022-12-13 14:45:07,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:45:07,973 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658506210] [2022-12-13 14:45:07,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:45:07,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:45:07,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:08,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 14:45:08,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:08,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 14:45:08,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:08,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-12-13 14:45:08,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:08,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-12-13 14:45:08,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:08,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-12-13 14:45:08,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:08,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 14:45:08,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:08,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-12-13 14:45:08,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:08,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-12-13 14:45:08,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:08,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-12-13 14:45:08,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:08,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-12-13 14:45:08,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:08,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-12-13 14:45:08,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:08,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-12-13 14:45:08,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:08,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-12-13 14:45:08,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:08,083 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 138 proven. 11 refuted. 0 times theorem prover too weak. 379 trivial. 0 not checked. [2022-12-13 14:45:08,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:45:08,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658506210] [2022-12-13 14:45:08,084 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [658506210] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 14:45:08,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1269126958] [2022-12-13 14:45:08,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:45:08,084 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 14:45:08,084 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30b44354-3cd3-449d-bfc4-e017850c821e/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 14:45:08,085 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30b44354-3cd3-449d-bfc4-e017850c821e/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 14:45:08,086 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30b44354-3cd3-449d-bfc4-e017850c821e/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-13 14:45:08,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:08,203 INFO L263 TraceCheckSpWp]: Trace formula consists of 556 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-13 14:45:08,206 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 14:45:08,243 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 138 proven. 11 refuted. 0 times theorem prover too weak. 379 trivial. 0 not checked. [2022-12-13 14:45:08,243 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 14:45:08,335 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 149 proven. 0 refuted. 0 times theorem prover too weak. 379 trivial. 0 not checked. [2022-12-13 14:45:08,335 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1269126958] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-13 14:45:08,335 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-13 14:45:08,335 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 5 [2022-12-13 14:45:08,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111804114] [2022-12-13 14:45:08,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:45:08,336 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 14:45:08,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:45:08,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 14:45:08,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-13 14:45:08,337 INFO L87 Difference]: Start difference. First operand 285 states and 382 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2022-12-13 14:45:08,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:45:08,374 INFO L93 Difference]: Finished difference Result 450 states and 625 transitions. [2022-12-13 14:45:08,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 14:45:08,375 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) Word has length 182 [2022-12-13 14:45:08,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:45:08,376 INFO L225 Difference]: With dead ends: 450 [2022-12-13 14:45:08,376 INFO L226 Difference]: Without dead ends: 264 [2022-12-13 14:45:08,377 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 391 GetRequests, 388 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-12-13 14:45:08,377 INFO L413 NwaCegarLoop]: 253 mSDtfsCounter, 30 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 481 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 14:45:08,377 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 481 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 14:45:08,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2022-12-13 14:45:08,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 264. [2022-12-13 14:45:08,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 215 states have (on average 1.2790697674418605) internal successors, (275), 218 states have internal predecessors, (275), 38 states have call successors, (38), 10 states have call predecessors, (38), 10 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2022-12-13 14:45:08,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 351 transitions. [2022-12-13 14:45:08,386 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 351 transitions. Word has length 182 [2022-12-13 14:45:08,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:45:08,386 INFO L495 AbstractCegarLoop]: Abstraction has 264 states and 351 transitions. [2022-12-13 14:45:08,386 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2022-12-13 14:45:08,386 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 351 transitions. [2022-12-13 14:45:08,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2022-12-13 14:45:08,388 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:45:08,388 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 9, 9, 9, 6, 6, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 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-12-13 14:45:08,393 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30b44354-3cd3-449d-bfc4-e017850c821e/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-12-13 14:45:08,588 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30b44354-3cd3-449d-bfc4-e017850c821e/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 14:45:08,589 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 14:45:08,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:45:08,589 INFO L85 PathProgramCache]: Analyzing trace with hash 687203413, now seen corresponding path program 1 times [2022-12-13 14:45:08,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:45:08,589 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027553234] [2022-12-13 14:45:08,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:45:08,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:45:08,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:08,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 14:45:08,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:08,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 14:45:08,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:08,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-12-13 14:45:08,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:08,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-12-13 14:45:08,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:08,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-12-13 14:45:08,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:08,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 14:45:08,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:08,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-12-13 14:45:08,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:08,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-12-13 14:45:08,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:08,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-12-13 14:45:08,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:08,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-12-13 14:45:08,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:08,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-12-13 14:45:08,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:08,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-12-13 14:45:08,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:08,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-12-13 14:45:08,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:08,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 14:45:08,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:08,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-12-13 14:45:08,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:08,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-12-13 14:45:08,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:08,701 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 552 trivial. 0 not checked. [2022-12-13 14:45:08,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:45:08,702 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027553234] [2022-12-13 14:45:08,702 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2027553234] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:45:08,702 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:45:08,702 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 14:45:08,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202347578] [2022-12-13 14:45:08,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:45:08,703 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 14:45:08,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:45:08,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 14:45:08,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 14:45:08,703 INFO L87 Difference]: Start difference. First operand 264 states and 351 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2022-12-13 14:45:08,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:45:08,733 INFO L93 Difference]: Finished difference Result 407 states and 567 transitions. [2022-12-13 14:45:08,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 14:45:08,734 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 206 [2022-12-13 14:45:08,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:45:08,735 INFO L225 Difference]: With dead ends: 407 [2022-12-13 14:45:08,735 INFO L226 Difference]: Without dead ends: 270 [2022-12-13 14:45:08,736 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 34 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-12-13 14:45:08,736 INFO L413 NwaCegarLoop]: 250 mSDtfsCounter, 6 mSDsluCounter, 493 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 743 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 14:45:08,736 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 743 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 14:45:08,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2022-12-13 14:45:08,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 268. [2022-12-13 14:45:08,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 218 states have (on average 1.275229357798165) internal successors, (278), 221 states have internal predecessors, (278), 38 states have call successors, (38), 11 states have call predecessors, (38), 11 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2022-12-13 14:45:08,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 354 transitions. [2022-12-13 14:45:08,750 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 354 transitions. Word has length 206 [2022-12-13 14:45:08,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:45:08,751 INFO L495 AbstractCegarLoop]: Abstraction has 268 states and 354 transitions. [2022-12-13 14:45:08,751 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2022-12-13 14:45:08,751 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 354 transitions. [2022-12-13 14:45:08,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2022-12-13 14:45:08,754 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:45:08,754 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 9, 9, 9, 6, 6, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-12-13 14:45:08,754 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-12-13 14:45:08,754 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 14:45:08,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:45:08,755 INFO L85 PathProgramCache]: Analyzing trace with hash 209531083, now seen corresponding path program 1 times [2022-12-13 14:45:08,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:45:08,755 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169136283] [2022-12-13 14:45:08,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:45:08,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:45:08,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:08,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 14:45:08,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:08,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 14:45:08,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:08,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-12-13 14:45:08,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:08,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-12-13 14:45:08,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:08,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-12-13 14:45:08,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:08,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 14:45:08,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:08,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-12-13 14:45:08,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:08,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-12-13 14:45:08,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:08,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-12-13 14:45:08,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:08,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-12-13 14:45:08,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:08,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-12-13 14:45:08,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:08,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-12-13 14:45:08,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:08,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-12-13 14:45:08,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:08,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 14:45:08,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:08,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-12-13 14:45:08,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:08,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-12-13 14:45:08,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:08,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2022-12-13 14:45:08,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:08,896 INFO L134 CoverageAnalysis]: Checked inductivity of 554 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 552 trivial. 0 not checked. [2022-12-13 14:45:08,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:45:08,896 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169136283] [2022-12-13 14:45:08,896 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1169136283] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 14:45:08,896 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [566655904] [2022-12-13 14:45:08,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:45:08,896 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 14:45:08,896 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30b44354-3cd3-449d-bfc4-e017850c821e/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 14:45:08,897 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30b44354-3cd3-449d-bfc4-e017850c821e/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 14:45:08,898 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30b44354-3cd3-449d-bfc4-e017850c821e/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-13 14:45:09,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:09,006 INFO L263 TraceCheckSpWp]: Trace formula consists of 692 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-13 14:45:09,011 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 14:45:09,026 INFO L134 CoverageAnalysis]: Checked inductivity of 554 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 552 trivial. 0 not checked. [2022-12-13 14:45:09,026 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 14:45:09,027 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [566655904] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:45:09,027 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 14:45:09,027 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2022-12-13 14:45:09,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249325664] [2022-12-13 14:45:09,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:45:09,028 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 14:45:09,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:45:09,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 14:45:09,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 14:45:09,028 INFO L87 Difference]: Start difference. First operand 268 states and 354 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, (11), 3 states have call predecessors, (11), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2022-12-13 14:45:09,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:45:09,056 INFO L93 Difference]: Finished difference Result 416 states and 574 transitions. [2022-12-13 14:45:09,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 14:45:09,056 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, (11), 3 states have call predecessors, (11), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 213 [2022-12-13 14:45:09,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:45:09,057 INFO L225 Difference]: With dead ends: 416 [2022-12-13 14:45:09,058 INFO L226 Difference]: Without dead ends: 275 [2022-12-13 14:45:09,058 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 248 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 14:45:09,058 INFO L413 NwaCegarLoop]: 252 mSDtfsCounter, 7 mSDsluCounter, 496 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 748 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 14:45:09,058 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 748 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 14:45:09,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2022-12-13 14:45:09,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 273. [2022-12-13 14:45:09,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 222 states have (on average 1.2702702702702702) internal successors, (282), 225 states have internal predecessors, (282), 38 states have call successors, (38), 12 states have call predecessors, (38), 12 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2022-12-13 14:45:09,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 358 transitions. [2022-12-13 14:45:09,078 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 358 transitions. Word has length 213 [2022-12-13 14:45:09,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:45:09,079 INFO L495 AbstractCegarLoop]: Abstraction has 273 states and 358 transitions. [2022-12-13 14:45:09,079 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, (11), 3 states have call predecessors, (11), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2022-12-13 14:45:09,079 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 358 transitions. [2022-12-13 14:45:09,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2022-12-13 14:45:09,082 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:45:09,082 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 9, 9, 9, 6, 6, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 14:45:09,086 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30b44354-3cd3-449d-bfc4-e017850c821e/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-12-13 14:45:09,282 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30b44354-3cd3-449d-bfc4-e017850c821e/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 14:45:09,282 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 14:45:09,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:45:09,283 INFO L85 PathProgramCache]: Analyzing trace with hash 915774272, now seen corresponding path program 1 times [2022-12-13 14:45:09,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:45:09,283 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982910962] [2022-12-13 14:45:09,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:45:09,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:45:09,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:09,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 14:45:09,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:09,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 14:45:09,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:09,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-12-13 14:45:09,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:09,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-12-13 14:45:09,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:09,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-12-13 14:45:09,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:09,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 14:45:09,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:09,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-12-13 14:45:09,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:09,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-12-13 14:45:09,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:09,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-12-13 14:45:09,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:09,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-12-13 14:45:09,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:09,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-12-13 14:45:09,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:09,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-12-13 14:45:09,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:09,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-12-13 14:45:09,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:09,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 14:45:09,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:09,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-12-13 14:45:09,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:09,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-12-13 14:45:09,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:09,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2022-12-13 14:45:09,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:09,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 204 [2022-12-13 14:45:09,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:09,428 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 556 trivial. 0 not checked. [2022-12-13 14:45:09,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:45:09,428 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982910962] [2022-12-13 14:45:09,428 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1982910962] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 14:45:09,428 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [85243560] [2022-12-13 14:45:09,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:45:09,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 14:45:09,429 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30b44354-3cd3-449d-bfc4-e017850c821e/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 14:45:09,430 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30b44354-3cd3-449d-bfc4-e017850c821e/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 14:45:09,430 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30b44354-3cd3-449d-bfc4-e017850c821e/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-13 14:45:09,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:09,570 INFO L263 TraceCheckSpWp]: Trace formula consists of 751 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-13 14:45:09,574 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 14:45:09,586 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 556 trivial. 0 not checked. [2022-12-13 14:45:09,586 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 14:45:09,587 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [85243560] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:45:09,587 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 14:45:09,587 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2022-12-13 14:45:09,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987913414] [2022-12-13 14:45:09,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:45:09,588 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 14:45:09,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:45:09,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 14:45:09,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 14:45:09,589 INFO L87 Difference]: Start difference. First operand 273 states and 358 transitions. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 3 states have internal predecessors, (65), 2 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2022-12-13 14:45:09,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:45:09,616 INFO L93 Difference]: Finished difference Result 418 states and 572 transitions. [2022-12-13 14:45:09,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 14:45:09,617 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 3 states have internal predecessors, (65), 2 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 221 [2022-12-13 14:45:09,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:45:09,618 INFO L225 Difference]: With dead ends: 418 [2022-12-13 14:45:09,618 INFO L226 Difference]: Without dead ends: 272 [2022-12-13 14:45:09,619 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 262 GetRequests, 258 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 14:45:09,619 INFO L413 NwaCegarLoop]: 248 mSDtfsCounter, 7 mSDsluCounter, 486 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 734 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 14:45:09,619 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 734 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 14:45:09,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2022-12-13 14:45:09,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 272. [2022-12-13 14:45:09,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 272 states, 222 states have (on average 1.2567567567567568) internal successors, (279), 224 states have internal predecessors, (279), 37 states have call successors, (37), 12 states have call predecessors, (37), 12 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2022-12-13 14:45:09,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 353 transitions. [2022-12-13 14:45:09,627 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 353 transitions. Word has length 221 [2022-12-13 14:45:09,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:45:09,627 INFO L495 AbstractCegarLoop]: Abstraction has 272 states and 353 transitions. [2022-12-13 14:45:09,628 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 3 states have internal predecessors, (65), 2 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2022-12-13 14:45:09,628 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 353 transitions. [2022-12-13 14:45:09,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2022-12-13 14:45:09,629 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:45:09,629 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 9, 9, 9, 6, 6, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-12-13 14:45:09,634 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30b44354-3cd3-449d-bfc4-e017850c821e/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-12-13 14:45:09,830 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30b44354-3cd3-449d-bfc4-e017850c821e/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 14:45:09,830 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 14:45:09,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:45:09,831 INFO L85 PathProgramCache]: Analyzing trace with hash 568293619, now seen corresponding path program 1 times [2022-12-13 14:45:09,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:45:09,831 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089351795] [2022-12-13 14:45:09,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:45:09,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:45:09,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:09,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 14:45:09,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:09,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 14:45:09,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:09,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-12-13 14:45:09,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:09,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-12-13 14:45:09,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:09,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-12-13 14:45:09,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:09,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 14:45:09,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:09,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-12-13 14:45:09,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:09,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-12-13 14:45:09,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:09,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-12-13 14:45:09,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:09,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-12-13 14:45:09,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:09,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-12-13 14:45:09,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:09,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-12-13 14:45:09,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:09,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-12-13 14:45:09,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:09,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 14:45:09,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:09,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-12-13 14:45:09,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:09,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-12-13 14:45:09,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:09,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2022-12-13 14:45:09,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:09,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 204 [2022-12-13 14:45:09,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:09,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2022-12-13 14:45:09,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:09,983 INFO L134 CoverageAnalysis]: Checked inductivity of 565 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 565 trivial. 0 not checked. [2022-12-13 14:45:09,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:45:09,983 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089351795] [2022-12-13 14:45:09,984 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1089351795] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:45:09,984 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:45:09,984 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 14:45:09,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201471314] [2022-12-13 14:45:09,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:45:09,985 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 14:45:09,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:45:09,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 14:45:09,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 14:45:09,985 INFO L87 Difference]: Start difference. First operand 272 states and 353 transitions. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 3 states have internal predecessors, (68), 2 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2022-12-13 14:45:10,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:45:10,196 INFO L93 Difference]: Finished difference Result 451 states and 620 transitions. [2022-12-13 14:45:10,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 14:45:10,196 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 3 states have internal predecessors, (68), 2 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 228 [2022-12-13 14:45:10,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:45:10,199 INFO L225 Difference]: With dead ends: 451 [2022-12-13 14:45:10,199 INFO L226 Difference]: Without dead ends: 306 [2022-12-13 14:45:10,200 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 14:45:10,200 INFO L413 NwaCegarLoop]: 242 mSDtfsCounter, 177 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 527 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 14:45:10,200 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 527 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-13 14:45:10,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2022-12-13 14:45:10,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 271. [2022-12-13 14:45:10,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 222 states have (on average 1.2522522522522523) internal successors, (278), 223 states have internal predecessors, (278), 36 states have call successors, (36), 12 states have call predecessors, (36), 12 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2022-12-13 14:45:10,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 350 transitions. [2022-12-13 14:45:10,212 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 350 transitions. Word has length 228 [2022-12-13 14:45:10,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:45:10,212 INFO L495 AbstractCegarLoop]: Abstraction has 271 states and 350 transitions. [2022-12-13 14:45:10,212 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 3 states have internal predecessors, (68), 2 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2022-12-13 14:45:10,212 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 350 transitions. [2022-12-13 14:45:10,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2022-12-13 14:45:10,214 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:45:10,214 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 9, 9, 9, 6, 6, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 14:45:10,214 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-12-13 14:45:10,215 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 14:45:10,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:45:10,215 INFO L85 PathProgramCache]: Analyzing trace with hash -1358671604, now seen corresponding path program 1 times [2022-12-13 14:45:10,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:45:10,215 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687856651] [2022-12-13 14:45:10,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:45:10,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:45:10,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:10,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 14:45:10,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:10,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 14:45:10,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:10,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-12-13 14:45:10,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:10,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-12-13 14:45:10,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:10,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-12-13 14:45:10,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:10,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 14:45:10,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:10,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-12-13 14:45:10,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:10,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-12-13 14:45:10,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:10,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-12-13 14:45:10,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:10,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-12-13 14:45:10,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:10,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-12-13 14:45:10,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:10,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-12-13 14:45:10,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:10,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-12-13 14:45:10,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:10,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 14:45:10,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:10,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-12-13 14:45:10,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:10,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-12-13 14:45:10,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:10,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2022-12-13 14:45:10,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:10,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 204 [2022-12-13 14:45:10,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:10,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2022-12-13 14:45:10,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:10,408 INFO L134 CoverageAnalysis]: Checked inductivity of 565 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 565 trivial. 0 not checked. [2022-12-13 14:45:10,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:45:10,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687856651] [2022-12-13 14:45:10,408 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [687856651] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:45:10,408 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:45:10,409 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 14:45:10,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810680056] [2022-12-13 14:45:10,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:45:10,409 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 14:45:10,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:45:10,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 14:45:10,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 14:45:10,410 INFO L87 Difference]: Start difference. First operand 271 states and 350 transitions. Second operand has 5 states, 5 states have (on average 14.2) internal successors, (71), 4 states have internal predecessors, (71), 3 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-12-13 14:45:10,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:45:10,847 INFO L93 Difference]: Finished difference Result 621 states and 830 transitions. [2022-12-13 14:45:10,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 14:45:10,847 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 4 states have internal predecessors, (71), 3 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 231 [2022-12-13 14:45:10,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:45:10,849 INFO L225 Difference]: With dead ends: 621 [2022-12-13 14:45:10,849 INFO L226 Difference]: Without dead ends: 477 [2022-12-13 14:45:10,850 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-12-13 14:45:10,850 INFO L413 NwaCegarLoop]: 236 mSDtfsCounter, 407 mSDsluCounter, 417 mSDsCounter, 0 mSdLazyCounter, 352 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 428 SdHoareTripleChecker+Valid, 653 SdHoareTripleChecker+Invalid, 419 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-13 14:45:10,850 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [428 Valid, 653 Invalid, 419 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 352 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-13 14:45:10,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2022-12-13 14:45:10,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 423. [2022-12-13 14:45:10,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 423 states, 344 states have (on average 1.2994186046511629) internal successors, (447), 346 states have internal predecessors, (447), 54 states have call successors, (54), 24 states have call predecessors, (54), 24 states have return successors, (54), 53 states have call predecessors, (54), 54 states have call successors, (54) [2022-12-13 14:45:10,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 555 transitions. [2022-12-13 14:45:10,868 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 555 transitions. Word has length 231 [2022-12-13 14:45:10,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:45:10,868 INFO L495 AbstractCegarLoop]: Abstraction has 423 states and 555 transitions. [2022-12-13 14:45:10,868 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 4 states have internal predecessors, (71), 3 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-12-13 14:45:10,868 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 555 transitions. [2022-12-13 14:45:10,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2022-12-13 14:45:10,869 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:45:10,869 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 10, 10, 9, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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-12-13 14:45:10,869 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-12-13 14:45:10,870 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 14:45:10,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:45:10,870 INFO L85 PathProgramCache]: Analyzing trace with hash -1534595272, now seen corresponding path program 1 times [2022-12-13 14:45:10,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:45:10,870 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361649102] [2022-12-13 14:45:10,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:45:10,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:45:10,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:10,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 14:45:10,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:10,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 14:45:10,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:10,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-12-13 14:45:10,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:10,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-12-13 14:45:10,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:10,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-12-13 14:45:10,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:10,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 14:45:10,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:10,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-12-13 14:45:10,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:10,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-12-13 14:45:10,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:10,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-12-13 14:45:10,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:10,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-12-13 14:45:10,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:10,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-12-13 14:45:10,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:10,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-12-13 14:45:10,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:10,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-12-13 14:45:10,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:10,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 14:45:10,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:10,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-12-13 14:45:10,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:10,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-12-13 14:45:10,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:10,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2022-12-13 14:45:10,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:10,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 204 [2022-12-13 14:45:10,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:10,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2022-12-13 14:45:10,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:10,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 228 [2022-12-13 14:45:10,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:10,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 236 [2022-12-13 14:45:10,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:10,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 244 [2022-12-13 14:45:10,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:10,987 INFO L134 CoverageAnalysis]: Checked inductivity of 639 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 639 trivial. 0 not checked. [2022-12-13 14:45:10,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:45:10,987 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361649102] [2022-12-13 14:45:10,987 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361649102] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:45:10,987 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:45:10,987 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 14:45:10,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042942082] [2022-12-13 14:45:10,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:45:10,987 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 14:45:10,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:45:10,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 14:45:10,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 14:45:10,988 INFO L87 Difference]: Start difference. First operand 423 states and 555 transitions. Second operand has 4 states, 4 states have (on average 20.0) internal successors, (80), 3 states have internal predecessors, (80), 3 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2022-12-13 14:45:11,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:45:11,311 INFO L93 Difference]: Finished difference Result 893 states and 1225 transitions. [2022-12-13 14:45:11,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 14:45:11,311 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 3 states have internal predecessors, (80), 3 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 258 [2022-12-13 14:45:11,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:45:11,313 INFO L225 Difference]: With dead ends: 893 [2022-12-13 14:45:11,313 INFO L226 Difference]: Without dead ends: 665 [2022-12-13 14:45:11,314 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 46 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-12-13 14:45:11,314 INFO L413 NwaCegarLoop]: 205 mSDtfsCounter, 219 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 240 SdHoareTripleChecker+Valid, 494 SdHoareTripleChecker+Invalid, 265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-13 14:45:11,314 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [240 Valid, 494 Invalid, 265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-13 14:45:11,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 665 states. [2022-12-13 14:45:11,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 665 to 503. [2022-12-13 14:45:11,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 503 states, 414 states have (on average 1.3091787439613527) internal successors, (542), 417 states have internal predecessors, (542), 59 states have call successors, (59), 29 states have call predecessors, (59), 29 states have return successors, (59), 58 states have call predecessors, (59), 59 states have call successors, (59) [2022-12-13 14:45:11,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 503 states to 503 states and 660 transitions. [2022-12-13 14:45:11,341 INFO L78 Accepts]: Start accepts. Automaton has 503 states and 660 transitions. Word has length 258 [2022-12-13 14:45:11,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:45:11,341 INFO L495 AbstractCegarLoop]: Abstraction has 503 states and 660 transitions. [2022-12-13 14:45:11,341 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 3 states have internal predecessors, (80), 3 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2022-12-13 14:45:11,342 INFO L276 IsEmpty]: Start isEmpty. Operand 503 states and 660 transitions. [2022-12-13 14:45:11,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2022-12-13 14:45:11,343 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:45:11,343 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 10, 10, 9, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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-12-13 14:45:11,343 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-12-13 14:45:11,343 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 14:45:11,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:45:11,343 INFO L85 PathProgramCache]: Analyzing trace with hash -141182582, now seen corresponding path program 1 times [2022-12-13 14:45:11,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:45:11,343 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018407663] [2022-12-13 14:45:11,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:45:11,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:45:11,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:11,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 14:45:11,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:11,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 14:45:11,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:11,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-12-13 14:45:11,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:11,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-12-13 14:45:11,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:11,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-12-13 14:45:11,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:11,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 14:45:11,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:11,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-12-13 14:45:11,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:11,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-12-13 14:45:11,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:11,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-12-13 14:45:11,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:11,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-12-13 14:45:11,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:11,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-12-13 14:45:11,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:11,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-12-13 14:45:11,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:11,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-12-13 14:45:11,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:11,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 14:45:11,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:11,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-12-13 14:45:11,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:11,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-12-13 14:45:11,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:11,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2022-12-13 14:45:11,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:11,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 204 [2022-12-13 14:45:11,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:11,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2022-12-13 14:45:11,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:11,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 229 [2022-12-13 14:45:11,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:11,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 237 [2022-12-13 14:45:11,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:11,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 245 [2022-12-13 14:45:11,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:11,445 INFO L134 CoverageAnalysis]: Checked inductivity of 639 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 639 trivial. 0 not checked. [2022-12-13 14:45:11,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:45:11,445 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018407663] [2022-12-13 14:45:11,445 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2018407663] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:45:11,445 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:45:11,445 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 14:45:11,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226837297] [2022-12-13 14:45:11,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:45:11,445 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 14:45:11,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:45:11,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 14:45:11,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 14:45:11,446 INFO L87 Difference]: Start difference. First operand 503 states and 660 transitions. Second operand has 4 states, 4 states have (on average 20.25) internal successors, (81), 3 states have internal predecessors, (81), 3 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2022-12-13 14:45:11,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:45:11,771 INFO L93 Difference]: Finished difference Result 1067 states and 1456 transitions. [2022-12-13 14:45:11,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 14:45:11,772 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 3 states have internal predecessors, (81), 3 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 259 [2022-12-13 14:45:11,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:45:11,776 INFO L225 Difference]: With dead ends: 1067 [2022-12-13 14:45:11,776 INFO L226 Difference]: Without dead ends: 788 [2022-12-13 14:45:11,777 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 46 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-12-13 14:45:11,777 INFO L413 NwaCegarLoop]: 218 mSDtfsCounter, 220 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 241 SdHoareTripleChecker+Valid, 520 SdHoareTripleChecker+Invalid, 266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-13 14:45:11,778 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [241 Valid, 520 Invalid, 266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-13 14:45:11,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 788 states. [2022-12-13 14:45:11,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 788 to 613. [2022-12-13 14:45:11,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 613 states, 512 states have (on average 1.3203125) internal successors, (676), 517 states have internal predecessors, (676), 65 states have call successors, (65), 35 states have call predecessors, (65), 35 states have return successors, (65), 64 states have call predecessors, (65), 65 states have call successors, (65) [2022-12-13 14:45:11,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 613 states to 613 states and 806 transitions. [2022-12-13 14:45:11,810 INFO L78 Accepts]: Start accepts. Automaton has 613 states and 806 transitions. Word has length 259 [2022-12-13 14:45:11,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:45:11,810 INFO L495 AbstractCegarLoop]: Abstraction has 613 states and 806 transitions. [2022-12-13 14:45:11,810 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 3 states have internal predecessors, (81), 3 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2022-12-13 14:45:11,811 INFO L276 IsEmpty]: Start isEmpty. Operand 613 states and 806 transitions. [2022-12-13 14:45:11,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2022-12-13 14:45:11,812 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:45:11,812 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 10, 10, 9, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 14:45:11,812 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-12-13 14:45:11,812 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 14:45:11,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:45:11,812 INFO L85 PathProgramCache]: Analyzing trace with hash -1355646765, now seen corresponding path program 1 times [2022-12-13 14:45:11,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:45:11,812 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27043207] [2022-12-13 14:45:11,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:45:11,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:45:11,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:11,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 14:45:11,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:11,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 14:45:11,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:11,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-12-13 14:45:11,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:11,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-12-13 14:45:11,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:11,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-12-13 14:45:11,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:11,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 14:45:11,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:11,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-12-13 14:45:11,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:11,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-12-13 14:45:11,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:11,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-12-13 14:45:11,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:11,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-12-13 14:45:11,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:11,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-12-13 14:45:11,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:11,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-12-13 14:45:11,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:11,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-12-13 14:45:11,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:11,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 14:45:11,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:11,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-12-13 14:45:11,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:11,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-12-13 14:45:11,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:11,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2022-12-13 14:45:11,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:11,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 204 [2022-12-13 14:45:11,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:11,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2022-12-13 14:45:11,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:11,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 230 [2022-12-13 14:45:11,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:11,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 238 [2022-12-13 14:45:11,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:11,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 246 [2022-12-13 14:45:11,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:11,911 INFO L134 CoverageAnalysis]: Checked inductivity of 639 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 639 trivial. 0 not checked. [2022-12-13 14:45:11,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:45:11,911 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27043207] [2022-12-13 14:45:11,911 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [27043207] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:45:11,911 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:45:11,911 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 14:45:11,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609468806] [2022-12-13 14:45:11,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:45:11,912 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 14:45:11,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:45:11,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 14:45:11,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 14:45:11,912 INFO L87 Difference]: Start difference. First operand 613 states and 806 transitions. Second operand has 4 states, 4 states have (on average 20.5) internal successors, (82), 3 states have internal predecessors, (82), 2 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-12-13 14:45:12,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:45:12,273 INFO L93 Difference]: Finished difference Result 1283 states and 1750 transitions. [2022-12-13 14:45:12,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 14:45:12,274 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 3 states have internal predecessors, (82), 2 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 260 [2022-12-13 14:45:12,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:45:12,277 INFO L225 Difference]: With dead ends: 1283 [2022-12-13 14:45:12,277 INFO L226 Difference]: Without dead ends: 926 [2022-12-13 14:45:12,278 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 46 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-12-13 14:45:12,278 INFO L413 NwaCegarLoop]: 230 mSDtfsCounter, 220 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 241 SdHoareTripleChecker+Valid, 545 SdHoareTripleChecker+Invalid, 267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-13 14:45:12,278 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [241 Valid, 545 Invalid, 267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 228 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-13 14:45:12,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 926 states. [2022-12-13 14:45:12,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 926 to 723. [2022-12-13 14:45:12,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 723 states, 614 states have (on average 1.3355048859934853) internal successors, (820), 623 states have internal predecessors, (820), 69 states have call successors, (69), 39 states have call predecessors, (69), 39 states have return successors, (69), 68 states have call predecessors, (69), 69 states have call successors, (69) [2022-12-13 14:45:12,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 723 states to 723 states and 958 transitions. [2022-12-13 14:45:12,318 INFO L78 Accepts]: Start accepts. Automaton has 723 states and 958 transitions. Word has length 260 [2022-12-13 14:45:12,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:45:12,318 INFO L495 AbstractCegarLoop]: Abstraction has 723 states and 958 transitions. [2022-12-13 14:45:12,318 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 3 states have internal predecessors, (82), 2 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-12-13 14:45:12,318 INFO L276 IsEmpty]: Start isEmpty. Operand 723 states and 958 transitions. [2022-12-13 14:45:12,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2022-12-13 14:45:12,319 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:45:12,319 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 10, 10, 9, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 14:45:12,319 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-12-13 14:45:12,320 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 14:45:12,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:45:12,320 INFO L85 PathProgramCache]: Analyzing trace with hash -1080887151, now seen corresponding path program 1 times [2022-12-13 14:45:12,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:45:12,320 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379725126] [2022-12-13 14:45:12,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:45:12,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:45:12,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:12,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 14:45:12,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:12,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 14:45:12,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:12,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-12-13 14:45:12,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:12,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-12-13 14:45:12,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:12,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-12-13 14:45:12,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:12,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 14:45:12,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:12,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-12-13 14:45:12,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:12,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-12-13 14:45:12,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:12,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-12-13 14:45:12,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:12,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-12-13 14:45:12,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:12,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-12-13 14:45:12,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:12,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-12-13 14:45:12,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:12,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-12-13 14:45:12,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:12,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 14:45:12,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:12,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-12-13 14:45:12,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:12,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-12-13 14:45:12,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:12,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2022-12-13 14:45:12,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:12,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 204 [2022-12-13 14:45:12,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:12,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2022-12-13 14:45:12,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:12,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 230 [2022-12-13 14:45:12,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:12,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 238 [2022-12-13 14:45:12,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:12,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 246 [2022-12-13 14:45:12,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:12,515 INFO L134 CoverageAnalysis]: Checked inductivity of 639 backedges. 30 proven. 6 refuted. 0 times theorem prover too weak. 603 trivial. 0 not checked. [2022-12-13 14:45:12,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:45:12,515 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379725126] [2022-12-13 14:45:12,515 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1379725126] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 14:45:12,515 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1993144979] [2022-12-13 14:45:12,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:45:12,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 14:45:12,516 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30b44354-3cd3-449d-bfc4-e017850c821e/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 14:45:12,517 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30b44354-3cd3-449d-bfc4-e017850c821e/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 14:45:12,518 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30b44354-3cd3-449d-bfc4-e017850c821e/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-13 14:45:12,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:12,677 INFO L263 TraceCheckSpWp]: Trace formula consists of 893 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-13 14:45:12,681 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 14:45:12,708 INFO L134 CoverageAnalysis]: Checked inductivity of 639 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 579 trivial. 0 not checked. [2022-12-13 14:45:12,709 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 14:45:12,709 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1993144979] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:45:12,709 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 14:45:12,709 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 10 [2022-12-13 14:45:12,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823797032] [2022-12-13 14:45:12,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:45:12,710 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 14:45:12,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:45:12,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 14:45:12,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-12-13 14:45:12,711 INFO L87 Difference]: Start difference. First operand 723 states and 958 transitions. Second operand has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-12-13 14:45:12,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:45:12,812 INFO L93 Difference]: Finished difference Result 1194 states and 1622 transitions. [2022-12-13 14:45:12,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 14:45:12,813 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 260 [2022-12-13 14:45:12,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:45:12,816 INFO L225 Difference]: With dead ends: 1194 [2022-12-13 14:45:12,816 INFO L226 Difference]: Without dead ends: 723 [2022-12-13 14:45:12,817 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 312 GetRequests, 303 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-12-13 14:45:12,818 INFO L413 NwaCegarLoop]: 225 mSDtfsCounter, 51 mSDsluCounter, 426 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 651 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 14:45:12,818 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 651 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 14:45:12,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 723 states. [2022-12-13 14:45:12,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 723 to 723. [2022-12-13 14:45:12,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 723 states, 614 states have (on average 1.3257328990228012) internal successors, (814), 623 states have internal predecessors, (814), 69 states have call successors, (69), 39 states have call predecessors, (69), 39 states have return successors, (69), 68 states have call predecessors, (69), 69 states have call successors, (69) [2022-12-13 14:45:12,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 723 states to 723 states and 952 transitions. [2022-12-13 14:45:12,872 INFO L78 Accepts]: Start accepts. Automaton has 723 states and 952 transitions. Word has length 260 [2022-12-13 14:45:12,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:45:12,872 INFO L495 AbstractCegarLoop]: Abstraction has 723 states and 952 transitions. [2022-12-13 14:45:12,872 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-12-13 14:45:12,872 INFO L276 IsEmpty]: Start isEmpty. Operand 723 states and 952 transitions. [2022-12-13 14:45:12,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2022-12-13 14:45:12,873 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:45:12,873 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 10, 10, 9, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-13 14:45:12,879 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30b44354-3cd3-449d-bfc4-e017850c821e/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-12-13 14:45:13,074 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30b44354-3cd3-449d-bfc4-e017850c821e/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-12-13 14:45:13,074 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 14:45:13,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:45:13,075 INFO L85 PathProgramCache]: Analyzing trace with hash 1702413312, now seen corresponding path program 1 times [2022-12-13 14:45:13,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:45:13,075 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604173596] [2022-12-13 14:45:13,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:45:13,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:45:13,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:13,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 14:45:13,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:13,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 14:45:13,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:13,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-12-13 14:45:13,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:13,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-12-13 14:45:13,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:13,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-12-13 14:45:13,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:13,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 14:45:13,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:13,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-12-13 14:45:13,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:13,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-12-13 14:45:13,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:13,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-12-13 14:45:13,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:13,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-12-13 14:45:13,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:13,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-12-13 14:45:13,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:13,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-12-13 14:45:13,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:13,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-12-13 14:45:13,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:13,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 14:45:13,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:13,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-12-13 14:45:13,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:13,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-12-13 14:45:13,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:13,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2022-12-13 14:45:13,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:13,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 204 [2022-12-13 14:45:13,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:13,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2022-12-13 14:45:13,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:13,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 230 [2022-12-13 14:45:13,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:13,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 239 [2022-12-13 14:45:13,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:13,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 247 [2022-12-13 14:45:13,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:13,250 INFO L134 CoverageAnalysis]: Checked inductivity of 639 backedges. 12 proven. 10 refuted. 0 times theorem prover too weak. 617 trivial. 0 not checked. [2022-12-13 14:45:13,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:45:13,250 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604173596] [2022-12-13 14:45:13,250 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [604173596] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 14:45:13,250 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1083636668] [2022-12-13 14:45:13,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:45:13,250 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 14:45:13,251 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30b44354-3cd3-449d-bfc4-e017850c821e/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 14:45:13,251 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30b44354-3cd3-449d-bfc4-e017850c821e/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 14:45:13,252 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30b44354-3cd3-449d-bfc4-e017850c821e/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-13 14:45:13,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:13,378 INFO L263 TraceCheckSpWp]: Trace formula consists of 894 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-13 14:45:13,381 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 14:45:13,410 INFO L134 CoverageAnalysis]: Checked inductivity of 639 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 607 trivial. 0 not checked. [2022-12-13 14:45:13,410 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 14:45:13,410 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1083636668] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:45:13,411 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 14:45:13,411 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 10 [2022-12-13 14:45:13,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38935299] [2022-12-13 14:45:13,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:45:13,411 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 14:45:13,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:45:13,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 14:45:13,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-12-13 14:45:13,412 INFO L87 Difference]: Start difference. First operand 723 states and 952 transitions. Second operand has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-12-13 14:45:13,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:45:13,508 INFO L93 Difference]: Finished difference Result 1194 states and 1608 transitions. [2022-12-13 14:45:13,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 14:45:13,508 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 261 [2022-12-13 14:45:13,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:45:13,512 INFO L225 Difference]: With dead ends: 1194 [2022-12-13 14:45:13,512 INFO L226 Difference]: Without dead ends: 735 [2022-12-13 14:45:13,513 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 313 GetRequests, 304 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-12-13 14:45:13,513 INFO L413 NwaCegarLoop]: 232 mSDtfsCounter, 15 mSDsluCounter, 442 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 674 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 14:45:13,514 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 674 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 14:45:13,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 735 states. [2022-12-13 14:45:13,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 735 to 735. [2022-12-13 14:45:13,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 735 states, 624 states have (on average 1.3269230769230769) internal successors, (828), 633 states have internal predecessors, (828), 69 states have call successors, (69), 41 states have call predecessors, (69), 41 states have return successors, (69), 68 states have call predecessors, (69), 69 states have call successors, (69) [2022-12-13 14:45:13,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 735 states to 735 states and 966 transitions. [2022-12-13 14:45:13,571 INFO L78 Accepts]: Start accepts. Automaton has 735 states and 966 transitions. Word has length 261 [2022-12-13 14:45:13,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:45:13,572 INFO L495 AbstractCegarLoop]: Abstraction has 735 states and 966 transitions. [2022-12-13 14:45:13,572 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-12-13 14:45:13,572 INFO L276 IsEmpty]: Start isEmpty. Operand 735 states and 966 transitions. [2022-12-13 14:45:13,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2022-12-13 14:45:13,574 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:45:13,574 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 10, 10, 9, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-13 14:45:13,579 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30b44354-3cd3-449d-bfc4-e017850c821e/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-12-13 14:45:13,775 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30b44354-3cd3-449d-bfc4-e017850c821e/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-12-13 14:45:13,775 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 14:45:13,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:45:13,775 INFO L85 PathProgramCache]: Analyzing trace with hash -955415893, now seen corresponding path program 1 times [2022-12-13 14:45:13,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:45:13,776 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573704896] [2022-12-13 14:45:13,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:45:13,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:45:13,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:13,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 14:45:13,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:13,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 14:45:13,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:13,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-12-13 14:45:13,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:13,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-12-13 14:45:13,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:13,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-12-13 14:45:13,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:13,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 14:45:13,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:13,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-12-13 14:45:13,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:13,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-12-13 14:45:13,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:13,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-12-13 14:45:13,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:13,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-12-13 14:45:13,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:13,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-12-13 14:45:13,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:13,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-12-13 14:45:13,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:13,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-12-13 14:45:13,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:13,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 14:45:13,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:13,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-12-13 14:45:13,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:13,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-12-13 14:45:13,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:13,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2022-12-13 14:45:13,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:13,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 204 [2022-12-13 14:45:13,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:13,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2022-12-13 14:45:13,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:13,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 230 [2022-12-13 14:45:13,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:13,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 239 [2022-12-13 14:45:13,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:13,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 248 [2022-12-13 14:45:13,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:13,988 INFO L134 CoverageAnalysis]: Checked inductivity of 639 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 639 trivial. 0 not checked. [2022-12-13 14:45:13,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:45:13,988 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573704896] [2022-12-13 14:45:13,988 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1573704896] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:45:13,988 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:45:13,988 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 14:45:13,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345204840] [2022-12-13 14:45:13,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:45:13,989 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 14:45:13,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:45:13,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 14:45:13,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 14:45:13,990 INFO L87 Difference]: Start difference. First operand 735 states and 966 transitions. Second operand has 4 states, 4 states have (on average 21.5) internal successors, (86), 3 states have internal predecessors, (86), 2 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-12-13 14:45:14,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:45:14,198 INFO L93 Difference]: Finished difference Result 1208 states and 1622 transitions. [2022-12-13 14:45:14,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 14:45:14,198 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 3 states have internal predecessors, (86), 2 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 262 [2022-12-13 14:45:14,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:45:14,201 INFO L225 Difference]: With dead ends: 1208 [2022-12-13 14:45:14,202 INFO L226 Difference]: Without dead ends: 715 [2022-12-13 14:45:14,203 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 14:45:14,203 INFO L413 NwaCegarLoop]: 184 mSDtfsCounter, 59 mSDsluCounter, 291 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 475 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 14:45:14,203 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 475 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-13 14:45:14,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 715 states. [2022-12-13 14:45:14,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 715 to 715. [2022-12-13 14:45:14,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 715 states, 605 states have (on average 1.3107438016528925) internal successors, (793), 613 states have internal predecessors, (793), 69 states have call successors, (69), 41 states have call predecessors, (69), 40 states have return successors, (68), 67 states have call predecessors, (68), 68 states have call successors, (68) [2022-12-13 14:45:14,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 715 states to 715 states and 930 transitions. [2022-12-13 14:45:14,256 INFO L78 Accepts]: Start accepts. Automaton has 715 states and 930 transitions. Word has length 262 [2022-12-13 14:45:14,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:45:14,257 INFO L495 AbstractCegarLoop]: Abstraction has 715 states and 930 transitions. [2022-12-13 14:45:14,257 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 3 states have internal predecessors, (86), 2 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-12-13 14:45:14,257 INFO L276 IsEmpty]: Start isEmpty. Operand 715 states and 930 transitions. [2022-12-13 14:45:14,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2022-12-13 14:45:14,259 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:45:14,259 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 10, 10, 9, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-13 14:45:14,259 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-12-13 14:45:14,259 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 14:45:14,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:45:14,259 INFO L85 PathProgramCache]: Analyzing trace with hash 1386884296, now seen corresponding path program 1 times [2022-12-13 14:45:14,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:45:14,260 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159908419] [2022-12-13 14:45:14,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:45:14,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:45:14,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:14,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 14:45:14,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:14,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 14:45:14,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:14,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-12-13 14:45:14,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:14,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-12-13 14:45:14,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:14,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-12-13 14:45:14,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:14,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 14:45:14,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:14,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-12-13 14:45:14,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:14,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-12-13 14:45:14,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:14,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-12-13 14:45:14,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:14,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-12-13 14:45:14,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:14,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-12-13 14:45:14,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:14,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-12-13 14:45:14,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:14,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-12-13 14:45:14,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:14,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 14:45:14,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:14,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-12-13 14:45:14,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:14,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-12-13 14:45:14,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:14,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2022-12-13 14:45:14,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:14,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2022-12-13 14:45:14,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:14,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2022-12-13 14:45:14,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:14,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2022-12-13 14:45:14,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:14,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 240 [2022-12-13 14:45:14,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:14,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 249 [2022-12-13 14:45:14,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:14,543 INFO L134 CoverageAnalysis]: Checked inductivity of 639 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 639 trivial. 0 not checked. [2022-12-13 14:45:14,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:45:14,544 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159908419] [2022-12-13 14:45:14,544 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1159908419] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:45:14,544 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:45:14,544 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 14:45:14,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014132698] [2022-12-13 14:45:14,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:45:14,545 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 14:45:14,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:45:14,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 14:45:14,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-13 14:45:14,545 INFO L87 Difference]: Start difference. First operand 715 states and 930 transitions. Second operand has 7 states, 6 states have (on average 14.5) internal successors, (87), 5 states have internal predecessors, (87), 2 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2022-12-13 14:45:15,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:45:15,000 INFO L93 Difference]: Finished difference Result 1036 states and 1422 transitions. [2022-12-13 14:45:15,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 14:45:15,001 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 14.5) internal successors, (87), 5 states have internal predecessors, (87), 2 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 263 [2022-12-13 14:45:15,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:45:15,005 INFO L225 Difference]: With dead ends: 1036 [2022-12-13 14:45:15,005 INFO L226 Difference]: Without dead ends: 1034 [2022-12-13 14:45:15,005 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-12-13 14:45:15,006 INFO L413 NwaCegarLoop]: 313 mSDtfsCounter, 239 mSDsluCounter, 1174 mSDsCounter, 0 mSdLazyCounter, 523 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 258 SdHoareTripleChecker+Valid, 1487 SdHoareTripleChecker+Invalid, 556 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 523 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-13 14:45:15,006 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [258 Valid, 1487 Invalid, 556 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 523 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-13 14:45:15,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1034 states. [2022-12-13 14:45:15,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1034 to 721. [2022-12-13 14:45:15,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 721 states, 609 states have (on average 1.3087027914614122) internal successors, (797), 618 states have internal predecessors, (797), 70 states have call successors, (70), 42 states have call predecessors, (70), 41 states have return successors, (69), 67 states have call predecessors, (69), 69 states have call successors, (69) [2022-12-13 14:45:15,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 721 states to 721 states and 936 transitions. [2022-12-13 14:45:15,053 INFO L78 Accepts]: Start accepts. Automaton has 721 states and 936 transitions. Word has length 263 [2022-12-13 14:45:15,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:45:15,054 INFO L495 AbstractCegarLoop]: Abstraction has 721 states and 936 transitions. [2022-12-13 14:45:15,054 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 14.5) internal successors, (87), 5 states have internal predecessors, (87), 2 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2022-12-13 14:45:15,054 INFO L276 IsEmpty]: Start isEmpty. Operand 721 states and 936 transitions. [2022-12-13 14:45:15,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2022-12-13 14:45:15,055 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:45:15,055 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 11, 11, 9, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-13 14:45:15,055 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-12-13 14:45:15,056 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 14:45:15,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:45:15,056 INFO L85 PathProgramCache]: Analyzing trace with hash -1763607020, now seen corresponding path program 1 times [2022-12-13 14:45:15,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:45:15,056 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463438816] [2022-12-13 14:45:15,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:45:15,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:45:15,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:15,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 14:45:15,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:15,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 14:45:15,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:15,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-12-13 14:45:15,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:15,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-12-13 14:45:15,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:15,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-12-13 14:45:15,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:15,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 14:45:15,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:15,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-12-13 14:45:15,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:15,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-12-13 14:45:15,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:15,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-12-13 14:45:15,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:15,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-12-13 14:45:15,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:15,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-12-13 14:45:15,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:15,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-12-13 14:45:15,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:15,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-12-13 14:45:15,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:15,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 14:45:15,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:15,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-12-13 14:45:15,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:15,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-12-13 14:45:15,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:15,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2022-12-13 14:45:15,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:15,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2022-12-13 14:45:15,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:15,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2022-12-13 14:45:15,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:15,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2022-12-13 14:45:15,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:15,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 240 [2022-12-13 14:45:15,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:15,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 249 [2022-12-13 14:45:15,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:15,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 257 [2022-12-13 14:45:15,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:15,279 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 142 proven. 27 refuted. 0 times theorem prover too weak. 515 trivial. 0 not checked. [2022-12-13 14:45:15,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:45:15,279 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463438816] [2022-12-13 14:45:15,279 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1463438816] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 14:45:15,279 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1166514210] [2022-12-13 14:45:15,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:45:15,279 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 14:45:15,279 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30b44354-3cd3-449d-bfc4-e017850c821e/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 14:45:15,280 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30b44354-3cd3-449d-bfc4-e017850c821e/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 14:45:15,281 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30b44354-3cd3-449d-bfc4-e017850c821e/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-13 14:45:15,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:15,413 INFO L263 TraceCheckSpWp]: Trace formula consists of 930 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-13 14:45:15,417 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 14:45:15,548 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 251 proven. 33 refuted. 0 times theorem prover too weak. 400 trivial. 0 not checked. [2022-12-13 14:45:15,548 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 14:45:15,798 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 146 proven. 23 refuted. 0 times theorem prover too weak. 515 trivial. 0 not checked. [2022-12-13 14:45:15,798 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1166514210] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 14:45:15,798 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 14:45:15,798 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 19 [2022-12-13 14:45:15,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524364709] [2022-12-13 14:45:15,799 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 14:45:15,799 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-12-13 14:45:15,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:45:15,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-12-13 14:45:15,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2022-12-13 14:45:15,800 INFO L87 Difference]: Start difference. First operand 721 states and 936 transitions. Second operand has 19 states, 19 states have (on average 7.631578947368421) internal successors, (145), 14 states have internal predecessors, (145), 5 states have call successors, (28), 5 states have call predecessors, (28), 9 states have return successors, (27), 8 states have call predecessors, (27), 5 states have call successors, (27) [2022-12-13 14:45:17,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:45:17,653 INFO L93 Difference]: Finished difference Result 2138 states and 2980 transitions. [2022-12-13 14:45:17,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-12-13 14:45:17,654 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 7.631578947368421) internal successors, (145), 14 states have internal predecessors, (145), 5 states have call successors, (28), 5 states have call predecessors, (28), 9 states have return successors, (27), 8 states have call predecessors, (27), 5 states have call successors, (27) Word has length 271 [2022-12-13 14:45:17,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:45:17,659 INFO L225 Difference]: With dead ends: 2138 [2022-12-13 14:45:17,659 INFO L226 Difference]: Without dead ends: 1679 [2022-12-13 14:45:17,661 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 623 GetRequests, 583 SyntacticMatches, 5 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 201 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=211, Invalid=1121, Unknown=0, NotChecked=0, Total=1332 [2022-12-13 14:45:17,661 INFO L413 NwaCegarLoop]: 277 mSDtfsCounter, 517 mSDsluCounter, 2908 mSDsCounter, 0 mSdLazyCounter, 2833 mSolverCounterSat, 140 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 565 SdHoareTripleChecker+Valid, 3185 SdHoareTripleChecker+Invalid, 2973 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 140 IncrementalHoareTripleChecker+Valid, 2833 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-12-13 14:45:17,661 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [565 Valid, 3185 Invalid, 2973 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [140 Valid, 2833 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-12-13 14:45:17,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1679 states. [2022-12-13 14:45:17,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1679 to 989. [2022-12-13 14:45:17,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 989 states, 837 states have (on average 1.2915173237753883) internal successors, (1081), 847 states have internal predecessors, (1081), 94 states have call successors, (94), 55 states have call predecessors, (94), 57 states have return successors, (98), 93 states have call predecessors, (98), 93 states have call successors, (98) [2022-12-13 14:45:17,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 989 states to 989 states and 1273 transitions. [2022-12-13 14:45:17,724 INFO L78 Accepts]: Start accepts. Automaton has 989 states and 1273 transitions. Word has length 271 [2022-12-13 14:45:17,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:45:17,725 INFO L495 AbstractCegarLoop]: Abstraction has 989 states and 1273 transitions. [2022-12-13 14:45:17,725 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 7.631578947368421) internal successors, (145), 14 states have internal predecessors, (145), 5 states have call successors, (28), 5 states have call predecessors, (28), 9 states have return successors, (27), 8 states have call predecessors, (27), 5 states have call successors, (27) [2022-12-13 14:45:17,725 INFO L276 IsEmpty]: Start isEmpty. Operand 989 states and 1273 transitions. [2022-12-13 14:45:17,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2022-12-13 14:45:17,726 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:45:17,726 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 11, 11, 9, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-13 14:45:17,732 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30b44354-3cd3-449d-bfc4-e017850c821e/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-12-13 14:45:17,927 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30b44354-3cd3-449d-bfc4-e017850c821e/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 14:45:17,927 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 14:45:17,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:45:17,928 INFO L85 PathProgramCache]: Analyzing trace with hash -801993003, now seen corresponding path program 1 times [2022-12-13 14:45:17,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:45:17,928 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841910647] [2022-12-13 14:45:17,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:45:17,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:45:17,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:17,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 14:45:17,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:17,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 14:45:17,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:17,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-12-13 14:45:17,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:17,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-12-13 14:45:18,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:18,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-12-13 14:45:18,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:18,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 14:45:18,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:18,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-12-13 14:45:18,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:18,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-12-13 14:45:18,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:18,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-12-13 14:45:18,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:18,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-12-13 14:45:18,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:18,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-12-13 14:45:18,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:18,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-12-13 14:45:18,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:18,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-12-13 14:45:18,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:18,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 14:45:18,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:18,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-12-13 14:45:18,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:18,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-12-13 14:45:18,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:18,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2022-12-13 14:45:18,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:18,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2022-12-13 14:45:18,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:18,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2022-12-13 14:45:18,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:18,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2022-12-13 14:45:18,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:18,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 240 [2022-12-13 14:45:18,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:18,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 249 [2022-12-13 14:45:18,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:18,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 257 [2022-12-13 14:45:18,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:18,067 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 668 trivial. 0 not checked. [2022-12-13 14:45:18,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:45:18,068 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841910647] [2022-12-13 14:45:18,068 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1841910647] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 14:45:18,068 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1742266112] [2022-12-13 14:45:18,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:45:18,068 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 14:45:18,068 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30b44354-3cd3-449d-bfc4-e017850c821e/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 14:45:18,069 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30b44354-3cd3-449d-bfc4-e017850c821e/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 14:45:18,070 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30b44354-3cd3-449d-bfc4-e017850c821e/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-12-13 14:45:18,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:18,214 INFO L263 TraceCheckSpWp]: Trace formula consists of 929 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-13 14:45:18,217 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 14:45:18,228 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 607 trivial. 0 not checked. [2022-12-13 14:45:18,229 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 14:45:18,229 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1742266112] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:45:18,229 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 14:45:18,229 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2022-12-13 14:45:18,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144862686] [2022-12-13 14:45:18,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:45:18,230 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 14:45:18,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:45:18,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 14:45:18,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 14:45:18,231 INFO L87 Difference]: Start difference. First operand 989 states and 1273 transitions. Second operand has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-12-13 14:45:18,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:45:18,328 INFO L93 Difference]: Finished difference Result 1841 states and 2410 transitions. [2022-12-13 14:45:18,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 14:45:18,328 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 271 [2022-12-13 14:45:18,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:45:18,332 INFO L225 Difference]: With dead ends: 1841 [2022-12-13 14:45:18,332 INFO L226 Difference]: Without dead ends: 973 [2022-12-13 14:45:18,334 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 321 GetRequests, 317 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 14:45:18,335 INFO L413 NwaCegarLoop]: 231 mSDtfsCounter, 11 mSDsluCounter, 440 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 671 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 14:45:18,335 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 671 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 14:45:18,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 973 states. [2022-12-13 14:45:18,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 973 to 973. [2022-12-13 14:45:18,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 973 states, 826 states have (on average 1.2796610169491525) internal successors, (1057), 836 states have internal predecessors, (1057), 90 states have call successors, (90), 55 states have call predecessors, (90), 56 states have return successors, (93), 88 states have call predecessors, (93), 89 states have call successors, (93) [2022-12-13 14:45:18,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 973 states to 973 states and 1240 transitions. [2022-12-13 14:45:18,408 INFO L78 Accepts]: Start accepts. Automaton has 973 states and 1240 transitions. Word has length 271 [2022-12-13 14:45:18,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:45:18,408 INFO L495 AbstractCegarLoop]: Abstraction has 973 states and 1240 transitions. [2022-12-13 14:45:18,409 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-12-13 14:45:18,409 INFO L276 IsEmpty]: Start isEmpty. Operand 973 states and 1240 transitions. [2022-12-13 14:45:18,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2022-12-13 14:45:18,410 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:45:18,410 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 11, 11, 9, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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-12-13 14:45:18,415 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30b44354-3cd3-449d-bfc4-e017850c821e/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-12-13 14:45:18,611 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30b44354-3cd3-449d-bfc4-e017850c821e/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 14:45:18,611 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 14:45:18,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:45:18,611 INFO L85 PathProgramCache]: Analyzing trace with hash -1829250860, now seen corresponding path program 1 times [2022-12-13 14:45:18,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:45:18,611 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27957999] [2022-12-13 14:45:18,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:45:18,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:45:18,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:18,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 14:45:18,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:18,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 14:45:18,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:18,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-12-13 14:45:18,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:18,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-12-13 14:45:18,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:18,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-12-13 14:45:18,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:18,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 14:45:18,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:18,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-12-13 14:45:18,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:18,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-12-13 14:45:18,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:18,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-12-13 14:45:18,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:18,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-12-13 14:45:18,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:18,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-12-13 14:45:18,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:18,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-12-13 14:45:18,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:18,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-12-13 14:45:18,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:18,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 14:45:18,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:18,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-12-13 14:45:18,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:18,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-12-13 14:45:18,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:18,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2022-12-13 14:45:18,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:18,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2022-12-13 14:45:18,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:18,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 218 [2022-12-13 14:45:18,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:18,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 234 [2022-12-13 14:45:18,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:18,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 243 [2022-12-13 14:45:18,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:18,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 252 [2022-12-13 14:45:18,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:18,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 260 [2022-12-13 14:45:18,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:18,731 INFO L134 CoverageAnalysis]: Checked inductivity of 690 backedges. 121 proven. 19 refuted. 0 times theorem prover too weak. 550 trivial. 0 not checked. [2022-12-13 14:45:18,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:45:18,732 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27957999] [2022-12-13 14:45:18,732 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [27957999] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 14:45:18,732 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [867864431] [2022-12-13 14:45:18,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:45:18,732 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 14:45:18,732 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30b44354-3cd3-449d-bfc4-e017850c821e/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 14:45:18,733 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30b44354-3cd3-449d-bfc4-e017850c821e/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 14:45:18,734 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30b44354-3cd3-449d-bfc4-e017850c821e/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-12-13 14:45:18,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:18,865 INFO L263 TraceCheckSpWp]: Trace formula consists of 930 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-13 14:45:18,869 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 14:45:18,880 INFO L134 CoverageAnalysis]: Checked inductivity of 690 backedges. 222 proven. 0 refuted. 0 times theorem prover too weak. 468 trivial. 0 not checked. [2022-12-13 14:45:18,880 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 14:45:18,880 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [867864431] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:45:18,880 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 14:45:18,880 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2022-12-13 14:45:18,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009257668] [2022-12-13 14:45:18,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:45:18,881 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 14:45:18,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:45:18,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 14:45:18,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 14:45:18,881 INFO L87 Difference]: Start difference. First operand 973 states and 1240 transitions. Second operand has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 2 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-12-13 14:45:18,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:45:18,961 INFO L93 Difference]: Finished difference Result 1689 states and 2194 transitions. [2022-12-13 14:45:18,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 14:45:18,961 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 2 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 274 [2022-12-13 14:45:18,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:45:18,963 INFO L225 Difference]: With dead ends: 1689 [2022-12-13 14:45:18,963 INFO L226 Difference]: Without dead ends: 828 [2022-12-13 14:45:18,964 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 324 GetRequests, 320 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 14:45:18,965 INFO L413 NwaCegarLoop]: 234 mSDtfsCounter, 8 mSDsluCounter, 440 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 674 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 14:45:18,965 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 674 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 14:45:18,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 828 states. [2022-12-13 14:45:19,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 828 to 828. [2022-12-13 14:45:19,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 828 states, 699 states have (on average 1.2789699570815452) internal successors, (894), 709 states have internal predecessors, (894), 81 states have call successors, (81), 48 states have call predecessors, (81), 47 states have return successors, (80), 77 states have call predecessors, (80), 80 states have call successors, (80) [2022-12-13 14:45:19,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 828 states to 828 states and 1055 transitions. [2022-12-13 14:45:19,009 INFO L78 Accepts]: Start accepts. Automaton has 828 states and 1055 transitions. Word has length 274 [2022-12-13 14:45:19,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:45:19,009 INFO L495 AbstractCegarLoop]: Abstraction has 828 states and 1055 transitions. [2022-12-13 14:45:19,010 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 2 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-12-13 14:45:19,010 INFO L276 IsEmpty]: Start isEmpty. Operand 828 states and 1055 transitions. [2022-12-13 14:45:19,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2022-12-13 14:45:19,011 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:45:19,011 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 10, 10, 9, 8, 8, 8, 7, 6, 6, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-13 14:45:19,017 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30b44354-3cd3-449d-bfc4-e017850c821e/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-12-13 14:45:19,211 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30b44354-3cd3-449d-bfc4-e017850c821e/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 14:45:19,212 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 14:45:19,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:45:19,213 INFO L85 PathProgramCache]: Analyzing trace with hash 211214063, now seen corresponding path program 1 times [2022-12-13 14:45:19,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:45:19,213 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815995258] [2022-12-13 14:45:19,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:45:19,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:45:19,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:19,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 14:45:19,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:19,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 14:45:19,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:19,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-12-13 14:45:19,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:19,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-12-13 14:45:19,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:19,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-12-13 14:45:19,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:19,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 14:45:19,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:19,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-12-13 14:45:19,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:19,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-12-13 14:45:19,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:19,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-12-13 14:45:19,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:19,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-12-13 14:45:19,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:19,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-12-13 14:45:19,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:19,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-12-13 14:45:19,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:19,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-12-13 14:45:19,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:19,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 14:45:19,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:19,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-12-13 14:45:19,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:19,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-12-13 14:45:19,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:19,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2022-12-13 14:45:19,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:19,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2022-12-13 14:45:19,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:19,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2022-12-13 14:45:19,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:19,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2022-12-13 14:45:19,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:19,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 240 [2022-12-13 14:45:19,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:19,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 249 [2022-12-13 14:45:19,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:19,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 257 [2022-12-13 14:45:19,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:19,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 265 [2022-12-13 14:45:19,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:19,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 273 [2022-12-13 14:45:19,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:19,876 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 16 proven. 146 refuted. 0 times theorem prover too weak. 567 trivial. 0 not checked. [2022-12-13 14:45:19,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:45:19,876 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815995258] [2022-12-13 14:45:19,876 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1815995258] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 14:45:19,876 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1434873373] [2022-12-13 14:45:19,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:45:19,876 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 14:45:19,877 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30b44354-3cd3-449d-bfc4-e017850c821e/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 14:45:19,877 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30b44354-3cd3-449d-bfc4-e017850c821e/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 14:45:19,880 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30b44354-3cd3-449d-bfc4-e017850c821e/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-12-13 14:45:20,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:20,035 INFO L263 TraceCheckSpWp]: Trace formula consists of 977 conjuncts, 15 conjunts are in the unsatisfiable core [2022-12-13 14:45:20,038 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 14:45:20,166 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 148 proven. 0 refuted. 0 times theorem prover too weak. 581 trivial. 0 not checked. [2022-12-13 14:45:20,166 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 14:45:20,166 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1434873373] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:45:20,166 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 14:45:20,166 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [15] total 21 [2022-12-13 14:45:20,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208707995] [2022-12-13 14:45:20,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:45:20,167 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 14:45:20,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:45:20,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 14:45:20,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=378, Unknown=0, NotChecked=0, Total=420 [2022-12-13 14:45:20,168 INFO L87 Difference]: Start difference. First operand 828 states and 1055 transitions. Second operand has 8 states, 8 states have (on average 13.125) internal successors, (105), 7 states have internal predecessors, (105), 3 states have call successors, (18), 3 states have call predecessors, (18), 4 states have return successors, (17), 4 states have call predecessors, (17), 3 states have call successors, (17) [2022-12-13 14:45:20,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:45:20,525 INFO L93 Difference]: Finished difference Result 1714 states and 2246 transitions. [2022-12-13 14:45:20,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 14:45:20,525 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.125) internal successors, (105), 7 states have internal predecessors, (105), 3 states have call successors, (18), 3 states have call predecessors, (18), 4 states have return successors, (17), 4 states have call predecessors, (17), 3 states have call successors, (17) Word has length 286 [2022-12-13 14:45:20,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:45:20,529 INFO L225 Difference]: With dead ends: 1714 [2022-12-13 14:45:20,529 INFO L226 Difference]: Without dead ends: 1248 [2022-12-13 14:45:20,530 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 355 GetRequests, 332 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=532, Unknown=0, NotChecked=0, Total=600 [2022-12-13 14:45:20,531 INFO L413 NwaCegarLoop]: 356 mSDtfsCounter, 378 mSDsluCounter, 1543 mSDsCounter, 0 mSdLazyCounter, 358 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 382 SdHoareTripleChecker+Valid, 1899 SdHoareTripleChecker+Invalid, 427 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 358 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 14:45:20,531 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [382 Valid, 1899 Invalid, 427 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 358 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-13 14:45:20,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1248 states. [2022-12-13 14:45:20,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1248 to 990. [2022-12-13 14:45:20,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 990 states, 833 states have (on average 1.2725090036014406) internal successors, (1060), 844 states have internal predecessors, (1060), 99 states have call successors, (99), 58 states have call predecessors, (99), 57 states have return successors, (98), 94 states have call predecessors, (98), 98 states have call successors, (98) [2022-12-13 14:45:20,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 990 states to 990 states and 1257 transitions. [2022-12-13 14:45:20,589 INFO L78 Accepts]: Start accepts. Automaton has 990 states and 1257 transitions. Word has length 286 [2022-12-13 14:45:20,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:45:20,589 INFO L495 AbstractCegarLoop]: Abstraction has 990 states and 1257 transitions. [2022-12-13 14:45:20,589 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.125) internal successors, (105), 7 states have internal predecessors, (105), 3 states have call successors, (18), 3 states have call predecessors, (18), 4 states have return successors, (17), 4 states have call predecessors, (17), 3 states have call successors, (17) [2022-12-13 14:45:20,589 INFO L276 IsEmpty]: Start isEmpty. Operand 990 states and 1257 transitions. [2022-12-13 14:45:20,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2022-12-13 14:45:20,591 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:45:20,591 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 9, 8, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-13 14:45:20,596 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30b44354-3cd3-449d-bfc4-e017850c821e/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2022-12-13 14:45:20,791 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30b44354-3cd3-449d-bfc4-e017850c821e/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 14:45:20,791 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 14:45:20,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:45:20,792 INFO L85 PathProgramCache]: Analyzing trace with hash 1543527212, now seen corresponding path program 1 times [2022-12-13 14:45:20,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:45:20,792 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709046804] [2022-12-13 14:45:20,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:45:20,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:45:20,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:20,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 14:45:20,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:20,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 14:45:20,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:20,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-12-13 14:45:20,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:20,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-12-13 14:45:20,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:20,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-12-13 14:45:20,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:20,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 14:45:20,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:20,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-12-13 14:45:20,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:20,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-12-13 14:45:20,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:20,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-12-13 14:45:20,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:20,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-12-13 14:45:20,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:20,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-12-13 14:45:20,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:20,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-12-13 14:45:20,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:20,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-12-13 14:45:20,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:20,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 14:45:20,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:20,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-12-13 14:45:20,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:20,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-12-13 14:45:20,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:20,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2022-12-13 14:45:20,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:20,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2022-12-13 14:45:20,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:20,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2022-12-13 14:45:20,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:20,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2022-12-13 14:45:20,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:20,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 240 [2022-12-13 14:45:20,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:20,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 250 [2022-12-13 14:45:20,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:20,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 261 [2022-12-13 14:45:20,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:20,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 269 [2022-12-13 14:45:20,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:20,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 277 [2022-12-13 14:45:20,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:20,943 INFO L134 CoverageAnalysis]: Checked inductivity of 770 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 770 trivial. 0 not checked. [2022-12-13 14:45:20,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:45:20,943 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709046804] [2022-12-13 14:45:20,943 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1709046804] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:45:20,943 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:45:20,944 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 14:45:20,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817963214] [2022-12-13 14:45:20,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:45:20,944 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 14:45:20,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:45:20,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 14:45:20,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-13 14:45:20,945 INFO L87 Difference]: Start difference. First operand 990 states and 1257 transitions. Second operand has 7 states, 7 states have (on average 13.714285714285714) internal successors, (96), 6 states have internal predecessors, (96), 5 states have call successors, (18), 3 states have call predecessors, (18), 1 states have return successors, (17), 4 states have call predecessors, (17), 4 states have call successors, (17) [2022-12-13 14:45:21,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:45:21,391 INFO L93 Difference]: Finished difference Result 2828 states and 3907 transitions. [2022-12-13 14:45:21,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 14:45:21,392 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.714285714285714) internal successors, (96), 6 states have internal predecessors, (96), 5 states have call successors, (18), 3 states have call predecessors, (18), 1 states have return successors, (17), 4 states have call predecessors, (17), 4 states have call successors, (17) Word has length 292 [2022-12-13 14:45:21,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:45:21,398 INFO L225 Difference]: With dead ends: 2828 [2022-12-13 14:45:21,398 INFO L226 Difference]: Without dead ends: 2185 [2022-12-13 14:45:21,400 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-13 14:45:21,400 INFO L413 NwaCegarLoop]: 484 mSDtfsCounter, 499 mSDsluCounter, 1145 mSDsCounter, 0 mSdLazyCounter, 451 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 553 SdHoareTripleChecker+Valid, 1629 SdHoareTripleChecker+Invalid, 512 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 451 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-13 14:45:21,400 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [553 Valid, 1629 Invalid, 512 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 451 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-13 14:45:21,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2185 states. [2022-12-13 14:45:21,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2185 to 1045. [2022-12-13 14:45:21,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1045 states, 876 states have (on average 1.2831050228310503) internal successors, (1124), 887 states have internal predecessors, (1124), 111 states have call successors, (111), 58 states have call predecessors, (111), 57 states have return successors, (110), 106 states have call predecessors, (110), 110 states have call successors, (110) [2022-12-13 14:45:21,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1045 states to 1045 states and 1345 transitions. [2022-12-13 14:45:21,482 INFO L78 Accepts]: Start accepts. Automaton has 1045 states and 1345 transitions. Word has length 292 [2022-12-13 14:45:21,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:45:21,482 INFO L495 AbstractCegarLoop]: Abstraction has 1045 states and 1345 transitions. [2022-12-13 14:45:21,482 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.714285714285714) internal successors, (96), 6 states have internal predecessors, (96), 5 states have call successors, (18), 3 states have call predecessors, (18), 1 states have return successors, (17), 4 states have call predecessors, (17), 4 states have call successors, (17) [2022-12-13 14:45:21,482 INFO L276 IsEmpty]: Start isEmpty. Operand 1045 states and 1345 transitions. [2022-12-13 14:45:21,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2022-12-13 14:45:21,484 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:45:21,484 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 9, 8, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-13 14:45:21,484 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-12-13 14:45:21,484 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 14:45:21,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:45:21,484 INFO L85 PathProgramCache]: Analyzing trace with hash -286887768, now seen corresponding path program 1 times [2022-12-13 14:45:21,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:45:21,484 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706081670] [2022-12-13 14:45:21,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:45:21,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:45:21,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:21,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 14:45:21,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:21,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 14:45:21,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:21,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-12-13 14:45:21,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:21,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-12-13 14:45:21,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:21,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-12-13 14:45:21,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:21,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 14:45:21,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:21,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-12-13 14:45:21,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:21,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-12-13 14:45:21,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:21,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-12-13 14:45:21,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:21,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-12-13 14:45:21,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:21,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-12-13 14:45:21,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:21,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-12-13 14:45:21,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:21,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-12-13 14:45:21,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:21,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 14:45:21,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:21,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-12-13 14:45:21,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:21,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-12-13 14:45:21,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:21,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2022-12-13 14:45:21,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:21,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2022-12-13 14:45:21,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:21,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2022-12-13 14:45:21,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:21,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2022-12-13 14:45:21,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:21,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 240 [2022-12-13 14:45:21,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:21,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 250 [2022-12-13 14:45:21,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:21,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 261 [2022-12-13 14:45:21,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:21,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 269 [2022-12-13 14:45:21,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:21,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 277 [2022-12-13 14:45:21,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:21,786 INFO L134 CoverageAnalysis]: Checked inductivity of 770 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2022-12-13 14:45:21,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:45:21,786 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706081670] [2022-12-13 14:45:21,786 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [706081670] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 14:45:21,786 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1486421615] [2022-12-13 14:45:21,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:45:21,786 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 14:45:21,786 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30b44354-3cd3-449d-bfc4-e017850c821e/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 14:45:21,787 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30b44354-3cd3-449d-bfc4-e017850c821e/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 14:45:21,787 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30b44354-3cd3-449d-bfc4-e017850c821e/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-12-13 14:45:21,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:21,930 INFO L263 TraceCheckSpWp]: Trace formula consists of 988 conjuncts, 23 conjunts are in the unsatisfiable core [2022-12-13 14:45:21,933 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 14:45:22,046 INFO L134 CoverageAnalysis]: Checked inductivity of 770 backedges. 189 proven. 0 refuted. 0 times theorem prover too weak. 581 trivial. 0 not checked. [2022-12-13 14:45:22,046 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 14:45:22,046 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1486421615] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:45:22,046 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 14:45:22,046 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [12] total 17 [2022-12-13 14:45:22,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610512004] [2022-12-13 14:45:22,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:45:22,047 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 14:45:22,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:45:22,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 14:45:22,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2022-12-13 14:45:22,048 INFO L87 Difference]: Start difference. First operand 1045 states and 1345 transitions. Second operand has 10 states, 10 states have (on average 11.3) internal successors, (113), 9 states have internal predecessors, (113), 4 states have call successors, (18), 4 states have call predecessors, (18), 5 states have return successors, (17), 5 states have call predecessors, (17), 4 states have call successors, (17) [2022-12-13 14:45:22,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:45:22,915 INFO L93 Difference]: Finished difference Result 2805 states and 3763 transitions. [2022-12-13 14:45:22,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-12-13 14:45:22,916 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 11.3) internal successors, (113), 9 states have internal predecessors, (113), 4 states have call successors, (18), 4 states have call predecessors, (18), 5 states have return successors, (17), 5 states have call predecessors, (17), 4 states have call successors, (17) Word has length 292 [2022-12-13 14:45:22,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:45:22,925 INFO L225 Difference]: With dead ends: 2805 [2022-12-13 14:45:22,925 INFO L226 Difference]: Without dead ends: 2108 [2022-12-13 14:45:22,926 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 370 GetRequests, 338 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 235 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=168, Invalid=954, Unknown=0, NotChecked=0, Total=1122 [2022-12-13 14:45:22,926 INFO L413 NwaCegarLoop]: 435 mSDtfsCounter, 1260 mSDsluCounter, 2461 mSDsCounter, 0 mSdLazyCounter, 1024 mSolverCounterSat, 300 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1274 SdHoareTripleChecker+Valid, 2896 SdHoareTripleChecker+Invalid, 1324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 300 IncrementalHoareTripleChecker+Valid, 1024 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-12-13 14:45:22,927 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1274 Valid, 2896 Invalid, 1324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [300 Valid, 1024 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-12-13 14:45:22,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2108 states. [2022-12-13 14:45:23,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2108 to 1221. [2022-12-13 14:45:23,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1221 states, 1020 states have (on average 1.2754901960784313) internal successors, (1301), 1033 states have internal predecessors, (1301), 133 states have call successors, (133), 68 states have call predecessors, (133), 67 states have return successors, (132), 126 states have call predecessors, (132), 132 states have call successors, (132) [2022-12-13 14:45:23,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1221 states to 1221 states and 1566 transitions. [2022-12-13 14:45:23,018 INFO L78 Accepts]: Start accepts. Automaton has 1221 states and 1566 transitions. Word has length 292 [2022-12-13 14:45:23,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:45:23,019 INFO L495 AbstractCegarLoop]: Abstraction has 1221 states and 1566 transitions. [2022-12-13 14:45:23,019 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.3) internal successors, (113), 9 states have internal predecessors, (113), 4 states have call successors, (18), 4 states have call predecessors, (18), 5 states have return successors, (17), 5 states have call predecessors, (17), 4 states have call successors, (17) [2022-12-13 14:45:23,019 INFO L276 IsEmpty]: Start isEmpty. Operand 1221 states and 1566 transitions. [2022-12-13 14:45:23,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2022-12-13 14:45:23,020 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:45:23,020 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 9, 8, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-13 14:45:23,026 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30b44354-3cd3-449d-bfc4-e017850c821e/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-12-13 14:45:23,221 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30b44354-3cd3-449d-bfc4-e017850c821e/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2022-12-13 14:45:23,221 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 14:45:23,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:45:23,221 INFO L85 PathProgramCache]: Analyzing trace with hash 600167080, now seen corresponding path program 1 times [2022-12-13 14:45:23,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:45:23,221 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556194745] [2022-12-13 14:45:23,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:45:23,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:45:23,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:23,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 14:45:23,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:23,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 14:45:23,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:23,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-12-13 14:45:23,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:23,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-12-13 14:45:23,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:23,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-12-13 14:45:23,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:23,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 14:45:23,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:23,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-12-13 14:45:23,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:23,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-12-13 14:45:23,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:23,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-12-13 14:45:23,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:23,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-12-13 14:45:23,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:23,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-12-13 14:45:23,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:23,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-12-13 14:45:23,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:23,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-12-13 14:45:23,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:23,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 14:45:23,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:23,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-12-13 14:45:23,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:23,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-12-13 14:45:23,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:23,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2022-12-13 14:45:23,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:23,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2022-12-13 14:45:23,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:23,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2022-12-13 14:45:23,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:23,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2022-12-13 14:45:23,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:23,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 240 [2022-12-13 14:45:23,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:23,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 250 [2022-12-13 14:45:23,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:23,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 261 [2022-12-13 14:45:23,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:23,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 269 [2022-12-13 14:45:23,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:23,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 277 [2022-12-13 14:45:23,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:23,517 INFO L134 CoverageAnalysis]: Checked inductivity of 770 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2022-12-13 14:45:23,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:45:23,517 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556194745] [2022-12-13 14:45:23,517 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1556194745] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 14:45:23,517 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1038127939] [2022-12-13 14:45:23,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:45:23,517 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 14:45:23,517 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30b44354-3cd3-449d-bfc4-e017850c821e/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 14:45:23,518 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30b44354-3cd3-449d-bfc4-e017850c821e/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 14:45:23,519 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30b44354-3cd3-449d-bfc4-e017850c821e/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-12-13 14:45:23,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:23,656 INFO L263 TraceCheckSpWp]: Trace formula consists of 988 conjuncts, 15 conjunts are in the unsatisfiable core [2022-12-13 14:45:23,659 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 14:45:23,714 INFO L134 CoverageAnalysis]: Checked inductivity of 770 backedges. 187 proven. 0 refuted. 0 times theorem prover too weak. 583 trivial. 0 not checked. [2022-12-13 14:45:23,714 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 14:45:23,715 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1038127939] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:45:23,715 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 14:45:23,715 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [12] total 15 [2022-12-13 14:45:23,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228408209] [2022-12-13 14:45:23,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:45:23,715 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 14:45:23,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:45:23,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 14:45:23,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2022-12-13 14:45:23,716 INFO L87 Difference]: Start difference. First operand 1221 states and 1566 transitions. Second operand has 8 states, 8 states have (on average 13.875) internal successors, (111), 7 states have internal predecessors, (111), 3 states have call successors, (18), 3 states have call predecessors, (18), 4 states have return successors, (17), 4 states have call predecessors, (17), 3 states have call successors, (17) [2022-12-13 14:45:24,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:45:24,056 INFO L93 Difference]: Finished difference Result 2477 states and 3294 transitions. [2022-12-13 14:45:24,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 14:45:24,056 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.875) internal successors, (111), 7 states have internal predecessors, (111), 3 states have call successors, (18), 3 states have call predecessors, (18), 4 states have return successors, (17), 4 states have call predecessors, (17), 3 states have call successors, (17) Word has length 292 [2022-12-13 14:45:24,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:45:24,060 INFO L225 Difference]: With dead ends: 2477 [2022-12-13 14:45:24,060 INFO L226 Difference]: Without dead ends: 1601 [2022-12-13 14:45:24,061 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 358 GetRequests, 341 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=284, Unknown=0, NotChecked=0, Total=342 [2022-12-13 14:45:24,062 INFO L413 NwaCegarLoop]: 466 mSDtfsCounter, 399 mSDsluCounter, 1734 mSDsCounter, 0 mSdLazyCounter, 546 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 414 SdHoareTripleChecker+Valid, 2200 SdHoareTripleChecker+Invalid, 642 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 546 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 14:45:24,062 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [414 Valid, 2200 Invalid, 642 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 546 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-13 14:45:24,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1601 states. [2022-12-13 14:45:24,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1601 to 1199. [2022-12-13 14:45:24,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1199 states, 1004 states have (on average 1.2709163346613546) internal successors, (1276), 1017 states have internal predecessors, (1276), 127 states have call successors, (127), 68 states have call predecessors, (127), 67 states have return successors, (126), 120 states have call predecessors, (126), 126 states have call successors, (126) [2022-12-13 14:45:24,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1199 states to 1199 states and 1529 transitions. [2022-12-13 14:45:24,168 INFO L78 Accepts]: Start accepts. Automaton has 1199 states and 1529 transitions. Word has length 292 [2022-12-13 14:45:24,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:45:24,169 INFO L495 AbstractCegarLoop]: Abstraction has 1199 states and 1529 transitions. [2022-12-13 14:45:24,169 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.875) internal successors, (111), 7 states have internal predecessors, (111), 3 states have call successors, (18), 3 states have call predecessors, (18), 4 states have return successors, (17), 4 states have call predecessors, (17), 3 states have call successors, (17) [2022-12-13 14:45:24,169 INFO L276 IsEmpty]: Start isEmpty. Operand 1199 states and 1529 transitions. [2022-12-13 14:45:24,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2022-12-13 14:45:24,170 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:45:24,170 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 10, 10, 9, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-13 14:45:24,176 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30b44354-3cd3-449d-bfc4-e017850c821e/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-12-13 14:45:24,371 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30b44354-3cd3-449d-bfc4-e017850c821e/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2022-12-13 14:45:24,371 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 14:45:24,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:45:24,372 INFO L85 PathProgramCache]: Analyzing trace with hash -1957012249, now seen corresponding path program 1 times [2022-12-13 14:45:24,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:45:24,372 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333185981] [2022-12-13 14:45:24,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:45:24,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:45:24,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:24,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 14:45:24,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:24,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 14:45:24,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:24,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-12-13 14:45:24,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:24,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-12-13 14:45:24,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:24,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-12-13 14:45:24,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:24,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 14:45:24,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:24,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-12-13 14:45:24,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:24,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-12-13 14:45:24,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:24,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-12-13 14:45:24,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:24,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-12-13 14:45:24,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:24,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-12-13 14:45:24,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:24,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-12-13 14:45:24,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:24,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-12-13 14:45:24,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:24,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 14:45:24,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:24,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-12-13 14:45:24,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:24,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-12-13 14:45:24,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:24,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2022-12-13 14:45:24,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:24,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2022-12-13 14:45:24,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:24,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2022-12-13 14:45:24,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:24,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2022-12-13 14:45:24,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:24,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 240 [2022-12-13 14:45:24,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:24,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 249 [2022-12-13 14:45:24,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:24,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 259 [2022-12-13 14:45:24,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:24,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 266 [2022-12-13 14:45:24,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:24,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 273 [2022-12-13 14:45:24,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:24,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 281 [2022-12-13 14:45:24,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:24,507 INFO L134 CoverageAnalysis]: Checked inductivity of 706 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 704 trivial. 0 not checked. [2022-12-13 14:45:24,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:45:24,507 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333185981] [2022-12-13 14:45:24,507 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [333185981] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:45:24,507 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:45:24,507 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 14:45:24,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425521350] [2022-12-13 14:45:24,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:45:24,508 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 14:45:24,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:45:24,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 14:45:24,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 14:45:24,508 INFO L87 Difference]: Start difference. First operand 1199 states and 1529 transitions. Second operand has 5 states, 5 states have (on average 19.6) internal successors, (98), 4 states have internal predecessors, (98), 2 states have call successors, (16), 3 states have call predecessors, (16), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2022-12-13 14:45:24,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:45:24,958 INFO L93 Difference]: Finished difference Result 1977 states and 2543 transitions. [2022-12-13 14:45:24,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 14:45:24,959 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.6) internal successors, (98), 4 states have internal predecessors, (98), 2 states have call successors, (16), 3 states have call predecessors, (16), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 300 [2022-12-13 14:45:24,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:45:24,964 INFO L225 Difference]: With dead ends: 1977 [2022-12-13 14:45:24,964 INFO L226 Difference]: Without dead ends: 1135 [2022-12-13 14:45:24,965 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 56 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-12-13 14:45:24,966 INFO L413 NwaCegarLoop]: 284 mSDtfsCounter, 480 mSDsluCounter, 498 mSDsCounter, 0 mSdLazyCounter, 487 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 498 SdHoareTripleChecker+Valid, 782 SdHoareTripleChecker+Invalid, 588 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 487 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-13 14:45:24,966 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [498 Valid, 782 Invalid, 588 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 487 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-13 14:45:24,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1135 states. [2022-12-13 14:45:25,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1135 to 898. [2022-12-13 14:45:25,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 898 states, 767 states have (on average 1.2464146023468057) internal successors, (956), 770 states have internal predecessors, (956), 85 states have call successors, (85), 45 states have call predecessors, (85), 45 states have return successors, (85), 82 states have call predecessors, (85), 85 states have call successors, (85) [2022-12-13 14:45:25,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 898 states to 898 states and 1126 transitions. [2022-12-13 14:45:25,038 INFO L78 Accepts]: Start accepts. Automaton has 898 states and 1126 transitions. Word has length 300 [2022-12-13 14:45:25,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:45:25,038 INFO L495 AbstractCegarLoop]: Abstraction has 898 states and 1126 transitions. [2022-12-13 14:45:25,039 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.6) internal successors, (98), 4 states have internal predecessors, (98), 2 states have call successors, (16), 3 states have call predecessors, (16), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2022-12-13 14:45:25,039 INFO L276 IsEmpty]: Start isEmpty. Operand 898 states and 1126 transitions. [2022-12-13 14:45:25,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 341 [2022-12-13 14:45:25,040 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:45:25,040 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 9, 7, 7, 7, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 14:45:25,040 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-12-13 14:45:25,040 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 14:45:25,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:45:25,041 INFO L85 PathProgramCache]: Analyzing trace with hash 336941807, now seen corresponding path program 1 times [2022-12-13 14:45:25,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:45:25,041 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983671649] [2022-12-13 14:45:25,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:45:25,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:45:25,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:25,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 14:45:25,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:25,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 14:45:25,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:25,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-12-13 14:45:25,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:25,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-12-13 14:45:25,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:25,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-12-13 14:45:25,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:25,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 14:45:25,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:25,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-12-13 14:45:25,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:25,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-12-13 14:45:25,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:25,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-12-13 14:45:25,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:25,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-12-13 14:45:25,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:25,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-12-13 14:45:25,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:25,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-12-13 14:45:25,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:25,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-12-13 14:45:25,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:25,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 14:45:25,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:25,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-12-13 14:45:25,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:25,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-12-13 14:45:25,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:25,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2022-12-13 14:45:25,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:25,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2022-12-13 14:45:25,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:25,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2022-12-13 14:45:25,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:25,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2022-12-13 14:45:25,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:25,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 240 [2022-12-13 14:45:25,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:25,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 249 [2022-12-13 14:45:25,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:25,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 259 [2022-12-13 14:45:25,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:25,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 266 [2022-12-13 14:45:25,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:25,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 276 [2022-12-13 14:45:25,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:25,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 284 [2022-12-13 14:45:25,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:25,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 300 [2022-12-13 14:45:25,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:25,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 309 [2022-12-13 14:45:25,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:25,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 318 [2022-12-13 14:45:25,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:25,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 326 [2022-12-13 14:45:25,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:25,728 INFO L134 CoverageAnalysis]: Checked inductivity of 875 backedges. 16 proven. 26 refuted. 0 times theorem prover too weak. 833 trivial. 0 not checked. [2022-12-13 14:45:25,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:45:25,728 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983671649] [2022-12-13 14:45:25,728 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [983671649] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 14:45:25,728 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1128852956] [2022-12-13 14:45:25,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:45:25,729 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 14:45:25,729 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30b44354-3cd3-449d-bfc4-e017850c821e/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 14:45:25,729 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30b44354-3cd3-449d-bfc4-e017850c821e/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 14:45:25,730 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30b44354-3cd3-449d-bfc4-e017850c821e/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-12-13 14:45:25,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:25,885 INFO L263 TraceCheckSpWp]: Trace formula consists of 1261 conjuncts, 36 conjunts are in the unsatisfiable core [2022-12-13 14:45:25,888 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 14:45:26,192 INFO L134 CoverageAnalysis]: Checked inductivity of 875 backedges. 224 proven. 75 refuted. 0 times theorem prover too weak. 576 trivial. 0 not checked. [2022-12-13 14:45:26,192 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 14:45:26,669 INFO L134 CoverageAnalysis]: Checked inductivity of 875 backedges. 34 proven. 71 refuted. 0 times theorem prover too weak. 770 trivial. 0 not checked. [2022-12-13 14:45:26,670 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1128852956] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 14:45:26,670 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 14:45:26,670 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13, 13] total 34 [2022-12-13 14:45:26,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710418917] [2022-12-13 14:45:26,670 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 14:45:26,672 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-12-13 14:45:26,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:45:26,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-12-13 14:45:26,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=1033, Unknown=0, NotChecked=0, Total=1122 [2022-12-13 14:45:26,674 INFO L87 Difference]: Start difference. First operand 898 states and 1126 transitions. Second operand has 34 states, 34 states have (on average 7.294117647058823) internal successors, (248), 29 states have internal predecessors, (248), 9 states have call successors, (53), 9 states have call predecessors, (53), 14 states have return successors, (53), 13 states have call predecessors, (53), 9 states have call successors, (53) [2022-12-13 14:46:18,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:46:18,938 INFO L93 Difference]: Finished difference Result 15080 states and 20690 transitions. [2022-12-13 14:46:18,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 682 states. [2022-12-13 14:46:18,939 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 7.294117647058823) internal successors, (248), 29 states have internal predecessors, (248), 9 states have call successors, (53), 9 states have call predecessors, (53), 14 states have return successors, (53), 13 states have call predecessors, (53), 9 states have call successors, (53) Word has length 340 [2022-12-13 14:46:18,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:46:18,973 INFO L225 Difference]: With dead ends: 15080 [2022-12-13 14:46:18,973 INFO L226 Difference]: Without dead ends: 14483 [2022-12-13 14:46:19,020 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1450 GetRequests, 738 SyntacticMatches, 1 SemanticMatches, 711 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 228850 ImplicationChecksByTransitivity, 33.6s TimeCoverageRelationStatistics Valid=27145, Invalid=480511, Unknown=0, NotChecked=0, Total=507656 [2022-12-13 14:46:19,020 INFO L413 NwaCegarLoop]: 943 mSDtfsCounter, 8254 mSDsluCounter, 18694 mSDsCounter, 0 mSdLazyCounter, 29382 mSolverCounterSat, 9372 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8254 SdHoareTripleChecker+Valid, 19637 SdHoareTripleChecker+Invalid, 38754 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 9372 IncrementalHoareTripleChecker+Valid, 29382 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.8s IncrementalHoareTripleChecker+Time [2022-12-13 14:46:19,020 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8254 Valid, 19637 Invalid, 38754 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [9372 Valid, 29382 Invalid, 0 Unknown, 0 Unchecked, 15.8s Time] [2022-12-13 14:46:19,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14483 states. [2022-12-13 14:46:19,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14483 to 3550. [2022-12-13 14:46:19,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3550 states, 2872 states have (on average 1.2573119777158774) internal successors, (3611), 2905 states have internal predecessors, (3611), 456 states have call successors, (456), 203 states have call predecessors, (456), 221 states have return successors, (483), 441 states have call predecessors, (483), 456 states have call successors, (483) [2022-12-13 14:46:19,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3550 states to 3550 states and 4550 transitions. [2022-12-13 14:46:19,567 INFO L78 Accepts]: Start accepts. Automaton has 3550 states and 4550 transitions. Word has length 340 [2022-12-13 14:46:19,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:46:19,567 INFO L495 AbstractCegarLoop]: Abstraction has 3550 states and 4550 transitions. [2022-12-13 14:46:19,568 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 7.294117647058823) internal successors, (248), 29 states have internal predecessors, (248), 9 states have call successors, (53), 9 states have call predecessors, (53), 14 states have return successors, (53), 13 states have call predecessors, (53), 9 states have call successors, (53) [2022-12-13 14:46:19,568 INFO L276 IsEmpty]: Start isEmpty. Operand 3550 states and 4550 transitions. [2022-12-13 14:46:19,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 342 [2022-12-13 14:46:19,572 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:46:19,572 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 9, 7, 7, 7, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-12-13 14:46:19,577 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30b44354-3cd3-449d-bfc4-e017850c821e/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-12-13 14:46:19,772 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30b44354-3cd3-449d-bfc4-e017850c821e/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2022-12-13 14:46:19,773 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 14:46:19,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:46:19,774 INFO L85 PathProgramCache]: Analyzing trace with hash 1208992398, now seen corresponding path program 1 times [2022-12-13 14:46:19,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:46:19,775 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279983947] [2022-12-13 14:46:19,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:46:19,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:46:19,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:46:20,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 14:46:20,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:46:20,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 14:46:20,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:46:20,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-12-13 14:46:20,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:46:20,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-12-13 14:46:20,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:46:20,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-12-13 14:46:20,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:46:20,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 14:46:20,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:46:20,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-12-13 14:46:20,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:46:20,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-12-13 14:46:20,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:46:20,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-12-13 14:46:20,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:46:20,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-12-13 14:46:20,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:46:20,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-12-13 14:46:20,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:46:20,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-12-13 14:46:20,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:46:20,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-12-13 14:46:20,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:46:20,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 14:46:20,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:46:20,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-12-13 14:46:20,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:46:20,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-12-13 14:46:20,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:46:20,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2022-12-13 14:46:20,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:46:20,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 204 [2022-12-13 14:46:20,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:46:20,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2022-12-13 14:46:20,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:46:20,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 232 [2022-12-13 14:46:20,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:46:20,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 241 [2022-12-13 14:46:20,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:46:20,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 250 [2022-12-13 14:46:20,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:46:20,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 260 [2022-12-13 14:46:20,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:46:20,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 267 [2022-12-13 14:46:20,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:46:20,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 277 [2022-12-13 14:46:20,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:46:20,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 285 [2022-12-13 14:46:20,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:46:20,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 301 [2022-12-13 14:46:20,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:46:20,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 310 [2022-12-13 14:46:20,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:46:20,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 319 [2022-12-13 14:46:20,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:46:20,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 327 [2022-12-13 14:46:20,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:46:20,795 INFO L134 CoverageAnalysis]: Checked inductivity of 872 backedges. 22 proven. 25 refuted. 0 times theorem prover too weak. 825 trivial. 0 not checked. [2022-12-13 14:46:20,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:46:20,795 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279983947] [2022-12-13 14:46:20,795 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279983947] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 14:46:20,795 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1669930387] [2022-12-13 14:46:20,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:46:20,795 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 14:46:20,795 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30b44354-3cd3-449d-bfc4-e017850c821e/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 14:46:20,796 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30b44354-3cd3-449d-bfc4-e017850c821e/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 14:46:20,797 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30b44354-3cd3-449d-bfc4-e017850c821e/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-12-13 14:46:20,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:46:20,995 INFO L263 TraceCheckSpWp]: Trace formula consists of 1262 conjuncts, 36 conjunts are in the unsatisfiable core [2022-12-13 14:46:21,000 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 14:46:21,330 INFO L134 CoverageAnalysis]: Checked inductivity of 872 backedges. 190 proven. 102 refuted. 0 times theorem prover too weak. 580 trivial. 0 not checked. [2022-12-13 14:46:21,330 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 14:46:21,839 INFO L134 CoverageAnalysis]: Checked inductivity of 872 backedges. 33 proven. 69 refuted. 0 times theorem prover too weak. 770 trivial. 0 not checked. [2022-12-13 14:46:21,839 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1669930387] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 14:46:21,839 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 14:46:21,839 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 13, 13] total 41 [2022-12-13 14:46:21,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535195884] [2022-12-13 14:46:21,839 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 14:46:21,840 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-12-13 14:46:21,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:46:21,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-12-13 14:46:21,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=1537, Unknown=0, NotChecked=0, Total=1640 [2022-12-13 14:46:21,841 INFO L87 Difference]: Start difference. First operand 3550 states and 4550 transitions. Second operand has 41 states, 41 states have (on average 6.073170731707317) internal successors, (249), 35 states have internal predecessors, (249), 10 states have call successors, (54), 9 states have call predecessors, (54), 14 states have return successors, (54), 15 states have call predecessors, (54), 10 states have call successors, (54) [2022-12-13 14:46:43,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:46:43,876 INFO L93 Difference]: Finished difference Result 11327 states and 14716 transitions. [2022-12-13 14:46:43,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 298 states. [2022-12-13 14:46:43,876 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 6.073170731707317) internal successors, (249), 35 states have internal predecessors, (249), 10 states have call successors, (54), 9 states have call predecessors, (54), 14 states have return successors, (54), 15 states have call predecessors, (54), 10 states have call successors, (54) Word has length 341 [2022-12-13 14:46:43,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:46:43,889 INFO L225 Difference]: With dead ends: 11327 [2022-12-13 14:46:43,889 INFO L226 Difference]: Without dead ends: 8263 [2022-12-13 14:46:43,913 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1070 GetRequests, 736 SyntacticMatches, 1 SemanticMatches, 333 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42686 ImplicationChecksByTransitivity, 10.1s TimeCoverageRelationStatistics Valid=6927, Invalid=104963, Unknown=0, NotChecked=0, Total=111890 [2022-12-13 14:46:43,913 INFO L413 NwaCegarLoop]: 986 mSDtfsCounter, 5876 mSDsluCounter, 20591 mSDsCounter, 0 mSdLazyCounter, 24389 mSolverCounterSat, 2943 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5877 SdHoareTripleChecker+Valid, 21577 SdHoareTripleChecker+Invalid, 27332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 2943 IncrementalHoareTripleChecker+Valid, 24389 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.5s IncrementalHoareTripleChecker+Time [2022-12-13 14:46:43,914 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5877 Valid, 21577 Invalid, 27332 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [2943 Valid, 24389 Invalid, 0 Unknown, 0 Unchecked, 10.5s Time] [2022-12-13 14:46:43,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8263 states. [2022-12-13 14:46:44,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8263 to 2862. [2022-12-13 14:46:44,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2862 states, 2359 states have (on average 1.2403560830860534) internal successors, (2926), 2385 states have internal predecessors, (2926), 311 states have call successors, (311), 176 states have call predecessors, (311), 191 states have return successors, (332), 300 states have call predecessors, (332), 311 states have call successors, (332) [2022-12-13 14:46:44,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2862 states to 2862 states and 3569 transitions. [2022-12-13 14:46:44,416 INFO L78 Accepts]: Start accepts. Automaton has 2862 states and 3569 transitions. Word has length 341 [2022-12-13 14:46:44,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:46:44,417 INFO L495 AbstractCegarLoop]: Abstraction has 2862 states and 3569 transitions. [2022-12-13 14:46:44,417 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 6.073170731707317) internal successors, (249), 35 states have internal predecessors, (249), 10 states have call successors, (54), 9 states have call predecessors, (54), 14 states have return successors, (54), 15 states have call predecessors, (54), 10 states have call successors, (54) [2022-12-13 14:46:44,417 INFO L276 IsEmpty]: Start isEmpty. Operand 2862 states and 3569 transitions. [2022-12-13 14:46:44,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 343 [2022-12-13 14:46:44,420 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:46:44,420 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 9, 7, 7, 7, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-12-13 14:46:44,425 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30b44354-3cd3-449d-bfc4-e017850c821e/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2022-12-13 14:46:44,621 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30b44354-3cd3-449d-bfc4-e017850c821e/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2022-12-13 14:46:44,621 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 14:46:44,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:46:44,622 INFO L85 PathProgramCache]: Analyzing trace with hash 6096405, now seen corresponding path program 1 times [2022-12-13 14:46:44,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:46:44,623 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621355013] [2022-12-13 14:46:44,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:46:44,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:46:44,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:46:44,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 14:46:44,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:46:44,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 14:46:44,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:46:44,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-12-13 14:46:44,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:46:44,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-12-13 14:46:44,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:46:44,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-12-13 14:46:44,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:46:44,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 14:46:44,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:46:44,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-12-13 14:46:44,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:46:44,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-12-13 14:46:44,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:46:44,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-12-13 14:46:44,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:46:44,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-12-13 14:46:44,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:46:44,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-12-13 14:46:44,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:46:44,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-12-13 14:46:44,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:46:44,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-12-13 14:46:44,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:46:44,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 14:46:44,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:46:44,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-12-13 14:46:44,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:46:44,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-12-13 14:46:44,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:46:44,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2022-12-13 14:46:44,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:46:44,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 204 [2022-12-13 14:46:44,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:46:44,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2022-12-13 14:46:44,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:46:44,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 233 [2022-12-13 14:46:44,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:46:44,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 242 [2022-12-13 14:46:44,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:46:44,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 251 [2022-12-13 14:46:44,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:46:44,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 261 [2022-12-13 14:46:44,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:46:44,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 268 [2022-12-13 14:46:44,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:46:44,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 278 [2022-12-13 14:46:44,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:46:44,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 286 [2022-12-13 14:46:44,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:46:44,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 302 [2022-12-13 14:46:44,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:46:44,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 311 [2022-12-13 14:46:44,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:46:44,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 320 [2022-12-13 14:46:44,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:46:44,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 328 [2022-12-13 14:46:44,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:46:44,771 INFO L134 CoverageAnalysis]: Checked inductivity of 872 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 828 trivial. 0 not checked. [2022-12-13 14:46:44,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:46:44,771 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621355013] [2022-12-13 14:46:44,771 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1621355013] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:46:44,771 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:46:44,772 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 14:46:44,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810946998] [2022-12-13 14:46:44,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:46:44,772 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 14:46:44,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:46:44,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 14:46:44,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 14:46:44,773 INFO L87 Difference]: Start difference. First operand 2862 states and 3569 transitions. Second operand has 5 states, 5 states have (on average 22.0) internal successors, (110), 4 states have internal predecessors, (110), 2 states have call successors, (18), 3 states have call predecessors, (18), 2 states have return successors, (17), 2 states have call predecessors, (17), 1 states have call successors, (17) [2022-12-13 14:46:45,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:46:45,473 INFO L93 Difference]: Finished difference Result 5813 states and 7243 transitions. [2022-12-13 14:46:45,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 14:46:45,473 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.0) internal successors, (110), 4 states have internal predecessors, (110), 2 states have call successors, (18), 3 states have call predecessors, (18), 2 states have return successors, (17), 2 states have call predecessors, (17), 1 states have call successors, (17) Word has length 342 [2022-12-13 14:46:45,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:46:45,480 INFO L225 Difference]: With dead ends: 5813 [2022-12-13 14:46:45,480 INFO L226 Difference]: Without dead ends: 2820 [2022-12-13 14:46:45,483 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 62 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-12-13 14:46:45,483 INFO L413 NwaCegarLoop]: 172 mSDtfsCounter, 111 mSDsluCounter, 434 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 606 SdHoareTripleChecker+Invalid, 274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 14:46:45,483 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 606 Invalid, 274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-13 14:46:45,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2820 states. [2022-12-13 14:46:45,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2820 to 2820. [2022-12-13 14:46:45,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2820 states, 2332 states have (on average 1.2096912521440824) internal successors, (2821), 2349 states have internal predecessors, (2821), 311 states have call successors, (311), 176 states have call predecessors, (311), 176 states have return successors, (311), 294 states have call predecessors, (311), 311 states have call successors, (311) [2022-12-13 14:46:45,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2820 states to 2820 states and 3443 transitions. [2022-12-13 14:46:45,956 INFO L78 Accepts]: Start accepts. Automaton has 2820 states and 3443 transitions. Word has length 342 [2022-12-13 14:46:45,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:46:45,956 INFO L495 AbstractCegarLoop]: Abstraction has 2820 states and 3443 transitions. [2022-12-13 14:46:45,956 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.0) internal successors, (110), 4 states have internal predecessors, (110), 2 states have call successors, (18), 3 states have call predecessors, (18), 2 states have return successors, (17), 2 states have call predecessors, (17), 1 states have call successors, (17) [2022-12-13 14:46:45,956 INFO L276 IsEmpty]: Start isEmpty. Operand 2820 states and 3443 transitions. [2022-12-13 14:46:45,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2022-12-13 14:46:45,960 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:46:45,960 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 12, 12, 9, 7, 7, 7, 7, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 14:46:45,960 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2022-12-13 14:46:45,960 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 14:46:45,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:46:45,960 INFO L85 PathProgramCache]: Analyzing trace with hash -917418757, now seen corresponding path program 1 times [2022-12-13 14:46:45,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:46:45,960 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352883495] [2022-12-13 14:46:45,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:46:45,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:46:45,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:46:46,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 14:46:46,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:46:46,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 14:46:46,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:46:46,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-12-13 14:46:46,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:46:46,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-12-13 14:46:46,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:46:46,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-12-13 14:46:46,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:46:46,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 14:46:46,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:46:46,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-12-13 14:46:46,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:46:46,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-12-13 14:46:46,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:46:46,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-12-13 14:46:46,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:46:46,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-12-13 14:46:46,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:46:46,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-12-13 14:46:46,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:46:46,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-12-13 14:46:46,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:46:46,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-12-13 14:46:46,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:46:46,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 14:46:46,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:46:46,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-12-13 14:46:46,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:46:46,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-12-13 14:46:46,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:46:46,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2022-12-13 14:46:46,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:46:46,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 204 [2022-12-13 14:46:46,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:46:46,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2022-12-13 14:46:46,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:46:46,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 233 [2022-12-13 14:46:46,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:46:46,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 242 [2022-12-13 14:46:46,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:46:46,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 251 [2022-12-13 14:46:46,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:46:46,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 261 [2022-12-13 14:46:46,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:46:46,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 268 [2022-12-13 14:46:46,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:46:46,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 278 [2022-12-13 14:46:46,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:46:46,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 286 [2022-12-13 14:46:46,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:46:46,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 302 [2022-12-13 14:46:46,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:46:46,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 311 [2022-12-13 14:46:46,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:46:46,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 320 [2022-12-13 14:46:46,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:46:46,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 328 [2022-12-13 14:46:46,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:46:46,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 337 [2022-12-13 14:46:46,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:46:46,380 INFO L134 CoverageAnalysis]: Checked inductivity of 929 backedges. 48 proven. 49 refuted. 0 times theorem prover too weak. 832 trivial. 0 not checked. [2022-12-13 14:46:46,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:46:46,380 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352883495] [2022-12-13 14:46:46,380 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1352883495] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 14:46:46,380 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [727383485] [2022-12-13 14:46:46,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:46:46,380 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 14:46:46,381 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30b44354-3cd3-449d-bfc4-e017850c821e/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 14:46:46,381 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30b44354-3cd3-449d-bfc4-e017850c821e/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 14:46:46,382 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30b44354-3cd3-449d-bfc4-e017850c821e/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-12-13 14:46:46,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:46:46,573 INFO L263 TraceCheckSpWp]: Trace formula consists of 1287 conjuncts, 32 conjunts are in the unsatisfiable core [2022-12-13 14:46:46,578 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 14:46:46,797 INFO L134 CoverageAnalysis]: Checked inductivity of 929 backedges. 258 proven. 89 refuted. 0 times theorem prover too weak. 582 trivial. 0 not checked. [2022-12-13 14:46:46,797 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 14:46:47,203 INFO L134 CoverageAnalysis]: Checked inductivity of 929 backedges. 56 proven. 52 refuted. 0 times theorem prover too weak. 821 trivial. 0 not checked. [2022-12-13 14:46:47,204 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [727383485] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 14:46:47,204 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 14:46:47,204 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 13] total 23 [2022-12-13 14:46:47,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422167621] [2022-12-13 14:46:47,204 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 14:46:47,205 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-12-13 14:46:47,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:46:47,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-12-13 14:46:47,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=435, Unknown=0, NotChecked=0, Total=506 [2022-12-13 14:46:47,206 INFO L87 Difference]: Start difference. First operand 2820 states and 3443 transitions. Second operand has 23 states, 23 states have (on average 8.91304347826087) internal successors, (205), 19 states have internal predecessors, (205), 5 states have call successors, (43), 9 states have call predecessors, (43), 14 states have return successors, (39), 7 states have call predecessors, (39), 4 states have call successors, (39) [2022-12-13 14:46:52,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:46:52,765 INFO L93 Difference]: Finished difference Result 12193 states and 15464 transitions. [2022-12-13 14:46:52,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2022-12-13 14:46:52,766 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 8.91304347826087) internal successors, (205), 19 states have internal predecessors, (205), 5 states have call successors, (43), 9 states have call predecessors, (43), 14 states have return successors, (39), 7 states have call predecessors, (39), 4 states have call successors, (39) Word has length 352 [2022-12-13 14:46:52,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:46:52,782 INFO L225 Difference]: With dead ends: 12193 [2022-12-13 14:46:52,782 INFO L226 Difference]: Without dead ends: 10348 [2022-12-13 14:46:52,785 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 859 GetRequests, 786 SyntacticMatches, 4 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1190 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=801, Invalid=4169, Unknown=0, NotChecked=0, Total=4970 [2022-12-13 14:46:52,786 INFO L413 NwaCegarLoop]: 795 mSDtfsCounter, 1758 mSDsluCounter, 7689 mSDsCounter, 0 mSdLazyCounter, 3791 mSolverCounterSat, 828 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1778 SdHoareTripleChecker+Valid, 8484 SdHoareTripleChecker+Invalid, 4619 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 828 IncrementalHoareTripleChecker+Valid, 3791 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-12-13 14:46:52,786 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1778 Valid, 8484 Invalid, 4619 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [828 Valid, 3791 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-12-13 14:46:52,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10348 states. [2022-12-13 14:46:53,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10348 to 5037. [2022-12-13 14:46:53,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5037 states, 4087 states have (on average 1.2008808416931736) internal successors, (4908), 4125 states have internal predecessors, (4908), 624 states have call successors, (624), 325 states have call predecessors, (624), 325 states have return successors, (624), 586 states have call predecessors, (624), 624 states have call successors, (624) [2022-12-13 14:46:53,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5037 states to 5037 states and 6156 transitions. [2022-12-13 14:46:53,896 INFO L78 Accepts]: Start accepts. Automaton has 5037 states and 6156 transitions. Word has length 352 [2022-12-13 14:46:53,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:46:53,896 INFO L495 AbstractCegarLoop]: Abstraction has 5037 states and 6156 transitions. [2022-12-13 14:46:53,896 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 8.91304347826087) internal successors, (205), 19 states have internal predecessors, (205), 5 states have call successors, (43), 9 states have call predecessors, (43), 14 states have return successors, (39), 7 states have call predecessors, (39), 4 states have call successors, (39) [2022-12-13 14:46:53,896 INFO L276 IsEmpty]: Start isEmpty. Operand 5037 states and 6156 transitions. [2022-12-13 14:46:53,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2022-12-13 14:46:53,903 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:46:53,903 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 12, 12, 9, 7, 7, 7, 7, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 14:46:53,909 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30b44354-3cd3-449d-bfc4-e017850c821e/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2022-12-13 14:46:54,103 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30b44354-3cd3-449d-bfc4-e017850c821e/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 14:46:54,103 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 14:46:54,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:46:54,104 INFO L85 PathProgramCache]: Analyzing trace with hash 1818725745, now seen corresponding path program 1 times [2022-12-13 14:46:54,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:46:54,104 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100744357] [2022-12-13 14:46:54,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:46:54,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:46:54,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:46:54,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 14:46:54,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:46:54,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 14:46:54,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:46:54,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-12-13 14:46:54,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:46:54,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-12-13 14:46:54,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:46:54,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-12-13 14:46:54,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:46:54,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 14:46:54,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:46:54,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-12-13 14:46:54,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:46:54,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-12-13 14:46:54,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:46:54,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-12-13 14:46:54,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:46:54,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-12-13 14:46:54,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:46:54,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-12-13 14:46:54,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:46:54,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-12-13 14:46:54,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:46:54,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-12-13 14:46:54,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:46:54,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 14:46:54,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:46:54,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-12-13 14:46:54,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:46:54,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-12-13 14:46:54,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:46:54,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2022-12-13 14:46:54,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:46:54,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 204 [2022-12-13 14:46:54,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:46:54,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2022-12-13 14:46:54,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:46:54,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 233 [2022-12-13 14:46:54,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:46:54,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 242 [2022-12-13 14:46:54,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:46:54,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 251 [2022-12-13 14:46:54,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:46:54,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 261 [2022-12-13 14:46:54,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:46:54,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 268 [2022-12-13 14:46:54,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:46:54,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 278 [2022-12-13 14:46:54,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:46:54,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 286 [2022-12-13 14:46:54,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:46:54,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 302 [2022-12-13 14:46:54,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:46:54,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 311 [2022-12-13 14:46:54,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:46:54,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 320 [2022-12-13 14:46:54,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:46:54,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 328 [2022-12-13 14:46:54,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:46:54,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 337 [2022-12-13 14:46:54,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:46:54,833 INFO L134 CoverageAnalysis]: Checked inductivity of 929 backedges. 22 proven. 25 refuted. 0 times theorem prover too weak. 882 trivial. 0 not checked. [2022-12-13 14:46:54,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:46:54,833 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100744357] [2022-12-13 14:46:54,833 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [100744357] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 14:46:54,833 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [107300747] [2022-12-13 14:46:54,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:46:54,833 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 14:46:54,833 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30b44354-3cd3-449d-bfc4-e017850c821e/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 14:46:54,834 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30b44354-3cd3-449d-bfc4-e017850c821e/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 14:46:54,835 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30b44354-3cd3-449d-bfc4-e017850c821e/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-12-13 14:46:54,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:46:54,960 INFO L263 TraceCheckSpWp]: Trace formula consists of 1287 conjuncts, 44 conjunts are in the unsatisfiable core [2022-12-13 14:46:54,964 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 14:46:55,382 INFO L134 CoverageAnalysis]: Checked inductivity of 929 backedges. 319 proven. 118 refuted. 0 times theorem prover too weak. 492 trivial. 0 not checked. [2022-12-13 14:46:55,382 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 14:46:55,959 INFO L134 CoverageAnalysis]: Checked inductivity of 929 backedges. 42 proven. 204 refuted. 0 times theorem prover too weak. 683 trivial. 0 not checked. [2022-12-13 14:46:55,959 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [107300747] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 14:46:55,960 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 14:46:55,960 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 15, 19] total 49 [2022-12-13 14:46:55,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31105919] [2022-12-13 14:46:55,960 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 14:46:55,961 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2022-12-13 14:46:55,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:46:55,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2022-12-13 14:46:55,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=2221, Unknown=0, NotChecked=0, Total=2352 [2022-12-13 14:46:55,963 INFO L87 Difference]: Start difference. First operand 5037 states and 6156 transitions. Second operand has 49 states, 48 states have (on average 6.166666666666667) internal successors, (296), 42 states have internal predecessors, (296), 13 states have call successors, (64), 10 states have call predecessors, (64), 12 states have return successors, (65), 17 states have call predecessors, (65), 12 states have call successors, (65) [2022-12-13 14:47:18,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:47:18,806 INFO L93 Difference]: Finished difference Result 27541 states and 37011 transitions. [2022-12-13 14:47:18,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 214 states. [2022-12-13 14:47:18,807 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 48 states have (on average 6.166666666666667) internal successors, (296), 42 states have internal predecessors, (296), 13 states have call successors, (64), 10 states have call predecessors, (64), 12 states have return successors, (65), 17 states have call predecessors, (65), 12 states have call successors, (65) Word has length 352 [2022-12-13 14:47:18,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:47:18,842 INFO L225 Difference]: With dead ends: 27541 [2022-12-13 14:47:18,842 INFO L226 Difference]: Without dead ends: 23223 [2022-12-13 14:47:18,852 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1013 GetRequests, 756 SyntacticMatches, 0 SemanticMatches, 257 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22799 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=4015, Invalid=62807, Unknown=0, NotChecked=0, Total=66822 [2022-12-13 14:47:18,852 INFO L413 NwaCegarLoop]: 643 mSDtfsCounter, 3876 mSDsluCounter, 18223 mSDsCounter, 0 mSdLazyCounter, 21240 mSolverCounterSat, 1697 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3888 SdHoareTripleChecker+Valid, 18866 SdHoareTripleChecker+Invalid, 22937 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1697 IncrementalHoareTripleChecker+Valid, 21240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.8s IncrementalHoareTripleChecker+Time [2022-12-13 14:47:18,852 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3888 Valid, 18866 Invalid, 22937 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1697 Valid, 21240 Invalid, 0 Unknown, 0 Unchecked, 8.8s Time] [2022-12-13 14:47:18,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23223 states. [2022-12-13 14:47:20,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23223 to 5495. [2022-12-13 14:47:20,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5495 states, 4483 states have (on average 1.194735668079411) internal successors, (5356), 4521 states have internal predecessors, (5356), 657 states have call successors, (657), 352 states have call predecessors, (657), 354 states have return successors, (661), 621 states have call predecessors, (661), 657 states have call successors, (661) [2022-12-13 14:47:20,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5495 states to 5495 states and 6674 transitions. [2022-12-13 14:47:20,164 INFO L78 Accepts]: Start accepts. Automaton has 5495 states and 6674 transitions. Word has length 352 [2022-12-13 14:47:20,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:47:20,164 INFO L495 AbstractCegarLoop]: Abstraction has 5495 states and 6674 transitions. [2022-12-13 14:47:20,165 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 48 states have (on average 6.166666666666667) internal successors, (296), 42 states have internal predecessors, (296), 13 states have call successors, (64), 10 states have call predecessors, (64), 12 states have return successors, (65), 17 states have call predecessors, (65), 12 states have call successors, (65) [2022-12-13 14:47:20,165 INFO L276 IsEmpty]: Start isEmpty. Operand 5495 states and 6674 transitions. [2022-12-13 14:47:20,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 356 [2022-12-13 14:47:20,171 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:47:20,171 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 12, 12, 9, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 14:47:20,176 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30b44354-3cd3-449d-bfc4-e017850c821e/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2022-12-13 14:47:20,372 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30b44354-3cd3-449d-bfc4-e017850c821e/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 14:47:20,372 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 14:47:20,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:47:20,372 INFO L85 PathProgramCache]: Analyzing trace with hash -1706367875, now seen corresponding path program 1 times [2022-12-13 14:47:20,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:47:20,372 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665531933] [2022-12-13 14:47:20,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:47:20,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:47:20,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:47:20,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 14:47:20,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:47:20,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 14:47:20,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:47:20,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-12-13 14:47:20,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:47:20,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-12-13 14:47:20,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:47:20,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-12-13 14:47:20,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:47:20,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 14:47:20,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:47:20,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-12-13 14:47:20,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:47:20,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-12-13 14:47:20,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:47:20,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-12-13 14:47:20,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:47:20,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-12-13 14:47:20,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:47:20,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-12-13 14:47:20,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:47:20,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-12-13 14:47:20,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:47:20,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-12-13 14:47:20,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:47:20,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 14:47:20,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:47:20,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-12-13 14:47:20,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:47:20,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-12-13 14:47:20,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:47:20,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2022-12-13 14:47:20,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:47:20,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2022-12-13 14:47:20,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:47:20,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 220 [2022-12-13 14:47:20,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:47:20,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 236 [2022-12-13 14:47:20,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:47:20,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 245 [2022-12-13 14:47:20,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:47:20,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2022-12-13 14:47:20,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:47:20,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 264 [2022-12-13 14:47:20,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:47:20,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 271 [2022-12-13 14:47:20,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:47:20,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 281 [2022-12-13 14:47:20,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:47:20,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 289 [2022-12-13 14:47:20,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:47:20,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 305 [2022-12-13 14:47:20,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:47:20,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 314 [2022-12-13 14:47:20,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:47:20,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 324 [2022-12-13 14:47:20,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:47:20,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 333 [2022-12-13 14:47:20,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:47:20,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 341 [2022-12-13 14:47:20,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:47:20,488 INFO L134 CoverageAnalysis]: Checked inductivity of 944 backedges. 9 proven. 136 refuted. 0 times theorem prover too weak. 799 trivial. 0 not checked. [2022-12-13 14:47:20,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:47:20,489 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665531933] [2022-12-13 14:47:20,489 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [665531933] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 14:47:20,489 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1426937292] [2022-12-13 14:47:20,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:47:20,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 14:47:20,489 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30b44354-3cd3-449d-bfc4-e017850c821e/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 14:47:20,490 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30b44354-3cd3-449d-bfc4-e017850c821e/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 14:47:20,490 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30b44354-3cd3-449d-bfc4-e017850c821e/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-12-13 14:47:20,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:47:20,632 INFO L263 TraceCheckSpWp]: Trace formula consists of 1287 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-13 14:47:20,637 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 14:47:20,651 INFO L134 CoverageAnalysis]: Checked inductivity of 944 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 855 trivial. 0 not checked. [2022-12-13 14:47:20,651 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 14:47:20,651 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1426937292] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:47:20,651 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 14:47:20,651 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2022-12-13 14:47:20,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048837503] [2022-12-13 14:47:20,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:47:20,652 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 14:47:20,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:47:20,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 14:47:20,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 14:47:20,653 INFO L87 Difference]: Start difference. First operand 5495 states and 6674 transitions. Second operand has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2022-12-13 14:47:21,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:47:21,932 INFO L93 Difference]: Finished difference Result 10533 states and 12827 transitions. [2022-12-13 14:47:21,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 14:47:21,932 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 355 [2022-12-13 14:47:21,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:47:21,940 INFO L225 Difference]: With dead ends: 10533 [2022-12-13 14:47:21,940 INFO L226 Difference]: Without dead ends: 5039 [2022-12-13 14:47:21,945 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 421 GetRequests, 417 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 14:47:21,945 INFO L413 NwaCegarLoop]: 225 mSDtfsCounter, 28 mSDsluCounter, 412 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 637 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 14:47:21,945 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 637 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 14:47:21,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5039 states. [2022-12-13 14:47:23,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5039 to 5039. [2022-12-13 14:47:23,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5039 states, 4088 states have (on average 1.1981409001956946) internal successors, (4898), 4126 states have internal predecessors, (4898), 624 states have call successors, (624), 326 states have call predecessors, (624), 326 states have return successors, (624), 586 states have call predecessors, (624), 624 states have call successors, (624) [2022-12-13 14:47:23,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5039 states to 5039 states and 6146 transitions. [2022-12-13 14:47:23,061 INFO L78 Accepts]: Start accepts. Automaton has 5039 states and 6146 transitions. Word has length 355 [2022-12-13 14:47:23,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:47:23,061 INFO L495 AbstractCegarLoop]: Abstraction has 5039 states and 6146 transitions. [2022-12-13 14:47:23,061 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2022-12-13 14:47:23,061 INFO L276 IsEmpty]: Start isEmpty. Operand 5039 states and 6146 transitions. [2022-12-13 14:47:23,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 363 [2022-12-13 14:47:23,067 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:47:23,067 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 12, 12, 9, 8, 7, 7, 7, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-12-13 14:47:23,073 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30b44354-3cd3-449d-bfc4-e017850c821e/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2022-12-13 14:47:23,268 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42,18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30b44354-3cd3-449d-bfc4-e017850c821e/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 14:47:23,268 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 14:47:23,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:47:23,268 INFO L85 PathProgramCache]: Analyzing trace with hash 1005231542, now seen corresponding path program 1 times [2022-12-13 14:47:23,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:47:23,268 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887592894] [2022-12-13 14:47:23,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:47:23,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:47:23,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:47:23,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 14:47:23,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:47:23,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 14:47:23,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:47:23,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-12-13 14:47:23,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:47:23,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-12-13 14:47:23,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:47:23,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-12-13 14:47:23,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:47:23,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 14:47:23,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:47:23,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-12-13 14:47:23,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:47:23,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-12-13 14:47:23,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:47:23,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-12-13 14:47:23,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:47:23,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-12-13 14:47:23,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:47:23,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-12-13 14:47:23,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:47:23,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-12-13 14:47:23,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:47:23,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-12-13 14:47:23,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:47:23,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 14:47:23,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:47:23,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-12-13 14:47:23,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:47:23,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-12-13 14:47:23,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:47:23,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2022-12-13 14:47:23,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:47:23,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 209 [2022-12-13 14:47:23,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:47:23,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 217 [2022-12-13 14:47:23,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:47:23,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 233 [2022-12-13 14:47:23,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:47:23,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 242 [2022-12-13 14:47:23,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:47:23,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 252 [2022-12-13 14:47:23,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:47:23,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 261 [2022-12-13 14:47:23,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:47:23,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 271 [2022-12-13 14:47:23,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:47:23,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 278 [2022-12-13 14:47:23,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:47:23,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 288 [2022-12-13 14:47:23,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:47:23,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 296 [2022-12-13 14:47:23,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:47:23,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 312 [2022-12-13 14:47:23,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:47:23,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 321 [2022-12-13 14:47:23,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:47:23,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 331 [2022-12-13 14:47:23,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:47:23,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 340 [2022-12-13 14:47:23,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:47:23,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 348 [2022-12-13 14:47:23,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:47:23,418 INFO L134 CoverageAnalysis]: Checked inductivity of 999 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 992 trivial. 0 not checked. [2022-12-13 14:47:23,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:47:23,418 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887592894] [2022-12-13 14:47:23,418 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1887592894] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:47:23,418 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:47:23,418 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 14:47:23,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640574410] [2022-12-13 14:47:23,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:47:23,418 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 14:47:23,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:47:23,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 14:47:23,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 14:47:23,419 INFO L87 Difference]: Start difference. First operand 5039 states and 6146 transitions. Second operand has 4 states, 4 states have (on average 26.5) internal successors, (106), 3 states have internal predecessors, (106), 2 states have call successors, (20), 3 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2022-12-13 14:47:24,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:47:24,225 INFO L93 Difference]: Finished difference Result 6723 states and 8219 transitions. [2022-12-13 14:47:24,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 14:47:24,225 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.5) internal successors, (106), 3 states have internal predecessors, (106), 2 states have call successors, (20), 3 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 362 [2022-12-13 14:47:24,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:47:24,231 INFO L225 Difference]: With dead ends: 6723 [2022-12-13 14:47:24,231 INFO L226 Difference]: Without dead ends: 2436 [2022-12-13 14:47:24,235 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 14:47:24,235 INFO L413 NwaCegarLoop]: 177 mSDtfsCounter, 55 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 457 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 14:47:24,236 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 457 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-13 14:47:24,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2436 states. [2022-12-13 14:47:24,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2436 to 2436. [2022-12-13 14:47:24,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2436 states, 1987 states have (on average 1.1816809260191243) internal successors, (2348), 2004 states have internal predecessors, (2348), 291 states have call successors, (291), 157 states have call predecessors, (291), 157 states have return successors, (291), 274 states have call predecessors, (291), 291 states have call successors, (291) [2022-12-13 14:47:24,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2436 states to 2436 states and 2930 transitions. [2022-12-13 14:47:24,754 INFO L78 Accepts]: Start accepts. Automaton has 2436 states and 2930 transitions. Word has length 362 [2022-12-13 14:47:24,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:47:24,755 INFO L495 AbstractCegarLoop]: Abstraction has 2436 states and 2930 transitions. [2022-12-13 14:47:24,755 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.5) internal successors, (106), 3 states have internal predecessors, (106), 2 states have call successors, (20), 3 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2022-12-13 14:47:24,755 INFO L276 IsEmpty]: Start isEmpty. Operand 2436 states and 2930 transitions. [2022-12-13 14:47:24,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 364 [2022-12-13 14:47:24,758 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:47:24,758 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 12, 12, 9, 8, 7, 7, 7, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 14:47:24,758 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2022-12-13 14:47:24,758 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 14:47:24,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:47:24,758 INFO L85 PathProgramCache]: Analyzing trace with hash -294846551, now seen corresponding path program 1 times [2022-12-13 14:47:24,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:47:24,758 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786012679] [2022-12-13 14:47:24,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:47:24,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:47:24,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:47:25,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 14:47:25,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:47:25,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 14:47:25,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:47:25,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-12-13 14:47:25,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:47:25,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-12-13 14:47:25,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:47:25,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-12-13 14:47:25,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:47:25,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 14:47:25,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:47:25,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-12-13 14:47:25,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:47:25,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-12-13 14:47:25,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:47:25,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-12-13 14:47:25,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:47:25,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-12-13 14:47:25,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:47:25,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-12-13 14:47:25,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:47:25,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-12-13 14:47:25,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:47:25,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-12-13 14:47:25,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:47:25,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 14:47:25,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:47:25,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-12-13 14:47:25,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:47:25,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-12-13 14:47:25,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:47:25,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2022-12-13 14:47:25,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:47:25,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 204 [2022-12-13 14:47:25,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:47:25,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 217 [2022-12-13 14:47:25,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:47:25,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 234 [2022-12-13 14:47:25,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:47:25,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 243 [2022-12-13 14:47:25,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:47:25,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 253 [2022-12-13 14:47:25,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:47:25,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 262 [2022-12-13 14:47:25,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:47:25,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 272 [2022-12-13 14:47:25,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:47:25,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 279 [2022-12-13 14:47:25,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:47:25,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 289 [2022-12-13 14:47:25,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:47:25,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 297 [2022-12-13 14:47:25,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:47:25,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 313 [2022-12-13 14:47:25,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:47:25,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 322 [2022-12-13 14:47:25,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:47:25,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 331 [2022-12-13 14:47:25,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:47:25,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 339 [2022-12-13 14:47:25,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:47:25,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 348 [2022-12-13 14:47:25,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:47:25,585 INFO L134 CoverageAnalysis]: Checked inductivity of 993 backedges. 22 proven. 25 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2022-12-13 14:47:25,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:47:25,585 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786012679] [2022-12-13 14:47:25,585 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1786012679] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 14:47:25,585 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [653450407] [2022-12-13 14:47:25,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:47:25,585 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 14:47:25,585 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30b44354-3cd3-449d-bfc4-e017850c821e/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 14:47:25,586 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30b44354-3cd3-449d-bfc4-e017850c821e/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 14:47:25,587 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30b44354-3cd3-449d-bfc4-e017850c821e/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-12-13 14:47:25,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:47:25,723 INFO L263 TraceCheckSpWp]: Trace formula consists of 1313 conjuncts, 66 conjunts are in the unsatisfiable core [2022-12-13 14:47:25,726 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 14:47:27,002 INFO L134 CoverageAnalysis]: Checked inductivity of 993 backedges. 445 proven. 205 refuted. 0 times theorem prover too weak. 343 trivial. 0 not checked. [2022-12-13 14:47:27,003 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 14:47:28,218 INFO L134 CoverageAnalysis]: Checked inductivity of 993 backedges. 101 proven. 189 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2022-12-13 14:47:28,219 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [653450407] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 14:47:28,219 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 14:47:28,219 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 27, 21] total 64 [2022-12-13 14:47:28,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634912860] [2022-12-13 14:47:28,219 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 14:47:28,220 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2022-12-13 14:47:28,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:47:28,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2022-12-13 14:47:28,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=234, Invalid=3798, Unknown=0, NotChecked=0, Total=4032 [2022-12-13 14:47:28,221 INFO L87 Difference]: Start difference. First operand 2436 states and 2930 transitions. Second operand has 64 states, 64 states have (on average 5.765625) internal successors, (369), 55 states have internal predecessors, (369), 19 states have call successors, (67), 13 states have call predecessors, (67), 19 states have return successors, (69), 24 states have call predecessors, (69), 19 states have call successors, (69) [2022-12-13 14:47:45,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:47:45,608 INFO L93 Difference]: Finished difference Result 9294 states and 12083 transitions. [2022-12-13 14:47:45,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 142 states. [2022-12-13 14:47:45,608 INFO L78 Accepts]: Start accepts. Automaton has has 64 states, 64 states have (on average 5.765625) internal successors, (369), 55 states have internal predecessors, (369), 19 states have call successors, (67), 13 states have call predecessors, (67), 19 states have return successors, (69), 24 states have call predecessors, (69), 19 states have call successors, (69) Word has length 363 [2022-12-13 14:47:45,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:47:45,619 INFO L225 Difference]: With dead ends: 9294 [2022-12-13 14:47:45,619 INFO L226 Difference]: Without dead ends: 7373 [2022-12-13 14:47:45,623 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 964 GetRequests, 763 SyntacticMatches, 0 SemanticMatches, 201 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11420 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=2730, Invalid=38276, Unknown=0, NotChecked=0, Total=41006 [2022-12-13 14:47:45,624 INFO L413 NwaCegarLoop]: 649 mSDtfsCounter, 2440 mSDsluCounter, 23828 mSDsCounter, 0 mSdLazyCounter, 24030 mSolverCounterSat, 1207 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2453 SdHoareTripleChecker+Valid, 24477 SdHoareTripleChecker+Invalid, 25237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1207 IncrementalHoareTripleChecker+Valid, 24030 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.7s IncrementalHoareTripleChecker+Time [2022-12-13 14:47:45,624 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2453 Valid, 24477 Invalid, 25237 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1207 Valid, 24030 Invalid, 0 Unknown, 0 Unchecked, 9.7s Time] [2022-12-13 14:47:45,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7373 states. [2022-12-13 14:47:46,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7373 to 2442. [2022-12-13 14:47:46,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2442 states, 1992 states have (on average 1.178714859437751) internal successors, (2348), 2009 states have internal predecessors, (2348), 291 states have call successors, (291), 158 states have call predecessors, (291), 158 states have return successors, (291), 274 states have call predecessors, (291), 291 states have call successors, (291) [2022-12-13 14:47:46,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2442 states to 2442 states and 2930 transitions. [2022-12-13 14:47:46,215 INFO L78 Accepts]: Start accepts. Automaton has 2442 states and 2930 transitions. Word has length 363 [2022-12-13 14:47:46,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:47:46,216 INFO L495 AbstractCegarLoop]: Abstraction has 2442 states and 2930 transitions. [2022-12-13 14:47:46,216 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 64 states, 64 states have (on average 5.765625) internal successors, (369), 55 states have internal predecessors, (369), 19 states have call successors, (67), 13 states have call predecessors, (67), 19 states have return successors, (69), 24 states have call predecessors, (69), 19 states have call successors, (69) [2022-12-13 14:47:46,216 INFO L276 IsEmpty]: Start isEmpty. Operand 2442 states and 2930 transitions. [2022-12-13 14:47:46,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 375 [2022-12-13 14:47:46,219 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:47:46,219 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 12, 12, 9, 9, 7, 7, 7, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-12-13 14:47:46,224 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30b44354-3cd3-449d-bfc4-e017850c821e/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2022-12-13 14:47:46,420 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30b44354-3cd3-449d-bfc4-e017850c821e/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable44 [2022-12-13 14:47:46,420 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 14:47:46,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:47:46,421 INFO L85 PathProgramCache]: Analyzing trace with hash 325853320, now seen corresponding path program 1 times [2022-12-13 14:47:46,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:47:46,421 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710243465] [2022-12-13 14:47:46,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:47:46,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:47:46,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:47:46,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 14:47:46,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:47:46,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 14:47:46,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:47:46,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-12-13 14:47:46,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:47:46,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-12-13 14:47:46,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:47:46,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-12-13 14:47:46,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:47:46,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 14:47:46,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:47:46,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-12-13 14:47:46,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:47:46,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-12-13 14:47:46,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:47:46,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-12-13 14:47:46,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:47:46,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-12-13 14:47:46,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:47:46,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-12-13 14:47:46,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:47:46,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-12-13 14:47:46,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:47:46,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-12-13 14:47:46,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:47:46,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 14:47:46,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:47:46,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-12-13 14:47:46,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:47:46,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-12-13 14:47:46,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:47:46,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2022-12-13 14:47:46,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:47:46,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 204 [2022-12-13 14:47:46,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:47:46,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 217 [2022-12-13 14:47:46,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:47:46,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 234 [2022-12-13 14:47:46,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:47:46,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 243 [2022-12-13 14:47:46,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:47:46,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 253 [2022-12-13 14:47:46,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:47:46,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 264 [2022-12-13 14:47:46,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:47:46,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 273 [2022-12-13 14:47:46,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:47:46,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 283 [2022-12-13 14:47:46,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:47:46,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 290 [2022-12-13 14:47:46,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:47:46,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 300 [2022-12-13 14:47:46,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:47:46,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 308 [2022-12-13 14:47:46,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:47:46,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 324 [2022-12-13 14:47:46,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:47:46,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 333 [2022-12-13 14:47:46,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:47:46,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 342 [2022-12-13 14:47:46,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:47:46,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 350 [2022-12-13 14:47:46,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:47:46,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 359 [2022-12-13 14:47:46,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:47:46,584 INFO L134 CoverageAnalysis]: Checked inductivity of 1063 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1055 trivial. 0 not checked. [2022-12-13 14:47:46,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:47:46,584 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710243465] [2022-12-13 14:47:46,584 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1710243465] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:47:46,584 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:47:46,584 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 14:47:46,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066198561] [2022-12-13 14:47:46,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:47:46,585 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 14:47:46,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:47:46,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 14:47:46,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 14:47:46,586 INFO L87 Difference]: Start difference. First operand 2442 states and 2930 transitions. Second operand has 4 states, 4 states have (on average 29.5) internal successors, (118), 3 states have internal predecessors, (118), 2 states have call successors, (23), 3 states have call predecessors, (23), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2022-12-13 14:47:47,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:47:47,357 INFO L93 Difference]: Finished difference Result 4359 states and 5266 transitions. [2022-12-13 14:47:47,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 14:47:47,358 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 29.5) internal successors, (118), 3 states have internal predecessors, (118), 2 states have call successors, (23), 3 states have call predecessors, (23), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 374 [2022-12-13 14:47:47,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:47:47,362 INFO L225 Difference]: With dead ends: 4359 [2022-12-13 14:47:47,362 INFO L226 Difference]: Without dead ends: 2350 [2022-12-13 14:47:47,365 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 14:47:47,365 INFO L413 NwaCegarLoop]: 176 mSDtfsCounter, 55 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 454 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 14:47:47,365 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 454 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 14:47:47,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2350 states. [2022-12-13 14:47:47,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2350 to 2350. [2022-12-13 14:47:47,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2350 states, 1916 states have (on average 1.1764091858037578) internal successors, (2254), 1932 states have internal predecessors, (2254), 281 states have call successors, (281), 152 states have call predecessors, (281), 152 states have return successors, (281), 265 states have call predecessors, (281), 281 states have call successors, (281) [2022-12-13 14:47:47,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2350 states to 2350 states and 2816 transitions. [2022-12-13 14:47:47,927 INFO L78 Accepts]: Start accepts. Automaton has 2350 states and 2816 transitions. Word has length 374 [2022-12-13 14:47:47,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:47:47,927 INFO L495 AbstractCegarLoop]: Abstraction has 2350 states and 2816 transitions. [2022-12-13 14:47:47,927 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.5) internal successors, (118), 3 states have internal predecessors, (118), 2 states have call successors, (23), 3 states have call predecessors, (23), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2022-12-13 14:47:47,927 INFO L276 IsEmpty]: Start isEmpty. Operand 2350 states and 2816 transitions. [2022-12-13 14:47:47,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 380 [2022-12-13 14:47:47,930 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:47:47,931 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 12, 12, 10, 10, 10, 9, 8, 8, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-12-13 14:47:47,931 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2022-12-13 14:47:47,931 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 14:47:47,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:47:47,931 INFO L85 PathProgramCache]: Analyzing trace with hash -1942345502, now seen corresponding path program 1 times [2022-12-13 14:47:47,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:47:47,931 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236926854] [2022-12-13 14:47:47,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:47:47,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:47:47,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:47:48,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 14:47:48,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:47:48,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 14:47:48,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:47:48,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-12-13 14:47:48,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:47:48,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-12-13 14:47:48,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:47:48,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-12-13 14:47:48,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:47:48,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 14:47:48,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:47:48,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-12-13 14:47:48,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:47:48,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-12-13 14:47:48,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:47:48,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-12-13 14:47:48,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:47:48,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-12-13 14:47:48,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:47:48,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-12-13 14:47:48,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:47:48,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-12-13 14:47:48,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:47:48,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-12-13 14:47:48,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:47:48,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 14:47:48,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:47:48,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-12-13 14:47:48,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:47:48,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-12-13 14:47:48,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:47:48,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2022-12-13 14:47:48,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:47:48,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 204 [2022-12-13 14:47:48,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:47:48,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2022-12-13 14:47:48,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:47:48,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 232 [2022-12-13 14:47:48,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:47:48,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 241 [2022-12-13 14:47:48,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:47:48,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 251 [2022-12-13 14:47:48,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:47:48,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 262 [2022-12-13 14:47:48,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:47:48,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 271 [2022-12-13 14:47:48,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:47:48,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 281 [2022-12-13 14:47:48,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:47:48,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 288 [2022-12-13 14:47:48,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:47:48,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 298 [2022-12-13 14:47:48,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:47:48,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 306 [2022-12-13 14:47:48,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:47:48,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 324 [2022-12-13 14:47:48,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:47:48,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 333 [2022-12-13 14:47:48,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:47:48,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 342 [2022-12-13 14:47:48,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:47:48,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 350 [2022-12-13 14:47:48,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:47:48,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 358 [2022-12-13 14:47:48,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:47:48,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 366 [2022-12-13 14:47:48,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:47:48,108 INFO L134 CoverageAnalysis]: Checked inductivity of 1058 backedges. 35 proven. 2 refuted. 0 times theorem prover too weak. 1021 trivial. 0 not checked. [2022-12-13 14:47:48,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:47:48,108 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236926854] [2022-12-13 14:47:48,108 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [236926854] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 14:47:48,109 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1711656896] [2022-12-13 14:47:48,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:47:48,109 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 14:47:48,109 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30b44354-3cd3-449d-bfc4-e017850c821e/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 14:47:48,110 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30b44354-3cd3-449d-bfc4-e017850c821e/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 14:47:48,111 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30b44354-3cd3-449d-bfc4-e017850c821e/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-12-13 14:47:48,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:47:48,258 INFO L263 TraceCheckSpWp]: Trace formula consists of 1363 conjuncts, 12 conjunts are in the unsatisfiable core [2022-12-13 14:47:48,264 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 14:47:48,573 INFO L134 CoverageAnalysis]: Checked inductivity of 1058 backedges. 127 proven. 305 refuted. 0 times theorem prover too weak. 626 trivial. 0 not checked. [2022-12-13 14:47:48,573 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 14:47:48,804 INFO L134 CoverageAnalysis]: Checked inductivity of 1058 backedges. 17 proven. 31 refuted. 0 times theorem prover too weak. 1010 trivial. 0 not checked. [2022-12-13 14:47:48,804 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1711656896] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 14:47:48,805 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 14:47:48,805 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 12] total 20 [2022-12-13 14:47:48,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526391912] [2022-12-13 14:47:48,805 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 14:47:48,805 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-13 14:47:48,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:47:48,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-13 14:47:48,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=341, Unknown=0, NotChecked=0, Total=380 [2022-12-13 14:47:48,806 INFO L87 Difference]: Start difference. First operand 2350 states and 2816 transitions. Second operand has 20 states, 20 states have (on average 14.5) internal successors, (290), 17 states have internal predecessors, (290), 7 states have call successors, (71), 7 states have call predecessors, (71), 9 states have return successors, (70), 9 states have call predecessors, (70), 7 states have call successors, (70) [2022-12-13 14:47:55,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:47:55,053 INFO L93 Difference]: Finished difference Result 10257 states and 13098 transitions. [2022-12-13 14:47:55,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2022-12-13 14:47:55,053 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 14.5) internal successors, (290), 17 states have internal predecessors, (290), 7 states have call successors, (71), 7 states have call predecessors, (71), 9 states have return successors, (70), 9 states have call predecessors, (70), 7 states have call successors, (70) Word has length 379 [2022-12-13 14:47:55,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:47:55,064 INFO L225 Difference]: With dead ends: 10257 [2022-12-13 14:47:55,064 INFO L226 Difference]: Without dead ends: 8576 [2022-12-13 14:47:55,067 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 973 GetRequests, 845 SyntacticMatches, 9 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4985 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1415, Invalid=13105, Unknown=0, NotChecked=0, Total=14520 [2022-12-13 14:47:55,067 INFO L413 NwaCegarLoop]: 494 mSDtfsCounter, 2649 mSDsluCounter, 5517 mSDsCounter, 0 mSdLazyCounter, 5827 mSolverCounterSat, 1056 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2659 SdHoareTripleChecker+Valid, 6011 SdHoareTripleChecker+Invalid, 6883 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1056 IncrementalHoareTripleChecker+Valid, 5827 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-12-13 14:47:55,067 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2659 Valid, 6011 Invalid, 6883 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1056 Valid, 5827 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-12-13 14:47:55,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8576 states. [2022-12-13 14:47:56,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8576 to 3984. [2022-12-13 14:47:56,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3984 states, 3244 states have (on average 1.1790998766954377) internal successors, (3825), 3272 states have internal predecessors, (3825), 485 states have call successors, (485), 254 states have call predecessors, (485), 254 states have return successors, (485), 457 states have call predecessors, (485), 485 states have call successors, (485) [2022-12-13 14:47:56,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3984 states to 3984 states and 4795 transitions. [2022-12-13 14:47:56,115 INFO L78 Accepts]: Start accepts. Automaton has 3984 states and 4795 transitions. Word has length 379 [2022-12-13 14:47:56,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:47:56,116 INFO L495 AbstractCegarLoop]: Abstraction has 3984 states and 4795 transitions. [2022-12-13 14:47:56,116 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 14.5) internal successors, (290), 17 states have internal predecessors, (290), 7 states have call successors, (71), 7 states have call predecessors, (71), 9 states have return successors, (70), 9 states have call predecessors, (70), 7 states have call successors, (70) [2022-12-13 14:47:56,116 INFO L276 IsEmpty]: Start isEmpty. Operand 3984 states and 4795 transitions. [2022-12-13 14:47:56,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 381 [2022-12-13 14:47:56,119 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:47:56,119 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 12, 12, 9, 9, 8, 8, 8, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-12-13 14:47:56,124 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30b44354-3cd3-449d-bfc4-e017850c821e/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2022-12-13 14:47:56,320 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46,20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30b44354-3cd3-449d-bfc4-e017850c821e/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 14:47:56,321 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 14:47:56,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:47:56,322 INFO L85 PathProgramCache]: Analyzing trace with hash -996014735, now seen corresponding path program 1 times [2022-12-13 14:47:56,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:47:56,323 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629578155] [2022-12-13 14:47:56,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:47:56,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:47:56,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:47:56,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 14:47:56,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:47:56,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 14:47:56,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:47:56,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-12-13 14:47:56,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:47:56,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-12-13 14:47:56,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:47:56,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-12-13 14:47:56,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:47:56,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 14:47:56,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:47:56,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-12-13 14:47:56,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:47:56,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-12-13 14:47:56,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:47:56,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-12-13 14:47:56,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:47:56,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-12-13 14:47:56,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:47:56,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-12-13 14:47:56,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:47:56,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-12-13 14:47:56,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:47:56,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-12-13 14:47:56,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:47:56,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 14:47:56,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:47:56,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-12-13 14:47:56,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:47:56,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-12-13 14:47:56,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:47:56,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2022-12-13 14:47:56,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:47:56,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 204 [2022-12-13 14:47:56,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:47:56,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2022-12-13 14:47:56,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:47:56,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 232 [2022-12-13 14:47:56,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:47:56,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 241 [2022-12-13 14:47:56,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:47:56,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 251 [2022-12-13 14:47:56,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:47:56,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 262 [2022-12-13 14:47:56,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:47:56,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 271 [2022-12-13 14:47:56,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:47:56,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 279 [2022-12-13 14:47:56,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:47:56,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 289 [2022-12-13 14:47:56,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:47:56,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 296 [2022-12-13 14:47:56,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:47:56,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 306 [2022-12-13 14:47:56,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:47:56,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 314 [2022-12-13 14:47:56,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:47:56,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 330 [2022-12-13 14:47:56,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:47:56,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 339 [2022-12-13 14:47:56,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:47:56,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 348 [2022-12-13 14:47:56,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:47:57,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 356 [2022-12-13 14:47:57,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:47:57,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 365 [2022-12-13 14:47:57,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:47:57,008 INFO L134 CoverageAnalysis]: Checked inductivity of 1098 backedges. 18 proven. 23 refuted. 0 times theorem prover too weak. 1057 trivial. 0 not checked. [2022-12-13 14:47:57,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:47:57,009 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629578155] [2022-12-13 14:47:57,009 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1629578155] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 14:47:57,009 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1950020200] [2022-12-13 14:47:57,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:47:57,009 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 14:47:57,009 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30b44354-3cd3-449d-bfc4-e017850c821e/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 14:47:57,010 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30b44354-3cd3-449d-bfc4-e017850c821e/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 14:47:57,010 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30b44354-3cd3-449d-bfc4-e017850c821e/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-12-13 14:47:57,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:47:57,138 INFO L263 TraceCheckSpWp]: Trace formula consists of 1361 conjuncts, 19 conjunts are in the unsatisfiable core [2022-12-13 14:47:57,142 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 14:47:57,301 INFO L134 CoverageAnalysis]: Checked inductivity of 1098 backedges. 471 proven. 0 refuted. 0 times theorem prover too weak. 627 trivial. 0 not checked. [2022-12-13 14:47:57,301 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 14:47:57,302 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1950020200] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:47:57,302 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 14:47:57,302 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [17] total 25 [2022-12-13 14:47:57,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094089255] [2022-12-13 14:47:57,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:47:57,302 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 14:47:57,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:47:57,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 14:47:57,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=548, Unknown=0, NotChecked=0, Total=600 [2022-12-13 14:47:57,303 INFO L87 Difference]: Start difference. First operand 3984 states and 4795 transitions. Second operand has 10 states, 10 states have (on average 16.2) internal successors, (162), 9 states have internal predecessors, (162), 4 states have call successors, (26), 4 states have call predecessors, (26), 5 states have return successors, (26), 5 states have call predecessors, (26), 4 states have call successors, (26) [2022-12-13 14:47:59,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:47:59,263 INFO L93 Difference]: Finished difference Result 8324 states and 10188 transitions. [2022-12-13 14:47:59,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-12-13 14:47:59,263 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 16.2) internal successors, (162), 9 states have internal predecessors, (162), 4 states have call successors, (26), 4 states have call predecessors, (26), 5 states have return successors, (26), 5 states have call predecessors, (26), 4 states have call successors, (26) Word has length 380 [2022-12-13 14:47:59,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:47:59,269 INFO L225 Difference]: With dead ends: 8324 [2022-12-13 14:47:59,269 INFO L226 Difference]: Without dead ends: 4985 [2022-12-13 14:47:59,272 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 484 GetRequests, 440 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 281 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=241, Invalid=1829, Unknown=0, NotChecked=0, Total=2070 [2022-12-13 14:47:59,272 INFO L413 NwaCegarLoop]: 301 mSDtfsCounter, 691 mSDsluCounter, 1972 mSDsCounter, 0 mSdLazyCounter, 655 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 695 SdHoareTripleChecker+Valid, 2273 SdHoareTripleChecker+Invalid, 745 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 655 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-13 14:47:59,272 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [695 Valid, 2273 Invalid, 745 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 655 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-13 14:47:59,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4985 states. [2022-12-13 14:48:00,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4985 to 3579. [2022-12-13 14:48:00,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3579 states, 2924 states have (on average 1.179890560875513) internal successors, (3450), 2948 states have internal predecessors, (3450), 427 states have call successors, (427), 227 states have call predecessors, (427), 227 states have return successors, (427), 403 states have call predecessors, (427), 427 states have call successors, (427) [2022-12-13 14:48:00,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3579 states to 3579 states and 4304 transitions. [2022-12-13 14:48:00,197 INFO L78 Accepts]: Start accepts. Automaton has 3579 states and 4304 transitions. Word has length 380 [2022-12-13 14:48:00,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:48:00,198 INFO L495 AbstractCegarLoop]: Abstraction has 3579 states and 4304 transitions. [2022-12-13 14:48:00,198 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 16.2) internal successors, (162), 9 states have internal predecessors, (162), 4 states have call successors, (26), 4 states have call predecessors, (26), 5 states have return successors, (26), 5 states have call predecessors, (26), 4 states have call successors, (26) [2022-12-13 14:48:00,198 INFO L276 IsEmpty]: Start isEmpty. Operand 3579 states and 4304 transitions. [2022-12-13 14:48:00,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 385 [2022-12-13 14:48:00,201 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:48:00,201 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 12, 12, 10, 9, 7, 7, 7, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 14:48:00,206 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30b44354-3cd3-449d-bfc4-e017850c821e/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-12-13 14:48:00,401 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30b44354-3cd3-449d-bfc4-e017850c821e/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable47 [2022-12-13 14:48:00,402 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 14:48:00,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:48:00,403 INFO L85 PathProgramCache]: Analyzing trace with hash -48212473, now seen corresponding path program 1 times [2022-12-13 14:48:00,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:48:00,404 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654995829] [2022-12-13 14:48:00,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:48:00,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:48:00,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:48:00,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 14:48:00,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:48:00,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 14:48:00,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:48:00,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-12-13 14:48:00,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:48:00,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-12-13 14:48:00,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:48:00,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-12-13 14:48:00,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:48:00,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 14:48:00,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:48:00,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-12-13 14:48:00,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:48:00,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-12-13 14:48:00,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:48:00,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-12-13 14:48:00,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:48:00,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-12-13 14:48:00,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:48:00,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-12-13 14:48:00,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:48:00,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-12-13 14:48:00,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:48:00,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-12-13 14:48:00,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:48:00,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 14:48:00,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:48:00,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-12-13 14:48:00,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:48:00,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-12-13 14:48:00,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:48:00,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2022-12-13 14:48:00,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:48:00,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 204 [2022-12-13 14:48:00,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:48:00,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2022-12-13 14:48:00,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:48:00,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 233 [2022-12-13 14:48:00,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:48:00,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 242 [2022-12-13 14:48:00,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:48:00,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 252 [2022-12-13 14:48:00,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:48:00,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 263 [2022-12-13 14:48:00,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:48:00,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 272 [2022-12-13 14:48:00,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:48:00,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2022-12-13 14:48:00,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:48:00,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 289 [2022-12-13 14:48:00,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:48:00,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 299 [2022-12-13 14:48:00,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:48:00,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 307 [2022-12-13 14:48:00,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:48:00,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 323 [2022-12-13 14:48:00,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:48:00,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 332 [2022-12-13 14:48:00,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:48:00,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 341 [2022-12-13 14:48:00,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:48:00,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 349 [2022-12-13 14:48:00,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:48:00,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 358 [2022-12-13 14:48:00,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:48:00,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 368 [2022-12-13 14:48:00,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:48:00,909 INFO L134 CoverageAnalysis]: Checked inductivity of 1141 backedges. 137 proven. 132 refuted. 0 times theorem prover too weak. 872 trivial. 0 not checked. [2022-12-13 14:48:00,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:48:00,909 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654995829] [2022-12-13 14:48:00,909 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [654995829] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 14:48:00,909 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1496339393] [2022-12-13 14:48:00,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:48:00,910 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 14:48:00,910 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30b44354-3cd3-449d-bfc4-e017850c821e/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 14:48:00,910 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30b44354-3cd3-449d-bfc4-e017850c821e/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 14:48:00,911 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30b44354-3cd3-449d-bfc4-e017850c821e/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-12-13 14:48:01,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:48:01,057 INFO L263 TraceCheckSpWp]: Trace formula consists of 1363 conjuncts, 70 conjunts are in the unsatisfiable core [2022-12-13 14:48:01,061 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 14:48:02,072 INFO L134 CoverageAnalysis]: Checked inductivity of 1141 backedges. 612 proven. 249 refuted. 0 times theorem prover too weak. 280 trivial. 0 not checked. [2022-12-13 14:48:02,072 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 14:48:10,816 INFO L134 CoverageAnalysis]: Checked inductivity of 1141 backedges. 155 proven. 160 refuted. 0 times theorem prover too weak. 826 trivial. 0 not checked. [2022-12-13 14:48:10,816 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1496339393] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 14:48:10,816 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 14:48:10,816 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 27, 21] total 51 [2022-12-13 14:48:10,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390488928] [2022-12-13 14:48:10,816 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 14:48:10,817 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2022-12-13 14:48:10,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:48:10,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-12-13 14:48:10,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=2317, Unknown=2, NotChecked=0, Total=2550 [2022-12-13 14:48:10,818 INFO L87 Difference]: Start difference. First operand 3579 states and 4304 transitions. Second operand has 51 states, 51 states have (on average 7.333333333333333) internal successors, (374), 43 states have internal predecessors, (374), 14 states have call successors, (62), 11 states have call predecessors, (62), 24 states have return successors, (65), 21 states have call predecessors, (65), 14 states have call successors, (65) [2022-12-13 14:48:17,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:48:17,229 INFO L93 Difference]: Finished difference Result 7858 states and 9801 transitions. [2022-12-13 14:48:17,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-12-13 14:48:17,229 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 51 states have (on average 7.333333333333333) internal successors, (374), 43 states have internal predecessors, (374), 14 states have call successors, (62), 11 states have call predecessors, (62), 24 states have return successors, (65), 21 states have call predecessors, (65), 14 states have call successors, (65) Word has length 384 [2022-12-13 14:48:17,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:48:17,236 INFO L225 Difference]: With dead ends: 7858 [2022-12-13 14:48:17,236 INFO L226 Difference]: Without dead ends: 4684 [2022-12-13 14:48:17,240 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 890 GetRequests, 802 SyntacticMatches, 3 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1804 ImplicationChecksByTransitivity, 10.4s TimeCoverageRelationStatistics Valid=841, Invalid=6639, Unknown=2, NotChecked=0, Total=7482 [2022-12-13 14:48:17,240 INFO L413 NwaCegarLoop]: 261 mSDtfsCounter, 801 mSDsluCounter, 5936 mSDsCounter, 0 mSdLazyCounter, 4415 mSolverCounterSat, 235 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 826 SdHoareTripleChecker+Valid, 6197 SdHoareTripleChecker+Invalid, 4650 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 235 IncrementalHoareTripleChecker+Valid, 4415 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2022-12-13 14:48:17,240 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [826 Valid, 6197 Invalid, 4650 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [235 Valid, 4415 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2022-12-13 14:48:17,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4684 states. [2022-12-13 14:48:18,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4684 to 3586. [2022-12-13 14:48:18,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3586 states, 2930 states have (on average 1.1784982935153583) internal successors, (3453), 2954 states have internal predecessors, (3453), 427 states have call successors, (427), 228 states have call predecessors, (427), 228 states have return successors, (427), 403 states have call predecessors, (427), 427 states have call successors, (427) [2022-12-13 14:48:18,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3586 states to 3586 states and 4307 transitions. [2022-12-13 14:48:18,212 INFO L78 Accepts]: Start accepts. Automaton has 3586 states and 4307 transitions. Word has length 384 [2022-12-13 14:48:18,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:48:18,213 INFO L495 AbstractCegarLoop]: Abstraction has 3586 states and 4307 transitions. [2022-12-13 14:48:18,213 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 51 states have (on average 7.333333333333333) internal successors, (374), 43 states have internal predecessors, (374), 14 states have call successors, (62), 11 states have call predecessors, (62), 24 states have return successors, (65), 21 states have call predecessors, (65), 14 states have call successors, (65) [2022-12-13 14:48:18,213 INFO L276 IsEmpty]: Start isEmpty. Operand 3586 states and 4307 transitions. [2022-12-13 14:48:18,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 411 [2022-12-13 14:48:18,216 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:48:18,216 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 12, 12, 10, 10, 10, 10, 9, 8, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 14:48:18,221 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30b44354-3cd3-449d-bfc4-e017850c821e/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2022-12-13 14:48:18,416 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30b44354-3cd3-449d-bfc4-e017850c821e/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable48 [2022-12-13 14:48:18,418 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 14:48:18,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:48:18,419 INFO L85 PathProgramCache]: Analyzing trace with hash 552300336, now seen corresponding path program 1 times [2022-12-13 14:48:18,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:48:18,419 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161767053] [2022-12-13 14:48:18,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:48:18,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:48:18,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 14:48:18,455 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 14:48:18,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 14:48:18,573 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 14:48:18,573 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 14:48:18,574 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-12-13 14:48:18,575 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2022-12-13 14:48:18,577 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 14:48:18,580 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 14:48:18,734 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 02:48:18 BoogieIcfgContainer [2022-12-13 14:48:18,734 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 14:48:18,734 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-13 14:48:18,734 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-13 14:48:18,734 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-13 14:48:18,735 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 02:45:05" (3/4) ... [2022-12-13 14:48:18,737 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-12-13 14:48:18,944 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30b44354-3cd3-449d-bfc4-e017850c821e/bin/uautomizer-uyxdKDjOR8/witness.graphml [2022-12-13 14:48:18,944 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-13 14:48:18,945 INFO L158 Benchmark]: Toolchain (without parser) took 194682.44ms. Allocated memory was 121.6MB in the beginning and 1.2GB in the end (delta: 1.1GB). Free memory was 85.8MB in the beginning and 921.6MB in the end (delta: -835.8MB). Peak memory consumption was 295.0MB. Max. memory is 16.1GB. [2022-12-13 14:48:18,945 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 121.6MB. Free memory is still 91.1MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 14:48:18,945 INFO L158 Benchmark]: CACSL2BoogieTranslator took 234.07ms. Allocated memory is still 121.6MB. Free memory was 85.5MB in the beginning and 69.7MB in the end (delta: 15.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-12-13 14:48:18,945 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.11ms. Allocated memory is still 121.6MB. Free memory was 69.7MB in the beginning and 66.7MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 14:48:18,945 INFO L158 Benchmark]: Boogie Preprocessor took 24.36ms. Allocated memory is still 121.6MB. Free memory was 66.7MB in the beginning and 64.4MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 14:48:18,945 INFO L158 Benchmark]: RCFGBuilder took 582.53ms. Allocated memory was 121.6MB in the beginning and 165.7MB in the end (delta: 44.0MB). Free memory was 64.4MB in the beginning and 115.5MB in the end (delta: -51.1MB). Peak memory consumption was 21.4MB. Max. memory is 16.1GB. [2022-12-13 14:48:18,945 INFO L158 Benchmark]: TraceAbstraction took 193591.49ms. Allocated memory was 165.7MB in the beginning and 1.2GB in the end (delta: 1.1GB). Free memory was 115.5MB in the beginning and 962.5MB in the end (delta: -847.0MB). Peak memory consumption was 940.5MB. Max. memory is 16.1GB. [2022-12-13 14:48:18,946 INFO L158 Benchmark]: Witness Printer took 209.98ms. Allocated memory is still 1.2GB. Free memory was 962.5MB in the beginning and 921.6MB in the end (delta: 40.9MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2022-12-13 14:48:18,946 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.18ms. Allocated memory is still 121.6MB. Free memory is still 91.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 234.07ms. Allocated memory is still 121.6MB. Free memory was 85.5MB in the beginning and 69.7MB in the end (delta: 15.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 34.11ms. Allocated memory is still 121.6MB. Free memory was 69.7MB in the beginning and 66.7MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 24.36ms. Allocated memory is still 121.6MB. Free memory was 66.7MB in the beginning and 64.4MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 582.53ms. Allocated memory was 121.6MB in the beginning and 165.7MB in the end (delta: 44.0MB). Free memory was 64.4MB in the beginning and 115.5MB in the end (delta: -51.1MB). Peak memory consumption was 21.4MB. Max. memory is 16.1GB. * TraceAbstraction took 193591.49ms. Allocated memory was 165.7MB in the beginning and 1.2GB in the end (delta: 1.1GB). Free memory was 115.5MB in the beginning and 962.5MB in the end (delta: -847.0MB). Peak memory consumption was 940.5MB. Max. memory is 16.1GB. * Witness Printer took 209.98ms. Allocated memory is still 1.2GB. Free memory was 962.5MB in the beginning and 921.6MB in the end (delta: 40.9MB). Peak memory consumption was 41.9MB. 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: 535]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L23] msg_t nomsg = (msg_t )-1; [L24] port_t g1v ; [L25] int8_t g1v_old ; [L26] int8_t g1v_new ; [L27] port_t g2v ; [L28] int8_t g2v_old ; [L29] int8_t g2v_new ; [L30] port_t g3v ; [L31] int8_t g3v_old ; [L32] int8_t g3v_new ; [L36] _Bool gate1Failed ; [L37] _Bool gate2Failed ; [L38] _Bool gate3Failed ; [L39] msg_t VALUE1 ; [L40] msg_t VALUE2 ; [L41] msg_t VALUE3 ; [L43] _Bool gate1Failed_History_0 ; [L44] _Bool gate1Failed_History_1 ; [L45] _Bool gate1Failed_History_2 ; [L46] _Bool gate2Failed_History_0 ; [L47] _Bool gate2Failed_History_1 ; [L48] _Bool gate2Failed_History_2 ; [L49] _Bool gate3Failed_History_0 ; [L50] _Bool gate3Failed_History_1 ; [L51] _Bool gate3Failed_History_2 ; [L52] int8_t votedValue_History_0 ; [L53] int8_t votedValue_History_1 ; [L54] int8_t votedValue_History_2 ; VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=0, votedValue_History_1=0, votedValue_History_2=0] [L476] int c1 ; [L477] int i2 ; [L480] c1 = 0 [L481] gate1Failed = __VERIFIER_nondet_bool() [L482] gate2Failed = __VERIFIER_nondet_bool() [L483] gate3Failed = __VERIFIER_nondet_bool() [L484] VALUE1 = __VERIFIER_nondet_char() [L485] VALUE2 = __VERIFIER_nondet_char() [L486] VALUE3 = __VERIFIER_nondet_char() [L487] gate1Failed_History_0 = __VERIFIER_nondet_bool() [L488] gate1Failed_History_1 = __VERIFIER_nondet_bool() [L489] gate1Failed_History_2 = __VERIFIER_nondet_bool() [L490] gate2Failed_History_0 = __VERIFIER_nondet_bool() [L491] gate2Failed_History_1 = __VERIFIER_nondet_bool() [L492] gate2Failed_History_2 = __VERIFIER_nondet_bool() [L493] gate3Failed_History_0 = __VERIFIER_nondet_bool() [L494] gate3Failed_History_1 = __VERIFIER_nondet_bool() [L495] gate3Failed_History_2 = __VERIFIER_nondet_bool() [L496] votedValue_History_0 = __VERIFIER_nondet_char() [L497] votedValue_History_1 = __VERIFIER_nondet_char() [L498] votedValue_History_2 = __VERIFIER_nondet_char() [L499] CALL, EXPR init() [L203] int tmp ; [L204] int tmp___0 ; [L205] int tmp___1 ; [L206] int tmp___2 ; VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L209] CALL, EXPR add_history_type(0) VAL [\old(history_id)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L59] _Bool ini_bool ; [L60] int8_t ini_int ; [L61] int var ; [L62] int tmp ; [L63] int tmp___0 ; [L64] int tmp___1 ; [L65] int tmp___2 ; [L68] ini_bool = (_Bool)0 [L69] ini_int = (int8_t )-2 [L70] var = 0 VAL [\old(history_id)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, history_id=0, ini_bool=0, ini_int=-2, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L71] COND TRUE var < 3 VAL [\old(history_id)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, history_id=0, ini_bool=0, ini_int=-2, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L72] COND TRUE history_id == 0 VAL [\old(history_id)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, history_id=0, ini_bool=0, ini_int=-2, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L73] CALL, EXPR read_history_bool(0, 0) VAL [\old(history_id)=0, \old(historyIndex)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L126] COND TRUE history_id == 0 VAL [\old(history_id)=0, \old(historyIndex)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, history_id=0, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L127] COND TRUE historyIndex == 0 [L128] return (gate1Failed_History_0); VAL [\old(history_id)=0, \old(historyIndex)=0, \result=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, history_id=0, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L73] RET, EXPR read_history_bool(0, 0) VAL [\old(history_id)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, history_id=0, ini_bool=0, ini_int=-2, nomsg=-1, read_history_bool(0, 0)=0, VALUE1=0, VALUE2=0, VALUE3=0, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L73] tmp = (int )read_history_bool(0, 0) [L74] COND FALSE !(! (tmp == (int )ini_bool)) VAL [\old(history_id)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, history_id=0, ini_bool=0, ini_int=-2, nomsg=-1, tmp=0, VALUE1=0, VALUE2=0, VALUE3=0, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L96] var ++ VAL [\old(history_id)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, history_id=0, ini_bool=0, ini_int=-2, nomsg=-1, tmp=0, VALUE1=0, VALUE2=0, VALUE3=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L71] COND TRUE var < 3 VAL [\old(history_id)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, history_id=0, ini_bool=0, ini_int=-2, nomsg=-1, tmp=0, VALUE1=0, VALUE2=0, VALUE3=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L72] COND TRUE history_id == 0 VAL [\old(history_id)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, history_id=0, ini_bool=0, ini_int=-2, nomsg=-1, tmp=0, VALUE1=0, VALUE2=0, VALUE3=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L73] CALL, EXPR read_history_bool(0, 0) VAL [\old(history_id)=0, \old(historyIndex)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L126] COND TRUE history_id == 0 VAL [\old(history_id)=0, \old(historyIndex)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, history_id=0, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L127] COND TRUE historyIndex == 0 [L128] return (gate1Failed_History_0); VAL [\old(history_id)=0, \old(historyIndex)=0, \result=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, history_id=0, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L73] RET, EXPR read_history_bool(0, 0) VAL [\old(history_id)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, history_id=0, ini_bool=0, ini_int=-2, nomsg=-1, read_history_bool(0, 0)=0, tmp=0, VALUE1=0, VALUE2=0, VALUE3=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L73] tmp = (int )read_history_bool(0, 0) [L74] COND FALSE !(! (tmp == (int )ini_bool)) VAL [\old(history_id)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, history_id=0, ini_bool=0, ini_int=-2, nomsg=-1, tmp=0, VALUE1=0, VALUE2=0, VALUE3=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L96] var ++ VAL [\old(history_id)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, history_id=0, ini_bool=0, ini_int=-2, nomsg=-1, tmp=0, VALUE1=0, VALUE2=0, VALUE3=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L71] COND TRUE var < 3 VAL [\old(history_id)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, history_id=0, ini_bool=0, ini_int=-2, nomsg=-1, tmp=0, VALUE1=0, VALUE2=0, VALUE3=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L72] COND TRUE history_id == 0 VAL [\old(history_id)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, history_id=0, ini_bool=0, ini_int=-2, nomsg=-1, tmp=0, VALUE1=0, VALUE2=0, VALUE3=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L73] CALL, EXPR read_history_bool(0, 0) VAL [\old(history_id)=0, \old(historyIndex)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L126] COND TRUE history_id == 0 VAL [\old(history_id)=0, \old(historyIndex)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, history_id=0, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L127] COND TRUE historyIndex == 0 [L128] return (gate1Failed_History_0); VAL [\old(history_id)=0, \old(historyIndex)=0, \result=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, history_id=0, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L73] RET, EXPR read_history_bool(0, 0) VAL [\old(history_id)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, history_id=0, ini_bool=0, ini_int=-2, nomsg=-1, read_history_bool(0, 0)=0, tmp=0, VALUE1=0, VALUE2=0, VALUE3=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L73] tmp = (int )read_history_bool(0, 0) [L74] COND FALSE !(! (tmp == (int )ini_bool)) VAL [\old(history_id)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, history_id=0, ini_bool=0, ini_int=-2, nomsg=-1, tmp=0, VALUE1=0, VALUE2=0, VALUE3=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L96] var ++ VAL [\old(history_id)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, history_id=0, ini_bool=0, ini_int=-2, nomsg=-1, tmp=0, VALUE1=0, VALUE2=0, VALUE3=0, var=3, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L71] COND FALSE !(var < 3) VAL [\old(history_id)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, history_id=0, ini_bool=0, ini_int=-2, nomsg=-1, tmp=0, VALUE1=0, VALUE2=0, VALUE3=0, var=3, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L98] return (1); VAL [\old(history_id)=0, \result=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, history_id=0, ini_bool=0, ini_int=-2, nomsg=-1, tmp=0, VALUE1=0, VALUE2=0, VALUE3=0, var=3, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L209] RET, EXPR add_history_type(0) VAL [add_history_type(0)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L209] tmp = add_history_type(0) [L210] COND FALSE !(! tmp) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, nomsg=-1, tmp=1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L213] CALL, EXPR add_history_type(1) VAL [\old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L59] _Bool ini_bool ; [L60] int8_t ini_int ; [L61] int var ; [L62] int tmp ; [L63] int tmp___0 ; [L64] int tmp___1 ; [L65] int tmp___2 ; [L68] ini_bool = (_Bool)0 [L69] ini_int = (int8_t )-2 [L70] var = 0 VAL [\old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L71] COND TRUE var < 3 VAL [\old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L72] COND FALSE !(history_id == 0) VAL [\old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L78] COND TRUE history_id == 1 VAL [\old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L79] CALL, EXPR read_history_bool(1, 0) VAL [\old(history_id)=1, \old(historyIndex)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L126] COND FALSE !(history_id == 0) VAL [\old(history_id)=1, \old(historyIndex)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, history_id=1, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L136] COND TRUE history_id == 1 VAL [\old(history_id)=1, \old(historyIndex)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, history_id=1, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L137] COND TRUE historyIndex == 0 [L138] return (gate2Failed_History_0); VAL [\old(history_id)=1, \old(historyIndex)=0, \result=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=1, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L79] RET, EXPR read_history_bool(1, 0) VAL [\old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, read_history_bool(1, 0)=0, VALUE1=0, VALUE2=0, VALUE3=0, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L79] tmp___0 = (int )read_history_bool(1, 0) [L80] COND FALSE !(! (tmp___0 == (int )ini_bool)) VAL [\old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, tmp___0=0, VALUE1=0, VALUE2=0, VALUE3=0, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L96] var ++ VAL [\old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, tmp___0=0, VALUE1=0, VALUE2=0, VALUE3=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L71] COND TRUE var < 3 VAL [\old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, tmp___0=0, VALUE1=0, VALUE2=0, VALUE3=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L72] COND FALSE !(history_id == 0) VAL [\old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, tmp___0=0, VALUE1=0, VALUE2=0, VALUE3=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L78] COND TRUE history_id == 1 VAL [\old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, tmp___0=0, VALUE1=0, VALUE2=0, VALUE3=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L79] CALL, EXPR read_history_bool(1, 0) VAL [\old(history_id)=1, \old(historyIndex)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L126] COND FALSE !(history_id == 0) VAL [\old(history_id)=1, \old(historyIndex)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=1, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L136] COND TRUE history_id == 1 VAL [\old(history_id)=1, \old(historyIndex)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=1, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L137] COND TRUE historyIndex == 0 [L138] return (gate2Failed_History_0); VAL [\old(history_id)=1, \old(historyIndex)=0, \result=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=1, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L79] RET, EXPR read_history_bool(1, 0) VAL [\old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, read_history_bool(1, 0)=0, tmp___0=0, VALUE1=0, VALUE2=0, VALUE3=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L79] tmp___0 = (int )read_history_bool(1, 0) [L80] COND FALSE !(! (tmp___0 == (int )ini_bool)) VAL [\old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, tmp___0=0, VALUE1=0, VALUE2=0, VALUE3=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L96] var ++ VAL [\old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, tmp___0=0, VALUE1=0, VALUE2=0, VALUE3=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L71] COND TRUE var < 3 VAL [\old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, tmp___0=0, VALUE1=0, VALUE2=0, VALUE3=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L72] COND FALSE !(history_id == 0) VAL [\old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, tmp___0=0, VALUE1=0, VALUE2=0, VALUE3=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L78] COND TRUE history_id == 1 VAL [\old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, tmp___0=0, VALUE1=0, VALUE2=0, VALUE3=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L79] CALL, EXPR read_history_bool(1, 0) VAL [\old(history_id)=1, \old(historyIndex)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L126] COND FALSE !(history_id == 0) VAL [\old(history_id)=1, \old(historyIndex)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=1, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L136] COND TRUE history_id == 1 VAL [\old(history_id)=1, \old(historyIndex)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=1, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L137] COND TRUE historyIndex == 0 [L138] return (gate2Failed_History_0); VAL [\old(history_id)=1, \old(historyIndex)=0, \result=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=1, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L79] RET, EXPR read_history_bool(1, 0) VAL [\old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, read_history_bool(1, 0)=0, tmp___0=0, VALUE1=0, VALUE2=0, VALUE3=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L79] tmp___0 = (int )read_history_bool(1, 0) [L80] COND FALSE !(! (tmp___0 == (int )ini_bool)) VAL [\old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, tmp___0=0, VALUE1=0, VALUE2=0, VALUE3=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L96] var ++ VAL [\old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, tmp___0=0, VALUE1=0, VALUE2=0, VALUE3=0, var=3, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L71] COND FALSE !(var < 3) VAL [\old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, tmp___0=0, VALUE1=0, VALUE2=0, VALUE3=0, var=3, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L98] return (1); VAL [\old(history_id)=1, \result=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, tmp___0=0, VALUE1=0, VALUE2=0, VALUE3=0, var=3, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L213] RET, EXPR add_history_type(1) VAL [add_history_type(1)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, nomsg=-1, tmp=1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L213] tmp___0 = add_history_type(1) [L214] COND FALSE !(! tmp___0) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, nomsg=-1, tmp=1, tmp___0=1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L217] CALL, EXPR add_history_type(2) VAL [\old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L59] _Bool ini_bool ; [L60] int8_t ini_int ; [L61] int var ; [L62] int tmp ; [L63] int tmp___0 ; [L64] int tmp___1 ; [L65] int tmp___2 ; [L68] ini_bool = (_Bool)0 [L69] ini_int = (int8_t )-2 [L70] var = 0 VAL [\old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L71] COND TRUE var < 3 VAL [\old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L72] COND FALSE !(history_id == 0) VAL [\old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L78] COND FALSE !(history_id == 1) VAL [\old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L84] COND TRUE history_id == 2 VAL [\old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L85] CALL, EXPR read_history_bool(2, 0) VAL [\old(history_id)=2, \old(historyIndex)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L126] COND FALSE !(history_id == 0) VAL [\old(history_id)=2, \old(historyIndex)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=2, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L136] COND FALSE !(history_id == 1) VAL [\old(history_id)=2, \old(historyIndex)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=2, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L146] COND TRUE history_id == 2 VAL [\old(history_id)=2, \old(historyIndex)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=2, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L147] COND TRUE historyIndex == 0 [L148] return (gate3Failed_History_0); VAL [\old(history_id)=2, \old(historyIndex)=0, \result=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=2, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L85] RET, EXPR read_history_bool(2, 0) VAL [\old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, read_history_bool(2, 0)=0, VALUE1=0, VALUE2=0, VALUE3=0, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L85] tmp___1 = (int )read_history_bool(2, 0) [L86] COND FALSE !(! (tmp___1 == (int )ini_bool)) VAL [\old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, tmp___1=0, VALUE1=0, VALUE2=0, VALUE3=0, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L96] var ++ VAL [\old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, tmp___1=0, VALUE1=0, VALUE2=0, VALUE3=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L71] COND TRUE var < 3 VAL [\old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, tmp___1=0, VALUE1=0, VALUE2=0, VALUE3=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L72] COND FALSE !(history_id == 0) VAL [\old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, tmp___1=0, VALUE1=0, VALUE2=0, VALUE3=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L78] COND FALSE !(history_id == 1) VAL [\old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, tmp___1=0, VALUE1=0, VALUE2=0, VALUE3=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L84] COND TRUE history_id == 2 VAL [\old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, tmp___1=0, VALUE1=0, VALUE2=0, VALUE3=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L85] CALL, EXPR read_history_bool(2, 0) VAL [\old(history_id)=2, \old(historyIndex)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L126] COND FALSE !(history_id == 0) VAL [\old(history_id)=2, \old(historyIndex)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=2, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L136] COND FALSE !(history_id == 1) VAL [\old(history_id)=2, \old(historyIndex)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=2, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L146] COND TRUE history_id == 2 VAL [\old(history_id)=2, \old(historyIndex)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=2, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L147] COND TRUE historyIndex == 0 [L148] return (gate3Failed_History_0); VAL [\old(history_id)=2, \old(historyIndex)=0, \result=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=2, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L85] RET, EXPR read_history_bool(2, 0) VAL [\old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, read_history_bool(2, 0)=0, tmp___1=0, VALUE1=0, VALUE2=0, VALUE3=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L85] tmp___1 = (int )read_history_bool(2, 0) [L86] COND FALSE !(! (tmp___1 == (int )ini_bool)) VAL [\old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, tmp___1=0, VALUE1=0, VALUE2=0, VALUE3=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L96] var ++ VAL [\old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, tmp___1=0, VALUE1=0, VALUE2=0, VALUE3=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L71] COND TRUE var < 3 VAL [\old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, tmp___1=0, VALUE1=0, VALUE2=0, VALUE3=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L72] COND FALSE !(history_id == 0) VAL [\old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, tmp___1=0, VALUE1=0, VALUE2=0, VALUE3=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L78] COND FALSE !(history_id == 1) VAL [\old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, tmp___1=0, VALUE1=0, VALUE2=0, VALUE3=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L84] COND TRUE history_id == 2 VAL [\old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, tmp___1=0, VALUE1=0, VALUE2=0, VALUE3=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L85] CALL, EXPR read_history_bool(2, 0) VAL [\old(history_id)=2, \old(historyIndex)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L126] COND FALSE !(history_id == 0) VAL [\old(history_id)=2, \old(historyIndex)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=2, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L136] COND FALSE !(history_id == 1) VAL [\old(history_id)=2, \old(historyIndex)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=2, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L146] COND TRUE history_id == 2 VAL [\old(history_id)=2, \old(historyIndex)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=2, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L147] COND TRUE historyIndex == 0 [L148] return (gate3Failed_History_0); VAL [\old(history_id)=2, \old(historyIndex)=0, \result=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=2, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L85] RET, EXPR read_history_bool(2, 0) VAL [\old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, read_history_bool(2, 0)=0, tmp___1=0, VALUE1=0, VALUE2=0, VALUE3=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L85] tmp___1 = (int )read_history_bool(2, 0) [L86] COND FALSE !(! (tmp___1 == (int )ini_bool)) VAL [\old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, tmp___1=0, VALUE1=0, VALUE2=0, VALUE3=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L96] var ++ VAL [\old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, tmp___1=0, VALUE1=0, VALUE2=0, VALUE3=0, var=3, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L71] COND FALSE !(var < 3) VAL [\old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, tmp___1=0, VALUE1=0, VALUE2=0, VALUE3=0, var=3, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L98] return (1); VAL [\old(history_id)=2, \result=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, tmp___1=0, VALUE1=0, VALUE2=0, VALUE3=0, var=3, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L217] RET, EXPR add_history_type(2) VAL [add_history_type(2)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, nomsg=-1, tmp=1, tmp___0=1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L217] tmp___1 = add_history_type(2) [L218] COND FALSE !(! tmp___1) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, nomsg=-1, tmp=1, tmp___0=1, tmp___1=1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L221] CALL, EXPR add_history_type(3) VAL [\old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L59] _Bool ini_bool ; [L60] int8_t ini_int ; [L61] int var ; [L62] int tmp ; [L63] int tmp___0 ; [L64] int tmp___1 ; [L65] int tmp___2 ; [L68] ini_bool = (_Bool)0 [L69] ini_int = (int8_t )-2 [L70] var = 0 VAL [\old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L71] COND TRUE var < 3 VAL [\old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L72] COND FALSE !(history_id == 0) VAL [\old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L78] COND FALSE !(history_id == 1) VAL [\old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L84] COND FALSE !(history_id == 2) VAL [\old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L90] COND TRUE history_id == 3 VAL [\old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L91] CALL, EXPR read_history_int8(3, 0) VAL [\old(history_id)=3, \old(historyIndex)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L106] COND TRUE history_id == 3 VAL [\old(history_id)=3, \old(historyIndex)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L107] COND TRUE historyIndex == 0 [L108] return (votedValue_History_0); VAL [\old(history_id)=3, \old(historyIndex)=0, \result=-2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L91] RET, EXPR read_history_int8(3, 0) VAL [\old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, read_history_int8(3, 0)=-2, VALUE1=0, VALUE2=0, VALUE3=0, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L91] tmp___2 = (int )read_history_int8(3, 0) [L92] COND FALSE !(! (tmp___2 == (int )ini_int)) VAL [\old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, tmp___2=-2, VALUE1=0, VALUE2=0, VALUE3=0, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L96] var ++ VAL [\old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, tmp___2=-2, VALUE1=0, VALUE2=0, VALUE3=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L71] COND TRUE var < 3 VAL [\old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, tmp___2=-2, VALUE1=0, VALUE2=0, VALUE3=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L72] COND FALSE !(history_id == 0) VAL [\old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, tmp___2=-2, VALUE1=0, VALUE2=0, VALUE3=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L78] COND FALSE !(history_id == 1) VAL [\old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, tmp___2=-2, VALUE1=0, VALUE2=0, VALUE3=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L84] COND FALSE !(history_id == 2) VAL [\old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, tmp___2=-2, VALUE1=0, VALUE2=0, VALUE3=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L90] COND TRUE history_id == 3 VAL [\old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, tmp___2=-2, VALUE1=0, VALUE2=0, VALUE3=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L91] CALL, EXPR read_history_int8(3, 0) VAL [\old(history_id)=3, \old(historyIndex)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L106] COND TRUE history_id == 3 VAL [\old(history_id)=3, \old(historyIndex)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L107] COND TRUE historyIndex == 0 [L108] return (votedValue_History_0); VAL [\old(history_id)=3, \old(historyIndex)=0, \result=-2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L91] RET, EXPR read_history_int8(3, 0) VAL [\old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, read_history_int8(3, 0)=-2, tmp___2=-2, VALUE1=0, VALUE2=0, VALUE3=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L91] tmp___2 = (int )read_history_int8(3, 0) [L92] COND FALSE !(! (tmp___2 == (int )ini_int)) VAL [\old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, tmp___2=-2, VALUE1=0, VALUE2=0, VALUE3=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L96] var ++ VAL [\old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, tmp___2=-2, VALUE1=0, VALUE2=0, VALUE3=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L71] COND TRUE var < 3 VAL [\old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, tmp___2=-2, VALUE1=0, VALUE2=0, VALUE3=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L72] COND FALSE !(history_id == 0) VAL [\old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, tmp___2=-2, VALUE1=0, VALUE2=0, VALUE3=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L78] COND FALSE !(history_id == 1) VAL [\old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, tmp___2=-2, VALUE1=0, VALUE2=0, VALUE3=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L84] COND FALSE !(history_id == 2) VAL [\old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, tmp___2=-2, VALUE1=0, VALUE2=0, VALUE3=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L90] COND TRUE history_id == 3 VAL [\old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, tmp___2=-2, VALUE1=0, VALUE2=0, VALUE3=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L91] CALL, EXPR read_history_int8(3, 0) VAL [\old(history_id)=3, \old(historyIndex)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L106] COND TRUE history_id == 3 VAL [\old(history_id)=3, \old(historyIndex)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L107] COND TRUE historyIndex == 0 [L108] return (votedValue_History_0); VAL [\old(history_id)=3, \old(historyIndex)=0, \result=-2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L91] RET, EXPR read_history_int8(3, 0) VAL [\old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, read_history_int8(3, 0)=-2, tmp___2=-2, VALUE1=0, VALUE2=0, VALUE3=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L91] tmp___2 = (int )read_history_int8(3, 0) [L92] COND FALSE !(! (tmp___2 == (int )ini_int)) VAL [\old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, tmp___2=-2, VALUE1=0, VALUE2=0, VALUE3=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L96] var ++ VAL [\old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, tmp___2=-2, VALUE1=0, VALUE2=0, VALUE3=0, var=3, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L71] COND FALSE !(var < 3) VAL [\old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, tmp___2=-2, VALUE1=0, VALUE2=0, VALUE3=0, var=3, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L98] return (1); VAL [\old(history_id)=3, \result=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, tmp___2=-2, VALUE1=0, VALUE2=0, VALUE3=0, var=3, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L221] RET, EXPR add_history_type(3) VAL [add_history_type(3)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, nomsg=-1, tmp=1, tmp___0=1, tmp___1=1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L221] tmp___2 = add_history_type(3) [L222] COND FALSE !(! tmp___2) [L225] return (1); VAL [\result=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, nomsg=-1, tmp=1, tmp___0=1, tmp___1=1, tmp___2=1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L499] RET, EXPR init() [L499] i2 = init() [L500] COND FALSE !(!(i2)) VAL [c1=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, i2=1, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L501] g1v_old = nomsg [L502] g1v_new = nomsg [L503] g2v_old = nomsg [L504] g2v_new = nomsg [L505] g3v_old = nomsg [L506] g3v_new = nomsg [L507] i2 = 0 VAL [c1=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, i2=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L508] COND TRUE i2 < 10 [L510] CALL gate1_each_pals_period() [L338] int8_t next_state ; [L339] msg_t tmp ; [L340] int tmp___0 ; [L343] gate1Failed = __VERIFIER_nondet_bool() [L344] CALL write_history_bool(0, gate1Failed) VAL [\old(buf)=1, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=7, \old(gate1Failed_History_2)=2, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=4, \old(gate2Failed_History_2)=5, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=3, \old(gate3Failed_History_2)=6, \old(history_id)=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=0, gate1Failed_History_1=7, gate1Failed_History_2=2, gate2Failed_History_0=0, gate2Failed_History_1=4, gate2Failed_History_2=5, gate3Failed_History_0=0, gate3Failed_History_1=3, gate3Failed_History_2=6, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L181] COND TRUE history_id == 0 [L182] gate1Failed_History_2 = gate1Failed_History_1 [L183] gate1Failed_History_1 = gate1Failed_History_0 [L184] gate1Failed_History_0 = buf VAL [\old(buf)=1, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=7, \old(gate1Failed_History_2)=2, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=4, \old(gate2Failed_History_2)=5, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=3, \old(gate3Failed_History_2)=6, \old(history_id)=0, buf=1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed_History_0=0, gate2Failed_History_1=4, gate2Failed_History_2=5, gate3Failed_History_0=0, gate3Failed_History_1=3, gate3Failed_History_2=6, history_id=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L344] RET write_history_bool(0, gate1Failed) VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed_History_0=0, gate2Failed_History_1=4, gate2Failed_History_2=5, gate3Failed_History_0=0, gate3Failed_History_1=3, gate3Failed_History_2=6, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L345] COND TRUE \read(gate1Failed) [L346] g1v_new = nomsg != nomsg && g1v_new == nomsg ? nomsg : g1v_new VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed_History_0=0, gate2Failed_History_1=4, gate2Failed_History_2=5, gate3Failed_History_0=0, gate3Failed_History_1=3, gate3Failed_History_2=6, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L510] RET gate1_each_pals_period() [L511] CALL gate2_each_pals_period() [L369] int8_t next_state ; [L370] msg_t tmp ; [L371] int tmp___0 ; [L374] gate2Failed = __VERIFIER_nondet_bool() [L375] CALL write_history_bool(1, gate2Failed) VAL [\old(buf)=1, \old(gate1Failed_History_0)=1, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=7, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=4, \old(gate2Failed_History_2)=5, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=3, \old(gate3Failed_History_2)=6, \old(history_id)=1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=4, gate2Failed_History_2=5, gate3Failed_History_0=0, gate3Failed_History_1=3, gate3Failed_History_2=6, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L181] COND FALSE !(history_id == 0) VAL [\old(buf)=1, \old(gate1Failed_History_0)=1, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=7, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=4, \old(gate2Failed_History_2)=5, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=3, \old(gate3Failed_History_2)=6, \old(history_id)=1, buf=1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=4, gate2Failed_History_2=5, gate3Failed_History_0=0, gate3Failed_History_1=3, gate3Failed_History_2=6, history_id=1, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L186] COND TRUE history_id == 1 [L187] gate2Failed_History_2 = gate2Failed_History_1 [L188] gate2Failed_History_1 = gate2Failed_History_0 [L189] gate2Failed_History_0 = buf VAL [\old(buf)=1, \old(gate1Failed_History_0)=1, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=7, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=4, \old(gate2Failed_History_2)=5, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=3, \old(gate3Failed_History_2)=6, \old(history_id)=1, buf=1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=4, gate3Failed_History_0=0, gate3Failed_History_1=3, gate3Failed_History_2=6, history_id=1, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L375] RET write_history_bool(1, gate2Failed) VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=4, gate3Failed_History_0=0, gate3Failed_History_1=3, gate3Failed_History_2=6, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L376] COND TRUE \read(gate2Failed) [L377] g2v_new = nomsg != nomsg && g2v_new == nomsg ? nomsg : g2v_new VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=4, gate3Failed_History_0=0, gate3Failed_History_1=3, gate3Failed_History_2=6, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L511] RET gate2_each_pals_period() [L512] CALL gate3_each_pals_period() [L400] int8_t next_state ; [L401] msg_t tmp ; [L402] int tmp___0 ; [L405] gate3Failed = __VERIFIER_nondet_bool() [L406] CALL write_history_bool(2, gate3Failed) VAL [\old(buf)=0, \old(gate1Failed_History_0)=1, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=7, \old(gate2Failed_History_0)=1, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=4, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=3, \old(gate3Failed_History_2)=6, \old(history_id)=2, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=4, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=3, gate3Failed_History_2=6, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L181] COND FALSE !(history_id == 0) VAL [\old(buf)=0, \old(gate1Failed_History_0)=1, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=7, \old(gate2Failed_History_0)=1, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=4, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=3, \old(gate3Failed_History_2)=6, \old(history_id)=2, buf=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=4, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=3, gate3Failed_History_2=6, history_id=2, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L186] COND FALSE !(history_id == 1) VAL [\old(buf)=0, \old(gate1Failed_History_0)=1, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=7, \old(gate2Failed_History_0)=1, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=4, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=3, \old(gate3Failed_History_2)=6, \old(history_id)=2, buf=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=4, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=3, gate3Failed_History_2=6, history_id=2, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L191] COND TRUE history_id == 2 [L192] gate3Failed_History_2 = gate3Failed_History_1 [L193] gate3Failed_History_1 = gate3Failed_History_0 [L194] gate3Failed_History_0 = buf VAL [\old(buf)=0, \old(gate1Failed_History_0)=1, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=7, \old(gate2Failed_History_0)=1, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=4, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=3, \old(gate3Failed_History_2)=6, \old(history_id)=2, buf=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=4, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=3, history_id=2, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L406] RET write_history_bool(2, gate3Failed) VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=4, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=3, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L407] COND FALSE !(\read(gate3Failed)) [L411] tmp = __VERIFIER_nondet_char() [L412] next_state = tmp VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=4, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=3, next_state=0, nomsg=-1, tmp=0, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L413] COND TRUE (int )next_state == 0 [L414] tmp___0 = 1 VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=4, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=3, next_state=0, nomsg=-1, tmp=0, tmp___0=1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L424] COND FALSE !(!((_Bool )tmp___0)) VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=4, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=3, next_state=0, nomsg=-1, tmp=0, tmp___0=1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L425] g3v_new = next_state != nomsg && g3v_new == nomsg ? next_state : g3v_new VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=0, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=4, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=3, next_state=0, nomsg=-1, tmp=0, tmp___0=1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L512] RET gate3_each_pals_period() [L513] CALL voter() [L431] int8_t voted_value ; [L434] voted_value = nomsg [L435] VALUE1 = g1v_old [L436] g1v_old = nomsg [L437] VALUE2 = g2v_old [L438] g2v_old = nomsg [L439] VALUE3 = g3v_old [L440] g3v_old = nomsg VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=0, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=4, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=3, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, voted_value=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L441] COND TRUE (int )VALUE1 == (int )VALUE2 [L442] voted_value = VALUE1 VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=0, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=4, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=3, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, voted_value=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L470] CALL write_history_int8(3, voted_value) [L166] COND TRUE history_id == 3 [L167] votedValue_History_2 = votedValue_History_1 [L168] votedValue_History_1 = votedValue_History_0 [L169] votedValue_History_0 = buf VAL [\old(buf)=-1, \old(history_id)=3, buf=-1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=0, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=4, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=3, history_id=3, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L470] RET write_history_int8(3, voted_value) [L513] RET voter() [L514] g1v_old = g1v_new [L515] g1v_new = nomsg [L516] g2v_old = g2v_new [L517] g2v_new = nomsg [L518] g3v_old = g3v_new [L519] g3v_new = nomsg [L520] CALL, EXPR check() [L230] int tmp ; [L231] int temp_count ; [L232] int8_t tmp___0 ; [L233] int8_t tmp___1 ; [L234] int8_t tmp___2 ; [L235] _Bool tmp___3 ; [L236] _Bool tmp___4 ; [L237] _Bool tmp___5 ; [L238] int8_t tmp___6 ; [L239] _Bool tmp___7 ; [L240] _Bool tmp___8 ; [L241] _Bool tmp___9 ; [L242] int8_t tmp___10 ; [L243] int8_t tmp___11 ; [L244] int8_t tmp___12 ; [L245] int8_t tmp___13 ; [L246] int8_t tmp___14 ; VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=4, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=3, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L249] COND FALSE !(! gate1Failed) VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=4, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=3, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L252] COND FALSE !(! gate2Failed) VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=4, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=3, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L255] COND TRUE ! gate3Failed [L256] tmp = 1 VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=4, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=3, nomsg=-1, tmp=1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L260] COND FALSE !(!((_Bool )tmp)) VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=4, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=3, nomsg=-1, tmp=1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L261] CALL, EXPR read_history_bool(0, 1) VAL [\old(history_id)=0, \old(historyIndex)=1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=4, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=3, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L126] COND TRUE history_id == 0 VAL [\old(history_id)=0, \old(historyIndex)=1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=4, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=3, history_id=0, historyIndex=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L127] COND FALSE !(historyIndex == 0) VAL [\old(history_id)=0, \old(historyIndex)=1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=4, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=3, history_id=0, historyIndex=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L130] COND TRUE historyIndex == 1 [L131] return (gate1Failed_History_1); VAL [\old(history_id)=0, \old(historyIndex)=1, \result=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=4, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=3, history_id=0, historyIndex=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L261] RET, EXPR read_history_bool(0, 1) VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=4, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=3, nomsg=-1, read_history_bool(0, 1)=0, tmp=1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L261] tmp___3 = read_history_bool(0, 1) [L262] COND TRUE ! tmp___3 VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=4, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=3, nomsg=-1, tmp=1, tmp___3=0, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L263] CALL, EXPR read_history_bool(1, 1) VAL [\old(history_id)=1, \old(historyIndex)=1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=4, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=3, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L126] COND FALSE !(history_id == 0) VAL [\old(history_id)=1, \old(historyIndex)=1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=4, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=3, history_id=1, historyIndex=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L136] COND TRUE history_id == 1 VAL [\old(history_id)=1, \old(historyIndex)=1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=4, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=3, history_id=1, historyIndex=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L137] COND FALSE !(historyIndex == 0) VAL [\old(history_id)=1, \old(historyIndex)=1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=4, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=3, history_id=1, historyIndex=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L140] COND TRUE historyIndex == 1 [L141] return (gate2Failed_History_1); VAL [\old(history_id)=1, \old(historyIndex)=1, \result=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=4, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=3, history_id=1, historyIndex=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L263] RET, EXPR read_history_bool(1, 1) VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=4, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=3, nomsg=-1, read_history_bool(1, 1)=0, tmp=1, tmp___3=0, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L263] tmp___4 = read_history_bool(1, 1) [L264] COND TRUE ! tmp___4 VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=4, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=3, nomsg=-1, tmp=1, tmp___3=0, tmp___4=0, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L265] CALL, EXPR read_history_bool(2, 1) VAL [\old(history_id)=2, \old(historyIndex)=1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=4, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=3, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L126] COND FALSE !(history_id == 0) VAL [\old(history_id)=2, \old(historyIndex)=1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=4, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=3, history_id=2, historyIndex=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L136] COND FALSE !(history_id == 1) VAL [\old(history_id)=2, \old(historyIndex)=1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=4, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=3, history_id=2, historyIndex=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L146] COND TRUE history_id == 2 VAL [\old(history_id)=2, \old(historyIndex)=1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=4, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=3, history_id=2, historyIndex=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L147] COND FALSE !(historyIndex == 0) VAL [\old(history_id)=2, \old(historyIndex)=1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=4, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=3, history_id=2, historyIndex=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L150] COND TRUE historyIndex == 1 [L151] return (gate3Failed_History_1); VAL [\old(history_id)=2, \old(historyIndex)=1, \result=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=4, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=3, history_id=2, historyIndex=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L265] RET, EXPR read_history_bool(2, 1) VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=4, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=3, nomsg=-1, read_history_bool(2, 1)=0, tmp=1, tmp___3=0, tmp___4=0, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L265] tmp___5 = read_history_bool(2, 1) [L266] COND TRUE ! tmp___5 [L267] temp_count = 0 VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=4, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=3, nomsg=-1, temp_count=0, tmp=1, tmp___3=0, tmp___4=0, tmp___5=0, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L268] CALL, EXPR read_history_int8(3, 0) VAL [\old(history_id)=3, \old(historyIndex)=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=4, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=3, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L106] COND TRUE history_id == 3 VAL [\old(history_id)=3, \old(historyIndex)=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=4, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=3, history_id=3, historyIndex=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L107] COND TRUE historyIndex == 0 [L108] return (votedValue_History_0); VAL [\old(history_id)=3, \old(historyIndex)=0, \result=-1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=4, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=3, history_id=3, historyIndex=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L268] RET, EXPR read_history_int8(3, 0) VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=4, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=3, nomsg=-1, read_history_int8(3, 0)=-1, temp_count=0, tmp=1, tmp___3=0, tmp___4=0, tmp___5=0, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L268] tmp___0 = read_history_int8(3, 0) [L269] COND TRUE (int )VALUE1 == (int )tmp___0 [L270] temp_count ++ VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=4, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=3, nomsg=-1, temp_count=1, tmp=1, tmp___0=-1, tmp___3=0, tmp___4=0, tmp___5=0, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L272] CALL, EXPR read_history_int8(3, 0) VAL [\old(history_id)=3, \old(historyIndex)=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=4, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=3, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L106] COND TRUE history_id == 3 VAL [\old(history_id)=3, \old(historyIndex)=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=4, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=3, history_id=3, historyIndex=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L107] COND TRUE historyIndex == 0 [L108] return (votedValue_History_0); VAL [\old(history_id)=3, \old(historyIndex)=0, \result=-1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=4, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=3, history_id=3, historyIndex=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L272] RET, EXPR read_history_int8(3, 0) VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=4, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=3, nomsg=-1, read_history_int8(3, 0)=-1, temp_count=1, tmp=1, tmp___0=-1, tmp___3=0, tmp___4=0, tmp___5=0, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L272] tmp___1 = read_history_int8(3, 0) [L273] COND TRUE (int )VALUE2 == (int )tmp___1 [L274] temp_count ++ VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=4, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=3, nomsg=-1, temp_count=2, tmp=1, tmp___0=-1, tmp___1=-1, tmp___3=0, tmp___4=0, tmp___5=0, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L276] CALL, EXPR read_history_int8(3, 0) VAL [\old(history_id)=3, \old(historyIndex)=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=4, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=3, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L106] COND TRUE history_id == 3 VAL [\old(history_id)=3, \old(historyIndex)=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=4, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=3, history_id=3, historyIndex=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L107] COND TRUE historyIndex == 0 [L108] return (votedValue_History_0); VAL [\old(history_id)=3, \old(historyIndex)=0, \result=-1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=4, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=3, history_id=3, historyIndex=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L276] RET, EXPR read_history_int8(3, 0) VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=4, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=3, nomsg=-1, read_history_int8(3, 0)=-1, temp_count=2, tmp=1, tmp___0=-1, tmp___1=-1, tmp___3=0, tmp___4=0, tmp___5=0, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L276] tmp___2 = read_history_int8(3, 0) [L277] COND TRUE (int )VALUE3 == (int )tmp___2 [L278] temp_count ++ VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=4, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=3, nomsg=-1, temp_count=3, tmp=1, tmp___0=-1, tmp___1=-1, tmp___2=-1, tmp___3=0, tmp___4=0, tmp___5=0, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L280] COND FALSE !((int )VALUE1 != (int )VALUE2) VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=4, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=3, nomsg=-1, temp_count=3, tmp=1, tmp___0=-1, tmp___1=-1, tmp___2=-1, tmp___3=0, tmp___4=0, tmp___5=0, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L294] COND FALSE !(! (temp_count > 1)) VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=4, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=3, nomsg=-1, temp_count=3, tmp=1, tmp___0=-1, tmp___1=-1, tmp___2=-1, tmp___3=0, tmp___4=0, tmp___5=0, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L300] CALL, EXPR read_history_int8(3, 1) VAL [\old(history_id)=3, \old(historyIndex)=1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=4, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=3, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L106] COND TRUE history_id == 3 VAL [\old(history_id)=3, \old(historyIndex)=1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=4, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=3, history_id=3, historyIndex=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L107] COND FALSE !(historyIndex == 0) VAL [\old(history_id)=3, \old(historyIndex)=1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=4, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=3, history_id=3, historyIndex=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L110] COND TRUE historyIndex == 1 [L111] return (votedValue_History_1); VAL [\old(history_id)=3, \old(historyIndex)=1, \result=-2, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=4, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=3, history_id=3, historyIndex=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L300] RET, EXPR read_history_int8(3, 1) VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=4, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=3, nomsg=-1, read_history_int8(3, 1)=-2, temp_count=3, tmp=1, tmp___0=-1, tmp___1=-1, tmp___2=-1, tmp___3=0, tmp___4=0, tmp___5=0, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L300] tmp___10 = read_history_int8(3, 1) [L301] COND FALSE !((int )tmp___10 > -2) VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=4, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=3, nomsg=-1, temp_count=3, tmp=1, tmp___0=-1, tmp___1=-1, tmp___10=-2, tmp___2=-1, tmp___3=0, tmp___4=0, tmp___5=0, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L320] CALL, EXPR read_history_int8(3, 0) VAL [\old(history_id)=3, \old(historyIndex)=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=4, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=3, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L106] COND TRUE history_id == 3 VAL [\old(history_id)=3, \old(historyIndex)=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=4, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=3, history_id=3, historyIndex=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L107] COND TRUE historyIndex == 0 [L108] return (votedValue_History_0); VAL [\old(history_id)=3, \old(historyIndex)=0, \result=-1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=4, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=3, history_id=3, historyIndex=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L320] RET, EXPR read_history_int8(3, 0) VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=4, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=3, nomsg=-1, read_history_int8(3, 0)=-1, temp_count=3, tmp=1, tmp___0=-1, tmp___1=-1, tmp___10=-2, tmp___2=-1, tmp___3=0, tmp___4=0, tmp___5=0, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L320] tmp___11 = read_history_int8(3, 0) [L321] COND FALSE !((int )tmp___11 != (int )nomsg) VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=4, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=3, nomsg=-1, temp_count=3, tmp=1, tmp___0=-1, tmp___1=-1, tmp___10=-2, tmp___11=-1, tmp___2=-1, tmp___3=0, tmp___4=0, tmp___5=0, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L333] return (1); VAL [\result=1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=4, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=3, nomsg=-1, temp_count=3, tmp=1, tmp___0=-1, tmp___1=-1, tmp___10=-2, tmp___11=-1, tmp___2=-1, tmp___3=0, tmp___4=0, tmp___5=0, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L520] RET, EXPR check() [L520] c1 = check() [L521] CALL assert(c1) VAL [\old(arg)=1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=4, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=3, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L533] COND FALSE !(! arg) VAL [\old(arg)=1, arg=1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=4, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=3, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L521] RET assert(c1) VAL [c1=1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=4, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=3, i2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L522] i2 ++ VAL [c1=1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=4, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=3, i2=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L508] COND TRUE i2 < 10 [L510] CALL gate1_each_pals_period() [L338] int8_t next_state ; [L339] msg_t tmp ; [L340] int tmp___0 ; [L343] gate1Failed = __VERIFIER_nondet_bool() [L344] CALL write_history_bool(0, gate1Failed) VAL [\old(buf)=0, \old(gate1Failed_History_0)=1, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=7, \old(gate2Failed_History_0)=1, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=4, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=3, \old(history_id)=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=4, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=3, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L181] COND TRUE history_id == 0 [L182] gate1Failed_History_2 = gate1Failed_History_1 [L183] gate1Failed_History_1 = gate1Failed_History_0 [L184] gate1Failed_History_0 = buf VAL [\old(buf)=0, \old(gate1Failed_History_0)=1, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=7, \old(gate2Failed_History_0)=1, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=4, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=3, \old(history_id)=0, buf=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=4, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=3, history_id=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L344] RET write_history_bool(0, gate1Failed) VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=4, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=3, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L345] COND FALSE !(\read(gate1Failed)) [L349] tmp = __VERIFIER_nondet_char() [L350] next_state = tmp VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=4, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=3, next_state=0, nomsg=-1, tmp=0, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L351] COND TRUE (int )next_state == 0 [L352] tmp___0 = 1 VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=4, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=3, next_state=0, nomsg=-1, tmp=0, tmp___0=1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L362] COND FALSE !(!((_Bool )tmp___0)) VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=4, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=3, next_state=0, nomsg=-1, tmp=0, tmp___0=1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L363] g1v_new = next_state != nomsg && g1v_new == nomsg ? next_state : g1v_new VAL [g1v=0, g1v_new=0, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=4, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=3, next_state=0, nomsg=-1, tmp=0, tmp___0=1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L510] RET gate1_each_pals_period() [L511] CALL gate2_each_pals_period() [L369] int8_t next_state ; [L370] msg_t tmp ; [L371] int tmp___0 ; [L374] gate2Failed = __VERIFIER_nondet_bool() [L375] CALL write_history_bool(1, gate2Failed) VAL [\old(buf)=1, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=1, \old(gate1Failed_History_2)=0, \old(gate2Failed_History_0)=1, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=4, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=3, \old(history_id)=1, g1v=0, g1v_new=0, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=4, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=3, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L181] COND FALSE !(history_id == 0) VAL [\old(buf)=1, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=1, \old(gate1Failed_History_2)=0, \old(gate2Failed_History_0)=1, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=4, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=3, \old(history_id)=1, buf=1, g1v=0, g1v_new=0, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=4, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=3, history_id=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L186] COND TRUE history_id == 1 [L187] gate2Failed_History_2 = gate2Failed_History_1 [L188] gate2Failed_History_1 = gate2Failed_History_0 [L189] gate2Failed_History_0 = buf VAL [\old(buf)=1, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=1, \old(gate1Failed_History_2)=0, \old(gate2Failed_History_0)=1, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=4, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=3, \old(history_id)=1, buf=1, g1v=0, g1v_new=0, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=3, history_id=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L375] RET write_history_bool(1, gate2Failed) VAL [g1v=0, g1v_new=0, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=3, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L376] COND TRUE \read(gate2Failed) [L377] g2v_new = nomsg != nomsg && g2v_new == nomsg ? nomsg : g2v_new VAL [g1v=0, g1v_new=0, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=3, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L511] RET gate2_each_pals_period() [L512] CALL gate3_each_pals_period() [L400] int8_t next_state ; [L401] msg_t tmp ; [L402] int tmp___0 ; [L405] gate3Failed = __VERIFIER_nondet_bool() [L406] CALL write_history_bool(2, gate3Failed) VAL [\old(buf)=1, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=1, \old(gate1Failed_History_2)=0, \old(gate2Failed_History_0)=1, \old(gate2Failed_History_1)=1, \old(gate2Failed_History_2)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=3, \old(history_id)=2, g1v=0, g1v_new=0, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=3, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L181] COND FALSE !(history_id == 0) VAL [\old(buf)=1, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=1, \old(gate1Failed_History_2)=0, \old(gate2Failed_History_0)=1, \old(gate2Failed_History_1)=1, \old(gate2Failed_History_2)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=3, \old(history_id)=2, buf=1, g1v=0, g1v_new=0, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=3, history_id=2, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L186] COND FALSE !(history_id == 1) VAL [\old(buf)=1, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=1, \old(gate1Failed_History_2)=0, \old(gate2Failed_History_0)=1, \old(gate2Failed_History_1)=1, \old(gate2Failed_History_2)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=3, \old(history_id)=2, buf=1, g1v=0, g1v_new=0, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=3, history_id=2, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L191] COND TRUE history_id == 2 [L192] gate3Failed_History_2 = gate3Failed_History_1 [L193] gate3Failed_History_1 = gate3Failed_History_0 [L194] gate3Failed_History_0 = buf VAL [\old(buf)=1, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=1, \old(gate1Failed_History_2)=0, \old(gate2Failed_History_0)=1, \old(gate2Failed_History_1)=1, \old(gate2Failed_History_2)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=3, \old(history_id)=2, buf=1, g1v=0, g1v_new=0, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=2, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L406] RET write_history_bool(2, gate3Failed) VAL [g1v=0, g1v_new=0, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L407] COND TRUE \read(gate3Failed) [L408] g3v_new = nomsg != nomsg && g3v_new == nomsg ? nomsg : g3v_new VAL [g1v=0, g1v_new=0, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L512] RET gate3_each_pals_period() [L513] CALL voter() [L431] int8_t voted_value ; [L434] voted_value = nomsg [L435] VALUE1 = g1v_old [L436] g1v_old = nomsg [L437] VALUE2 = g2v_old [L438] g2v_old = nomsg [L439] VALUE3 = g3v_old [L440] g3v_old = nomsg VAL [g1v=0, g1v_new=0, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, voted_value=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L441] COND TRUE (int )VALUE1 == (int )VALUE2 [L442] voted_value = VALUE1 VAL [g1v=0, g1v_new=0, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, voted_value=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L470] CALL write_history_int8(3, voted_value) [L166] COND TRUE history_id == 3 [L167] votedValue_History_2 = votedValue_History_1 [L168] votedValue_History_1 = votedValue_History_0 [L169] votedValue_History_0 = buf VAL [\old(buf)=-1, \old(history_id)=3, buf=-1, g1v=0, g1v_new=0, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=3, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L470] RET write_history_int8(3, voted_value) [L513] RET voter() [L514] g1v_old = g1v_new [L515] g1v_new = nomsg [L516] g2v_old = g2v_new [L517] g2v_new = nomsg [L518] g3v_old = g3v_new [L519] g3v_new = nomsg [L520] CALL, EXPR check() [L230] int tmp ; [L231] int temp_count ; [L232] int8_t tmp___0 ; [L233] int8_t tmp___1 ; [L234] int8_t tmp___2 ; [L235] _Bool tmp___3 ; [L236] _Bool tmp___4 ; [L237] _Bool tmp___5 ; [L238] int8_t tmp___6 ; [L239] _Bool tmp___7 ; [L240] _Bool tmp___8 ; [L241] _Bool tmp___9 ; [L242] int8_t tmp___10 ; [L243] int8_t tmp___11 ; [L244] int8_t tmp___12 ; [L245] int8_t tmp___13 ; [L246] int8_t tmp___14 ; VAL [g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L249] COND TRUE ! gate1Failed [L250] tmp = 1 VAL [g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, tmp=1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L260] COND FALSE !(!((_Bool )tmp)) VAL [g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, tmp=1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L261] CALL, EXPR read_history_bool(0, 1) VAL [\old(history_id)=0, \old(historyIndex)=1, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L126] COND TRUE history_id == 0 VAL [\old(history_id)=0, \old(historyIndex)=1, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=0, historyIndex=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L127] COND FALSE !(historyIndex == 0) VAL [\old(history_id)=0, \old(historyIndex)=1, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=0, historyIndex=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L130] COND TRUE historyIndex == 1 [L131] return (gate1Failed_History_1); VAL [\old(history_id)=0, \old(historyIndex)=1, \result=-511, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=0, historyIndex=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L261] RET, EXPR read_history_bool(0, 1) VAL [g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, read_history_bool(0, 1)=-511, tmp=1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L261] tmp___3 = read_history_bool(0, 1) [L262] COND FALSE !(! tmp___3) VAL [g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, tmp=1, tmp___3=1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L300] CALL, EXPR read_history_int8(3, 1) VAL [\old(history_id)=3, \old(historyIndex)=1, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L106] COND TRUE history_id == 3 VAL [\old(history_id)=3, \old(historyIndex)=1, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=3, historyIndex=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L107] COND FALSE !(historyIndex == 0) VAL [\old(history_id)=3, \old(historyIndex)=1, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=3, historyIndex=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L110] COND TRUE historyIndex == 1 [L111] return (votedValue_History_1); VAL [\old(history_id)=3, \old(historyIndex)=1, \result=-1, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=3, historyIndex=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L300] RET, EXPR read_history_int8(3, 1) VAL [g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, read_history_int8(3, 1)=-1, tmp=1, tmp___3=1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L300] tmp___10 = read_history_int8(3, 1) [L301] COND TRUE (int )tmp___10 > -2 VAL [g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, tmp=1, tmp___10=-1, tmp___3=1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L302] CALL, EXPR read_history_int8(3, 0) VAL [\old(history_id)=3, \old(historyIndex)=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L106] COND TRUE history_id == 3 VAL [\old(history_id)=3, \old(historyIndex)=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=3, historyIndex=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L107] COND TRUE historyIndex == 0 [L108] return (votedValue_History_0); VAL [\old(history_id)=3, \old(historyIndex)=0, \result=-1, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=3, historyIndex=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L302] RET, EXPR read_history_int8(3, 0) VAL [g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, read_history_int8(3, 0)=-1, tmp=1, tmp___10=-1, tmp___3=1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L302] tmp___6 = read_history_int8(3, 0) [L303] COND TRUE (int )tmp___6 == (int )nomsg VAL [g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, tmp=1, tmp___10=-1, tmp___3=1, tmp___6=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L304] CALL, EXPR read_history_bool(0, 1) VAL [\old(history_id)=0, \old(historyIndex)=1, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L126] COND TRUE history_id == 0 VAL [\old(history_id)=0, \old(historyIndex)=1, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=0, historyIndex=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L127] COND FALSE !(historyIndex == 0) VAL [\old(history_id)=0, \old(historyIndex)=1, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=0, historyIndex=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L130] COND TRUE historyIndex == 1 [L131] return (gate1Failed_History_1); VAL [\old(history_id)=0, \old(historyIndex)=1, \result=-511, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=0, historyIndex=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L304] RET, EXPR read_history_bool(0, 1) VAL [g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, read_history_bool(0, 1)=-511, tmp=1, tmp___10=-1, tmp___3=1, tmp___6=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L304] tmp___7 = read_history_bool(0, 1) [L305] COND TRUE \read(tmp___7) VAL [g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, tmp=1, tmp___10=-1, tmp___3=1, tmp___6=-1, tmp___7=1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L306] CALL, EXPR read_history_bool(1, 1) VAL [\old(history_id)=1, \old(historyIndex)=1, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L126] COND FALSE !(history_id == 0) VAL [\old(history_id)=1, \old(historyIndex)=1, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=1, historyIndex=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L136] COND TRUE history_id == 1 VAL [\old(history_id)=1, \old(historyIndex)=1, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=1, historyIndex=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L137] COND FALSE !(historyIndex == 0) VAL [\old(history_id)=1, \old(historyIndex)=1, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=1, historyIndex=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L140] COND TRUE historyIndex == 1 [L141] return (gate2Failed_History_1); VAL [\old(history_id)=1, \old(historyIndex)=1, \result=-255, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=1, historyIndex=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L306] RET, EXPR read_history_bool(1, 1) VAL [g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, read_history_bool(1, 1)=-255, tmp=1, tmp___10=-1, tmp___3=1, tmp___6=-1, tmp___7=1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L306] tmp___8 = read_history_bool(1, 1) [L307] COND TRUE \read(tmp___8) VAL [g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, tmp=1, tmp___10=-1, tmp___3=1, tmp___6=-1, tmp___7=1, tmp___8=1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L308] CALL, EXPR read_history_bool(2, 1) VAL [\old(history_id)=2, \old(historyIndex)=1, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L126] COND FALSE !(history_id == 0) VAL [\old(history_id)=2, \old(historyIndex)=1, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=2, historyIndex=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L136] COND FALSE !(history_id == 1) VAL [\old(history_id)=2, \old(historyIndex)=1, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=2, historyIndex=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L146] COND TRUE history_id == 2 VAL [\old(history_id)=2, \old(historyIndex)=1, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=2, historyIndex=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L147] COND FALSE !(historyIndex == 0) VAL [\old(history_id)=2, \old(historyIndex)=1, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=2, historyIndex=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L150] COND TRUE historyIndex == 1 [L151] return (gate3Failed_History_1); VAL [\old(history_id)=2, \old(historyIndex)=1, \result=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=2, historyIndex=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L308] RET, EXPR read_history_bool(2, 1) VAL [g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, read_history_bool(2, 1)=0, tmp=1, tmp___10=-1, tmp___3=1, tmp___6=-1, tmp___7=1, tmp___8=1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L308] tmp___9 = read_history_bool(2, 1) [L309] COND TRUE ! tmp___9 [L310] return (0); VAL [\result=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, tmp=1, tmp___10=-1, tmp___3=1, tmp___6=-1, tmp___7=1, tmp___8=1, tmp___9=0, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L520] RET, EXPR check() [L520] c1 = check() [L521] CALL assert(c1) VAL [\old(arg)=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L533] COND TRUE ! arg VAL [\old(arg)=0, arg=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L535] reach_error() VAL [\old(arg)=0, arg=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 175 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 193.4s, OverallIterations: 50, TraceHistogramMax: 16, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 146.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 32637 SdHoareTripleChecker+Valid, 58.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 32207 mSDsluCounter, 145736 SdHoareTripleChecker+Invalid, 50.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 129822 mSDsCounter, 18653 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 122563 IncrementalHoareTripleChecker+Invalid, 141216 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 18653 mSolverCounterUnsat, 15914 mSDtfsCounter, 122563 mSolverCounterSat, 0.7s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 13053 GetRequests, 10965 SyntacticMatches, 24 SemanticMatches, 2064 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 314499 ImplicationChecksByTransitivity, 72.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5495occurred in iteration=42, InterpolantAutomatonStates: 1825, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 10.8s AutomataMinimizationTime, 49 MinimizatonAttempts, 56109 StatesRemovedByMinimization, 33 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.7s SsaConstructionTime, 2.3s SatisfiabilityAnalysisTime, 27.2s InterpolantComputationTime, 17572 NumberOfCodeBlocks, 17572 NumberOfCodeBlocksAsserted, 71 NumberOfCheckSat, 20081 ConstructedInterpolants, 2 QuantifiedInterpolants, 49416 SizeOfPredicates, 79 NumberOfNonLiveVariables, 21496 ConjunctsInSsa, 417 ConjunctsInUnsatCore, 80 InterpolantComputations, 40 PerfectInterpolantSequences, 49283/51947 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-12-13 14:48:18,985 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30b44354-3cd3-449d-bfc4-e017850c821e/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with 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