./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_2.ufo.UNBOUNDED.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8393723b Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d29f079-78c4-4116-83da-dc1ebb38fecd/bin/uautomizer-TMbwUNV5ro/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d29f079-78c4-4116-83da-dc1ebb38fecd/bin/uautomizer-TMbwUNV5ro/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d29f079-78c4-4116-83da-dc1ebb38fecd/bin/uautomizer-TMbwUNV5ro/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d29f079-78c4-4116-83da-dc1ebb38fecd/bin/uautomizer-TMbwUNV5ro/config/AutomizerReach.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_2.ufo.UNBOUNDED.pals.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d29f079-78c4-4116-83da-dc1ebb38fecd/bin/uautomizer-TMbwUNV5ro/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d29f079-78c4-4116-83da-dc1ebb38fecd/bin/uautomizer-TMbwUNV5ro --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 01a21536345230b7194ff5017879c469eb8be909ba72352bb81feb2f101a934f --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-8393723 [2022-11-18 20:30:06,365 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-18 20:30:06,371 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-18 20:30:06,410 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-18 20:30:06,412 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-18 20:30:06,417 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-18 20:30:06,419 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-18 20:30:06,423 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-18 20:30:06,426 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-18 20:30:06,429 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-18 20:30:06,431 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-18 20:30:06,433 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-18 20:30:06,433 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-18 20:30:06,438 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-18 20:30:06,440 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-18 20:30:06,441 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-18 20:30:06,443 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-18 20:30:06,444 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-18 20:30:06,446 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-18 20:30:06,447 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-18 20:30:06,449 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-18 20:30:06,450 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-18 20:30:06,453 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-18 20:30:06,454 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-18 20:30:06,460 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-18 20:30:06,465 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-18 20:30:06,465 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-18 20:30:06,466 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-18 20:30:06,467 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-18 20:30:06,468 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-18 20:30:06,469 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-18 20:30:06,470 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-18 20:30:06,471 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-18 20:30:06,473 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-18 20:30:06,474 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-18 20:30:06,475 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-18 20:30:06,476 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-18 20:30:06,476 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-18 20:30:06,477 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-18 20:30:06,478 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-18 20:30:06,480 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-18 20:30:06,481 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d29f079-78c4-4116-83da-dc1ebb38fecd/bin/uautomizer-TMbwUNV5ro/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-18 20:30:06,524 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-18 20:30:06,524 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-18 20:30:06,525 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-18 20:30:06,525 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-18 20:30:06,526 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-18 20:30:06,526 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-18 20:30:06,527 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-18 20:30:06,527 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-18 20:30:06,528 INFO L138 SettingsManager]: * Use SBE=true [2022-11-18 20:30:06,528 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-18 20:30:06,529 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-18 20:30:06,529 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-18 20:30:06,530 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-18 20:30:06,530 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-18 20:30:06,530 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-18 20:30:06,530 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-18 20:30:06,530 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-18 20:30:06,531 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-18 20:30:06,531 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-18 20:30:06,531 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-18 20:30:06,531 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-18 20:30:06,532 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-18 20:30:06,532 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-18 20:30:06,532 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-18 20:30:06,533 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 20:30:06,533 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-18 20:30:06,534 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-18 20:30:06,535 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-18 20:30:06,535 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-18 20:30:06,535 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-18 20:30:06,536 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-18 20:30:06,536 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-18 20:30:06,536 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-18 20:30:06,536 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d29f079-78c4-4116-83da-dc1ebb38fecd/bin/uautomizer-TMbwUNV5ro/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d29f079-78c4-4116-83da-dc1ebb38fecd/bin/uautomizer-TMbwUNV5ro Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 01a21536345230b7194ff5017879c469eb8be909ba72352bb81feb2f101a934f [2022-11-18 20:30:06,861 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-18 20:30:06,889 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-18 20:30:06,892 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-18 20:30:06,893 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-18 20:30:06,894 INFO L275 PluginConnector]: CDTParser initialized [2022-11-18 20:30:06,895 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d29f079-78c4-4116-83da-dc1ebb38fecd/bin/uautomizer-TMbwUNV5ro/../../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_2.ufo.UNBOUNDED.pals.c [2022-11-18 20:30:06,966 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d29f079-78c4-4116-83da-dc1ebb38fecd/bin/uautomizer-TMbwUNV5ro/data/dcb3e64f6/6e5b3107d7254d65aeaf2642e561b1c0/FLAG788ef9d1b [2022-11-18 20:30:07,495 INFO L306 CDTParser]: Found 1 translation units. [2022-11-18 20:30:07,496 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d29f079-78c4-4116-83da-dc1ebb38fecd/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_2.ufo.UNBOUNDED.pals.c [2022-11-18 20:30:07,506 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d29f079-78c4-4116-83da-dc1ebb38fecd/bin/uautomizer-TMbwUNV5ro/data/dcb3e64f6/6e5b3107d7254d65aeaf2642e561b1c0/FLAG788ef9d1b [2022-11-18 20:30:07,803 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d29f079-78c4-4116-83da-dc1ebb38fecd/bin/uautomizer-TMbwUNV5ro/data/dcb3e64f6/6e5b3107d7254d65aeaf2642e561b1c0 [2022-11-18 20:30:07,806 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-18 20:30:07,808 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-18 20:30:07,815 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-18 20:30:07,816 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-18 20:30:07,825 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-18 20:30:07,826 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 08:30:07" (1/1) ... [2022-11-18 20:30:07,827 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c8a65be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:30:07, skipping insertion in model container [2022-11-18 20:30:07,827 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 08:30:07" (1/1) ... [2022-11-18 20:30:07,835 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-18 20:30:07,874 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-18 20:30:08,266 WARN L234 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d29f079-78c4-4116-83da-dc1ebb38fecd/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_2.ufo.UNBOUNDED.pals.c[14684,14697] [2022-11-18 20:30:08,270 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 20:30:08,285 INFO L203 MainTranslator]: Completed pre-run [2022-11-18 20:30:08,384 WARN L234 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d29f079-78c4-4116-83da-dc1ebb38fecd/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_2.ufo.UNBOUNDED.pals.c[14684,14697] [2022-11-18 20:30:08,385 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 20:30:08,399 INFO L208 MainTranslator]: Completed translation [2022-11-18 20:30:08,400 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:30:08 WrapperNode [2022-11-18 20:30:08,400 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-18 20:30:08,401 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-18 20:30:08,401 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-18 20:30:08,401 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-18 20:30:08,409 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:30:08" (1/1) ... [2022-11-18 20:30:08,419 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:30:08" (1/1) ... [2022-11-18 20:30:08,455 INFO L138 Inliner]: procedures = 32, calls = 48, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 479 [2022-11-18 20:30:08,456 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-18 20:30:08,457 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-18 20:30:08,457 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-18 20:30:08,457 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-18 20:30:08,466 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:30:08" (1/1) ... [2022-11-18 20:30:08,466 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:30:08" (1/1) ... [2022-11-18 20:30:08,470 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:30:08" (1/1) ... [2022-11-18 20:30:08,470 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:30:08" (1/1) ... [2022-11-18 20:30:08,480 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:30:08" (1/1) ... [2022-11-18 20:30:08,485 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:30:08" (1/1) ... [2022-11-18 20:30:08,488 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:30:08" (1/1) ... [2022-11-18 20:30:08,490 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:30:08" (1/1) ... [2022-11-18 20:30:08,494 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-18 20:30:08,495 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-18 20:30:08,495 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-18 20:30:08,496 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-18 20:30:08,496 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:30:08" (1/1) ... [2022-11-18 20:30:08,502 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 20:30:08,514 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d29f079-78c4-4116-83da-dc1ebb38fecd/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:30:08,528 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d29f079-78c4-4116-83da-dc1ebb38fecd/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-18 20:30:08,565 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d29f079-78c4-4116-83da-dc1ebb38fecd/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-18 20:30:08,594 INFO L130 BoogieDeclarations]: Found specification of procedure read_manual_selection_history [2022-11-18 20:30:08,595 INFO L138 BoogieDeclarations]: Found implementation of procedure read_manual_selection_history [2022-11-18 20:30:08,595 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-18 20:30:08,595 INFO L130 BoogieDeclarations]: Found specification of procedure read_side2_failed_history [2022-11-18 20:30:08,595 INFO L138 BoogieDeclarations]: Found implementation of procedure read_side2_failed_history [2022-11-18 20:30:08,595 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2022-11-18 20:30:08,597 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2022-11-18 20:30:08,597 INFO L130 BoogieDeclarations]: Found specification of procedure flip_the_side [2022-11-18 20:30:08,598 INFO L138 BoogieDeclarations]: Found implementation of procedure flip_the_side [2022-11-18 20:30:08,598 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-11-18 20:30:08,599 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-11-18 20:30:08,599 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-18 20:30:08,599 INFO L130 BoogieDeclarations]: Found specification of procedure read_side1_failed_history [2022-11-18 20:30:08,599 INFO L138 BoogieDeclarations]: Found implementation of procedure read_side1_failed_history [2022-11-18 20:30:08,599 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-18 20:30:08,599 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-18 20:30:08,600 INFO L130 BoogieDeclarations]: Found specification of procedure read_active_side_history [2022-11-18 20:30:08,600 INFO L138 BoogieDeclarations]: Found implementation of procedure read_active_side_history [2022-11-18 20:30:08,752 INFO L235 CfgBuilder]: Building ICFG [2022-11-18 20:30:08,754 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-18 20:30:09,396 INFO L276 CfgBuilder]: Performing block encoding [2022-11-18 20:30:09,405 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-18 20:30:09,405 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-18 20:30:09,408 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:30:09 BoogieIcfgContainer [2022-11-18 20:30:09,408 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-18 20:30:09,414 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-18 20:30:09,414 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-18 20:30:09,418 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-18 20:30:09,418 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 08:30:07" (1/3) ... [2022-11-18 20:30:09,419 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a4e23f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 08:30:09, skipping insertion in model container [2022-11-18 20:30:09,419 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:30:08" (2/3) ... [2022-11-18 20:30:09,420 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a4e23f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 08:30:09, skipping insertion in model container [2022-11-18 20:30:09,420 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:30:09" (3/3) ... [2022-11-18 20:30:09,423 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_STARTPALS_ActiveStandby.4_2.ufo.UNBOUNDED.pals.c [2022-11-18 20:30:09,443 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-18 20:30:09,444 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-18 20:30:09,555 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-18 20:30:09,569 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;@56a2766e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-18 20:30:09,569 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-18 20:30:09,575 INFO L276 IsEmpty]: Start isEmpty. Operand has 180 states, 140 states have (on average 1.5571428571428572) internal successors, (218), 142 states have internal predecessors, (218), 31 states have call successors, (31), 7 states have call predecessors, (31), 7 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2022-11-18 20:30:09,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-18 20:30:09,586 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:30:09,587 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:30:09,587 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:30:09,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:30:09,595 INFO L85 PathProgramCache]: Analyzing trace with hash 1699901086, now seen corresponding path program 1 times [2022-11-18 20:30:09,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:30:09,635 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337832608] [2022-11-18 20:30:09,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:30:09,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:30:09,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:30:09,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-18 20:30:09,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:30:09,936 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:30:09,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:30:09,942 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337832608] [2022-11-18 20:30:09,943 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1337832608] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:30:09,944 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:30:09,945 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-18 20:30:09,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29421132] [2022-11-18 20:30:09,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:30:09,952 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-18 20:30:09,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:30:09,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-18 20:30:09,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-18 20:30:09,998 INFO L87 Difference]: Start difference. First operand has 180 states, 140 states have (on average 1.5571428571428572) internal successors, (218), 142 states have internal predecessors, (218), 31 states have call successors, (31), 7 states have call predecessors, (31), 7 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) Second operand has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-18 20:30:10,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:30:10,076 INFO L93 Difference]: Finished difference Result 340 states and 557 transitions. [2022-11-18 20:30:10,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-18 20:30:10,079 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2022-11-18 20:30:10,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:30:10,091 INFO L225 Difference]: With dead ends: 340 [2022-11-18 20:30:10,091 INFO L226 Difference]: Without dead ends: 176 [2022-11-18 20:30:10,102 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-18 20:30:10,107 INFO L413 NwaCegarLoop]: 273 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-18 20:30:10,116 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 273 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-18 20:30:10,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2022-11-18 20:30:10,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 176. [2022-11-18 20:30:10,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 137 states have (on average 1.5401459854014599) internal successors, (211), 138 states have internal predecessors, (211), 31 states have call successors, (31), 7 states have call predecessors, (31), 7 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2022-11-18 20:30:10,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 273 transitions. [2022-11-18 20:30:10,197 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 273 transitions. Word has length 28 [2022-11-18 20:30:10,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:30:10,198 INFO L495 AbstractCegarLoop]: Abstraction has 176 states and 273 transitions. [2022-11-18 20:30:10,198 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-18 20:30:10,198 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 273 transitions. [2022-11-18 20:30:10,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-18 20:30:10,201 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:30:10,201 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:30:10,201 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-18 20:30:10,211 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:30:10,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:30:10,217 INFO L85 PathProgramCache]: Analyzing trace with hash 1918755804, now seen corresponding path program 1 times [2022-11-18 20:30:10,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:30:10,217 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91504453] [2022-11-18 20:30:10,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:30:10,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:30:10,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:30:10,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-18 20:30:10,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:30:10,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:30:10,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:30:10,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91504453] [2022-11-18 20:30:10,493 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [91504453] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:30:10,493 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:30:10,493 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-18 20:30:10,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30660479] [2022-11-18 20:30:10,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:30:10,495 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-18 20:30:10,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:30:10,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-18 20:30:10,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-18 20:30:10,497 INFO L87 Difference]: Start difference. First operand 176 states and 273 transitions. Second operand has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-18 20:30:10,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:30:10,634 INFO L93 Difference]: Finished difference Result 338 states and 520 transitions. [2022-11-18 20:30:10,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-18 20:30:10,639 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2022-11-18 20:30:10,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:30:10,642 INFO L225 Difference]: With dead ends: 338 [2022-11-18 20:30:10,642 INFO L226 Difference]: Without dead ends: 176 [2022-11-18 20:30:10,648 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-11-18 20:30:10,649 INFO L413 NwaCegarLoop]: 269 mSDtfsCounter, 137 mSDsluCounter, 891 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 1160 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-18 20:30:10,650 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 1160 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-18 20:30:10,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2022-11-18 20:30:10,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 176. [2022-11-18 20:30:10,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 137 states have (on average 1.4525547445255473) internal successors, (199), 138 states have internal predecessors, (199), 31 states have call successors, (31), 7 states have call predecessors, (31), 7 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2022-11-18 20:30:10,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 261 transitions. [2022-11-18 20:30:10,673 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 261 transitions. Word has length 28 [2022-11-18 20:30:10,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:30:10,674 INFO L495 AbstractCegarLoop]: Abstraction has 176 states and 261 transitions. [2022-11-18 20:30:10,674 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-18 20:30:10,674 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 261 transitions. [2022-11-18 20:30:10,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-11-18 20:30:10,675 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:30:10,676 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:30:10,676 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-18 20:30:10,676 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:30:10,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:30:10,677 INFO L85 PathProgramCache]: Analyzing trace with hash 1355709569, now seen corresponding path program 1 times [2022-11-18 20:30:10,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:30:10,678 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186817761] [2022-11-18 20:30:10,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:30:10,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:30:10,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:30:11,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-18 20:30:11,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:30:11,052 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:30:11,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:30:11,054 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186817761] [2022-11-18 20:30:11,055 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [186817761] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:30:11,055 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:30:11,055 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-18 20:30:11,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047857244] [2022-11-18 20:30:11,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:30:11,056 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 20:30:11,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:30:11,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 20:30:11,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-18 20:30:11,057 INFO L87 Difference]: Start difference. First operand 176 states and 261 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 3 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-18 20:30:11,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:30:11,155 INFO L93 Difference]: Finished difference Result 339 states and 512 transitions. [2022-11-18 20:30:11,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-18 20:30:11,155 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 3 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 39 [2022-11-18 20:30:11,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:30:11,162 INFO L225 Difference]: With dead ends: 339 [2022-11-18 20:30:11,162 INFO L226 Difference]: Without dead ends: 180 [2022-11-18 20:30:11,164 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-18 20:30:11,169 INFO L413 NwaCegarLoop]: 255 mSDtfsCounter, 5 mSDsluCounter, 500 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 755 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 20:30:11,170 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 755 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 20:30:11,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2022-11-18 20:30:11,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 180. [2022-11-18 20:30:11,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 140 states have (on average 1.4428571428571428) internal successors, (202), 141 states have internal predecessors, (202), 31 states have call successors, (31), 8 states have call predecessors, (31), 8 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2022-11-18 20:30:11,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 264 transitions. [2022-11-18 20:30:11,215 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 264 transitions. Word has length 39 [2022-11-18 20:30:11,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:30:11,215 INFO L495 AbstractCegarLoop]: Abstraction has 180 states and 264 transitions. [2022-11-18 20:30:11,216 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 3 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-18 20:30:11,216 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 264 transitions. [2022-11-18 20:30:11,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-11-18 20:30:11,217 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:30:11,218 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:30:11,218 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-18 20:30:11,218 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:30:11,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:30:11,219 INFO L85 PathProgramCache]: Analyzing trace with hash -2086587661, now seen corresponding path program 1 times [2022-11-18 20:30:11,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:30:11,219 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789100390] [2022-11-18 20:30:11,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:30:11,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:30:11,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:30:11,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-18 20:30:11,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:30:11,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-18 20:30:11,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:30:11,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-11-18 20:30:11,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:30:11,363 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-18 20:30:11,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:30:11,364 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789100390] [2022-11-18 20:30:11,364 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [789100390] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:30:11,364 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:30:11,364 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-18 20:30:11,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705029326] [2022-11-18 20:30:11,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:30:11,366 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 20:30:11,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:30:11,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 20:30:11,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 20:30:11,369 INFO L87 Difference]: Start difference. First operand 180 states and 264 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-18 20:30:11,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:30:11,445 INFO L93 Difference]: Finished difference Result 494 states and 735 transitions. [2022-11-18 20:30:11,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 20:30:11,446 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 55 [2022-11-18 20:30:11,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:30:11,449 INFO L225 Difference]: With dead ends: 494 [2022-11-18 20:30:11,449 INFO L226 Difference]: Without dead ends: 331 [2022-11-18 20:30:11,450 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 20:30:11,461 INFO L413 NwaCegarLoop]: 300 mSDtfsCounter, 212 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 552 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-18 20:30:11,462 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [212 Valid, 552 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-18 20:30:11,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2022-11-18 20:30:11,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 326. [2022-11-18 20:30:11,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 326 states, 249 states have (on average 1.461847389558233) internal successors, (364), 251 states have internal predecessors, (364), 60 states have call successors, (60), 16 states have call predecessors, (60), 16 states have return successors, (60), 59 states have call predecessors, (60), 60 states have call successors, (60) [2022-11-18 20:30:11,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 484 transitions. [2022-11-18 20:30:11,530 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 484 transitions. Word has length 55 [2022-11-18 20:30:11,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:30:11,530 INFO L495 AbstractCegarLoop]: Abstraction has 326 states and 484 transitions. [2022-11-18 20:30:11,531 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-18 20:30:11,531 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 484 transitions. [2022-11-18 20:30:11,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-11-18 20:30:11,533 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:30:11,533 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:30:11,533 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-18 20:30:11,534 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:30:11,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:30:11,534 INFO L85 PathProgramCache]: Analyzing trace with hash 651939805, now seen corresponding path program 1 times [2022-11-18 20:30:11,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:30:11,535 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713364440] [2022-11-18 20:30:11,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:30:11,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:30:11,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:30:11,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-18 20:30:11,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:30:11,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-18 20:30:11,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:30:11,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-18 20:30:11,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:30:11,644 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-18 20:30:11,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:30:11,645 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713364440] [2022-11-18 20:30:11,646 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [713364440] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:30:11,646 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:30:11,647 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-18 20:30:11,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752300802] [2022-11-18 20:30:11,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:30:11,654 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 20:30:11,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:30:11,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 20:30:11,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 20:30:11,655 INFO L87 Difference]: Start difference. First operand 326 states and 484 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-18 20:30:11,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:30:11,744 INFO L93 Difference]: Finished difference Result 917 states and 1373 transitions. [2022-11-18 20:30:11,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 20:30:11,745 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 56 [2022-11-18 20:30:11,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:30:11,755 INFO L225 Difference]: With dead ends: 917 [2022-11-18 20:30:11,755 INFO L226 Difference]: Without dead ends: 608 [2022-11-18 20:30:11,757 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 20:30:11,758 INFO L413 NwaCegarLoop]: 319 mSDtfsCounter, 214 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 573 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-18 20:30:11,758 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 573 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-18 20:30:11,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2022-11-18 20:30:11,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 602. [2022-11-18 20:30:11,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 602 states, 453 states have (on average 1.4724061810154525) internal successors, (667), 457 states have internal predecessors, (667), 117 states have call successors, (117), 31 states have call predecessors, (117), 31 states have return successors, (117), 114 states have call predecessors, (117), 117 states have call successors, (117) [2022-11-18 20:30:11,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 901 transitions. [2022-11-18 20:30:11,848 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 901 transitions. Word has length 56 [2022-11-18 20:30:11,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:30:11,849 INFO L495 AbstractCegarLoop]: Abstraction has 602 states and 901 transitions. [2022-11-18 20:30:11,849 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-18 20:30:11,849 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 901 transitions. [2022-11-18 20:30:11,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-11-18 20:30:11,851 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:30:11,851 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:30:11,852 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-18 20:30:11,852 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:30:11,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:30:11,853 INFO L85 PathProgramCache]: Analyzing trace with hash -627923873, now seen corresponding path program 1 times [2022-11-18 20:30:11,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:30:11,853 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151876489] [2022-11-18 20:30:11,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:30:11,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:30:11,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:30:11,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-18 20:30:11,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:30:12,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-18 20:30:12,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:30:12,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-18 20:30:12,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:30:12,015 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-18 20:30:12,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:30:12,016 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151876489] [2022-11-18 20:30:12,016 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [151876489] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:30:12,016 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:30:12,017 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-18 20:30:12,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731972592] [2022-11-18 20:30:12,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:30:12,019 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-18 20:30:12,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:30:12,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-18 20:30:12,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-18 20:30:12,020 INFO L87 Difference]: Start difference. First operand 602 states and 901 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-18 20:30:12,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:30:12,454 INFO L93 Difference]: Finished difference Result 1639 states and 2507 transitions. [2022-11-18 20:30:12,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-18 20:30:12,455 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 56 [2022-11-18 20:30:12,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:30:12,465 INFO L225 Difference]: With dead ends: 1639 [2022-11-18 20:30:12,465 INFO L226 Difference]: Without dead ends: 1054 [2022-11-18 20:30:12,468 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-11-18 20:30:12,469 INFO L413 NwaCegarLoop]: 246 mSDtfsCounter, 633 mSDsluCounter, 445 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 633 SdHoareTripleChecker+Valid, 691 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-18 20:30:12,469 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [633 Valid, 691 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-18 20:30:12,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1054 states. [2022-11-18 20:30:12,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1054 to 690. [2022-11-18 20:30:12,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 690 states, 528 states have (on average 1.456439393939394) internal successors, (769), 531 states have internal predecessors, (769), 124 states have call successors, (124), 37 states have call predecessors, (124), 37 states have return successors, (124), 121 states have call predecessors, (124), 124 states have call successors, (124) [2022-11-18 20:30:12,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 690 states to 690 states and 1017 transitions. [2022-11-18 20:30:12,598 INFO L78 Accepts]: Start accepts. Automaton has 690 states and 1017 transitions. Word has length 56 [2022-11-18 20:30:12,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:30:12,599 INFO L495 AbstractCegarLoop]: Abstraction has 690 states and 1017 transitions. [2022-11-18 20:30:12,599 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-18 20:30:12,599 INFO L276 IsEmpty]: Start isEmpty. Operand 690 states and 1017 transitions. [2022-11-18 20:30:12,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-11-18 20:30:12,601 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:30:12,601 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:30:12,602 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-18 20:30:12,602 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:30:12,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:30:12,602 INFO L85 PathProgramCache]: Analyzing trace with hash 707313810, now seen corresponding path program 1 times [2022-11-18 20:30:12,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:30:12,603 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277731772] [2022-11-18 20:30:12,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:30:12,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:30:12,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:30:12,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-18 20:30:12,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:30:12,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-18 20:30:12,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:30:12,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-18 20:30:12,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:30:12,798 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-18 20:30:12,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:30:12,799 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277731772] [2022-11-18 20:30:12,799 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [277731772] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:30:12,799 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:30:12,799 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-18 20:30:12,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743500825] [2022-11-18 20:30:12,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:30:12,801 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-18 20:30:12,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:30:12,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-18 20:30:12,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-18 20:30:12,802 INFO L87 Difference]: Start difference. First operand 690 states and 1017 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-18 20:30:13,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:30:13,251 INFO L93 Difference]: Finished difference Result 1643 states and 2507 transitions. [2022-11-18 20:30:13,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-18 20:30:13,252 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 57 [2022-11-18 20:30:13,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:30:13,259 INFO L225 Difference]: With dead ends: 1643 [2022-11-18 20:30:13,259 INFO L226 Difference]: Without dead ends: 1058 [2022-11-18 20:30:13,262 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-11-18 20:30:13,263 INFO L413 NwaCegarLoop]: 246 mSDtfsCounter, 630 mSDsluCounter, 447 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 630 SdHoareTripleChecker+Valid, 693 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-18 20:30:13,263 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [630 Valid, 693 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-18 20:30:13,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1058 states. [2022-11-18 20:30:13,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1058 to 698. [2022-11-18 20:30:13,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 698 states, 536 states have (on average 1.4496268656716418) internal successors, (777), 539 states have internal predecessors, (777), 124 states have call successors, (124), 37 states have call predecessors, (124), 37 states have return successors, (124), 121 states have call predecessors, (124), 124 states have call successors, (124) [2022-11-18 20:30:13,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 698 states to 698 states and 1025 transitions. [2022-11-18 20:30:13,393 INFO L78 Accepts]: Start accepts. Automaton has 698 states and 1025 transitions. Word has length 57 [2022-11-18 20:30:13,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:30:13,394 INFO L495 AbstractCegarLoop]: Abstraction has 698 states and 1025 transitions. [2022-11-18 20:30:13,394 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-18 20:30:13,394 INFO L276 IsEmpty]: Start isEmpty. Operand 698 states and 1025 transitions. [2022-11-18 20:30:13,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-11-18 20:30:13,395 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:30:13,396 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:30:13,396 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-18 20:30:13,396 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:30:13,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:30:13,397 INFO L85 PathProgramCache]: Analyzing trace with hash -1187610108, now seen corresponding path program 1 times [2022-11-18 20:30:13,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:30:13,398 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481109813] [2022-11-18 20:30:13,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:30:13,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:30:13,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:30:13,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-18 20:30:13,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:30:13,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-18 20:30:13,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:30:13,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-18 20:30:13,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:30:13,528 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-18 20:30:13,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:30:13,528 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481109813] [2022-11-18 20:30:13,528 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481109813] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:30:13,528 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:30:13,529 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-18 20:30:13,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320096145] [2022-11-18 20:30:13,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:30:13,529 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 20:30:13,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:30:13,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 20:30:13,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-18 20:30:13,530 INFO L87 Difference]: Start difference. First operand 698 states and 1025 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-18 20:30:13,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:30:13,958 INFO L93 Difference]: Finished difference Result 1643 states and 2499 transitions. [2022-11-18 20:30:13,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-18 20:30:13,959 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 59 [2022-11-18 20:30:13,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:30:13,967 INFO L225 Difference]: With dead ends: 1643 [2022-11-18 20:30:13,968 INFO L226 Difference]: Without dead ends: 1058 [2022-11-18 20:30:13,970 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-18 20:30:13,970 INFO L413 NwaCegarLoop]: 272 mSDtfsCounter, 186 mSDsluCounter, 388 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 660 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-18 20:30:13,971 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 660 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-18 20:30:13,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1058 states. [2022-11-18 20:30:14,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1058 to 698. [2022-11-18 20:30:14,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 698 states, 536 states have (on average 1.4421641791044777) internal successors, (773), 539 states have internal predecessors, (773), 124 states have call successors, (124), 37 states have call predecessors, (124), 37 states have return successors, (124), 121 states have call predecessors, (124), 124 states have call successors, (124) [2022-11-18 20:30:14,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 698 states to 698 states and 1021 transitions. [2022-11-18 20:30:14,069 INFO L78 Accepts]: Start accepts. Automaton has 698 states and 1021 transitions. Word has length 59 [2022-11-18 20:30:14,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:30:14,069 INFO L495 AbstractCegarLoop]: Abstraction has 698 states and 1021 transitions. [2022-11-18 20:30:14,069 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-18 20:30:14,070 INFO L276 IsEmpty]: Start isEmpty. Operand 698 states and 1021 transitions. [2022-11-18 20:30:14,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-11-18 20:30:14,072 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:30:14,072 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:30:14,072 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-18 20:30:14,073 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:30:14,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:30:14,073 INFO L85 PathProgramCache]: Analyzing trace with hash -1980797779, now seen corresponding path program 1 times [2022-11-18 20:30:14,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:30:14,074 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358000326] [2022-11-18 20:30:14,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:30:14,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:30:14,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:30:14,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-18 20:30:14,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:30:14,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-18 20:30:14,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:30:14,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-11-18 20:30:14,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:30:14,317 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-18 20:30:14,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:30:14,317 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358000326] [2022-11-18 20:30:14,317 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1358000326] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:30:14,318 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:30:14,318 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-18 20:30:14,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551661998] [2022-11-18 20:30:14,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:30:14,319 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 20:30:14,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:30:14,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 20:30:14,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-18 20:30:14,320 INFO L87 Difference]: Start difference. First operand 698 states and 1021 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 3 states have internal predecessors, (49), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-18 20:30:14,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:30:14,434 INFO L93 Difference]: Finished difference Result 1303 states and 1932 transitions. [2022-11-18 20:30:14,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-18 20:30:14,434 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 3 states have internal predecessors, (49), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 60 [2022-11-18 20:30:14,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:30:14,439 INFO L225 Difference]: With dead ends: 1303 [2022-11-18 20:30:14,439 INFO L226 Difference]: Without dead ends: 718 [2022-11-18 20:30:14,441 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-18 20:30:14,444 INFO L413 NwaCegarLoop]: 257 mSDtfsCounter, 6 mSDsluCounter, 510 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 767 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-18 20:30:14,444 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 767 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-18 20:30:14,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 718 states. [2022-11-18 20:30:14,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 718 to 718. [2022-11-18 20:30:14,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 718 states, 552 states have (on average 1.4293478260869565) internal successors, (789), 555 states have internal predecessors, (789), 124 states have call successors, (124), 41 states have call predecessors, (124), 41 states have return successors, (124), 121 states have call predecessors, (124), 124 states have call successors, (124) [2022-11-18 20:30:14,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 718 states to 718 states and 1037 transitions. [2022-11-18 20:30:14,534 INFO L78 Accepts]: Start accepts. Automaton has 718 states and 1037 transitions. Word has length 60 [2022-11-18 20:30:14,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:30:14,535 INFO L495 AbstractCegarLoop]: Abstraction has 718 states and 1037 transitions. [2022-11-18 20:30:14,535 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 3 states have internal predecessors, (49), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-18 20:30:14,535 INFO L276 IsEmpty]: Start isEmpty. Operand 718 states and 1037 transitions. [2022-11-18 20:30:14,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-11-18 20:30:14,536 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:30:14,537 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:30:14,537 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-18 20:30:14,537 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:30:14,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:30:14,538 INFO L85 PathProgramCache]: Analyzing trace with hash 1474712019, now seen corresponding path program 1 times [2022-11-18 20:30:14,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:30:14,538 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617939921] [2022-11-18 20:30:14,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:30:14,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:30:14,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:30:14,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-18 20:30:14,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:30:14,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-18 20:30:14,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:30:14,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-11-18 20:30:14,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:30:14,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-18 20:30:14,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:30:14,716 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-18 20:30:14,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:30:14,717 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617939921] [2022-11-18 20:30:14,717 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [617939921] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:30:14,717 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:30:14,717 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-18 20:30:14,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849976357] [2022-11-18 20:30:14,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:30:14,718 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 20:30:14,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:30:14,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 20:30:14,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-18 20:30:14,719 INFO L87 Difference]: Start difference. First operand 718 states and 1037 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 3 states have internal predecessors, (55), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-18 20:30:14,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:30:14,848 INFO L93 Difference]: Finished difference Result 1343 states and 1976 transitions. [2022-11-18 20:30:14,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-18 20:30:14,849 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 3 states have internal predecessors, (55), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 68 [2022-11-18 20:30:14,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:30:14,853 INFO L225 Difference]: With dead ends: 1343 [2022-11-18 20:30:14,854 INFO L226 Difference]: Without dead ends: 738 [2022-11-18 20:30:14,856 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-18 20:30:14,857 INFO L413 NwaCegarLoop]: 254 mSDtfsCounter, 6 mSDsluCounter, 499 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 753 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-18 20:30:14,857 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 753 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-18 20:30:14,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 738 states. [2022-11-18 20:30:14,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 738 to 738. [2022-11-18 20:30:14,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 738 states, 568 states have (on average 1.4172535211267605) internal successors, (805), 571 states have internal predecessors, (805), 124 states have call successors, (124), 45 states have call predecessors, (124), 45 states have return successors, (124), 121 states have call predecessors, (124), 124 states have call successors, (124) [2022-11-18 20:30:14,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 738 states to 738 states and 1053 transitions. [2022-11-18 20:30:14,969 INFO L78 Accepts]: Start accepts. Automaton has 738 states and 1053 transitions. Word has length 68 [2022-11-18 20:30:14,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:30:14,969 INFO L495 AbstractCegarLoop]: Abstraction has 738 states and 1053 transitions. [2022-11-18 20:30:14,969 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 3 states have internal predecessors, (55), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-18 20:30:14,970 INFO L276 IsEmpty]: Start isEmpty. Operand 738 states and 1053 transitions. [2022-11-18 20:30:14,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-11-18 20:30:14,971 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:30:14,971 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:30:14,972 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-18 20:30:14,972 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:30:14,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:30:14,972 INFO L85 PathProgramCache]: Analyzing trace with hash -799213667, now seen corresponding path program 1 times [2022-11-18 20:30:14,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:30:14,973 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895848861] [2022-11-18 20:30:14,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:30:14,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:30:14,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:30:15,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-18 20:30:15,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:30:15,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-18 20:30:15,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:30:15,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-11-18 20:30:15,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:30:15,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-18 20:30:15,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:30:15,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-11-18 20:30:15,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:30:15,130 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-18 20:30:15,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:30:15,130 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895848861] [2022-11-18 20:30:15,130 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [895848861] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:30:15,130 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:30:15,131 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-18 20:30:15,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157924213] [2022-11-18 20:30:15,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:30:15,131 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 20:30:15,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:30:15,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 20:30:15,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-18 20:30:15,132 INFO L87 Difference]: Start difference. First operand 738 states and 1053 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 3 states have internal predecessors, (61), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-11-18 20:30:15,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:30:15,245 INFO L93 Difference]: Finished difference Result 1379 states and 1992 transitions. [2022-11-18 20:30:15,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-18 20:30:15,246 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 3 states have internal predecessors, (61), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 76 [2022-11-18 20:30:15,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:30:15,249 INFO L225 Difference]: With dead ends: 1379 [2022-11-18 20:30:15,250 INFO L226 Difference]: Without dead ends: 754 [2022-11-18 20:30:15,251 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-18 20:30:15,252 INFO L413 NwaCegarLoop]: 259 mSDtfsCounter, 5 mSDsluCounter, 503 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 762 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-18 20:30:15,252 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 762 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-18 20:30:15,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 754 states. [2022-11-18 20:30:15,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 754 to 754. [2022-11-18 20:30:15,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 754 states, 580 states have (on average 1.4086206896551725) internal successors, (817), 583 states have internal predecessors, (817), 124 states have call successors, (124), 49 states have call predecessors, (124), 49 states have return successors, (124), 121 states have call predecessors, (124), 124 states have call successors, (124) [2022-11-18 20:30:15,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 754 states to 754 states and 1065 transitions. [2022-11-18 20:30:15,354 INFO L78 Accepts]: Start accepts. Automaton has 754 states and 1065 transitions. Word has length 76 [2022-11-18 20:30:15,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:30:15,354 INFO L495 AbstractCegarLoop]: Abstraction has 754 states and 1065 transitions. [2022-11-18 20:30:15,355 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 3 states have internal predecessors, (61), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-11-18 20:30:15,355 INFO L276 IsEmpty]: Start isEmpty. Operand 754 states and 1065 transitions. [2022-11-18 20:30:15,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-11-18 20:30:15,356 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:30:15,356 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:30:15,356 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-18 20:30:15,357 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:30:15,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:30:15,357 INFO L85 PathProgramCache]: Analyzing trace with hash 1597245636, now seen corresponding path program 1 times [2022-11-18 20:30:15,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:30:15,358 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706924201] [2022-11-18 20:30:15,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:30:15,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:30:15,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:30:15,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-18 20:30:15,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:30:15,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-18 20:30:15,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:30:15,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-11-18 20:30:15,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:30:15,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-18 20:30:15,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:30:15,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-11-18 20:30:15,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:30:15,538 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-18 20:30:15,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:30:15,538 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706924201] [2022-11-18 20:30:15,538 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1706924201] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:30:15,538 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:30:15,539 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-18 20:30:15,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055500281] [2022-11-18 20:30:15,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:30:15,539 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 20:30:15,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:30:15,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 20:30:15,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-18 20:30:15,540 INFO L87 Difference]: Start difference. First operand 754 states and 1065 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 3 states have internal predecessors, (61), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-11-18 20:30:15,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:30:15,655 INFO L93 Difference]: Finished difference Result 1415 states and 2032 transitions. [2022-11-18 20:30:15,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-18 20:30:15,656 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 3 states have internal predecessors, (61), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 76 [2022-11-18 20:30:15,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:30:15,660 INFO L225 Difference]: With dead ends: 1415 [2022-11-18 20:30:15,660 INFO L226 Difference]: Without dead ends: 774 [2022-11-18 20:30:15,662 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-18 20:30:15,663 INFO L413 NwaCegarLoop]: 254 mSDtfsCounter, 6 mSDsluCounter, 499 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 753 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-18 20:30:15,663 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 753 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-18 20:30:15,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 774 states. [2022-11-18 20:30:15,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 774 to 774. [2022-11-18 20:30:15,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 774 states, 596 states have (on average 1.3976510067114094) internal successors, (833), 599 states have internal predecessors, (833), 124 states have call successors, (124), 53 states have call predecessors, (124), 53 states have return successors, (124), 121 states have call predecessors, (124), 124 states have call successors, (124) [2022-11-18 20:30:15,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 774 states to 774 states and 1081 transitions. [2022-11-18 20:30:15,770 INFO L78 Accepts]: Start accepts. Automaton has 774 states and 1081 transitions. Word has length 76 [2022-11-18 20:30:15,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:30:15,771 INFO L495 AbstractCegarLoop]: Abstraction has 774 states and 1081 transitions. [2022-11-18 20:30:15,771 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 3 states have internal predecessors, (61), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-11-18 20:30:15,771 INFO L276 IsEmpty]: Start isEmpty. Operand 774 states and 1081 transitions. [2022-11-18 20:30:15,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-11-18 20:30:15,774 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:30:15,774 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:30:15,774 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-18 20:30:15,775 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:30:15,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:30:15,776 INFO L85 PathProgramCache]: Analyzing trace with hash 837268772, now seen corresponding path program 1 times [2022-11-18 20:30:15,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:30:15,777 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535266207] [2022-11-18 20:30:15,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:30:15,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:30:15,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:30:16,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-18 20:30:16,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:30:16,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-18 20:30:16,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:30:16,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-11-18 20:30:16,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:30:16,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-18 20:30:16,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:30:16,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-11-18 20:30:16,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:30:16,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-11-18 20:30:16,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:30:16,047 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-18 20:30:16,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:30:16,047 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535266207] [2022-11-18 20:30:16,047 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1535266207] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:30:16,048 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:30:16,048 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-18 20:30:16,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671762011] [2022-11-18 20:30:16,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:30:16,049 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 20:30:16,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:30:16,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 20:30:16,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-18 20:30:16,049 INFO L87 Difference]: Start difference. First operand 774 states and 1081 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 2 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-11-18 20:30:16,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:30:16,153 INFO L93 Difference]: Finished difference Result 1459 states and 2060 transitions. [2022-11-18 20:30:16,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-18 20:30:16,154 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 2 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 84 [2022-11-18 20:30:16,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:30:16,160 INFO L225 Difference]: With dead ends: 1459 [2022-11-18 20:30:16,160 INFO L226 Difference]: Without dead ends: 798 [2022-11-18 20:30:16,162 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-18 20:30:16,163 INFO L413 NwaCegarLoop]: 258 mSDtfsCounter, 7 mSDsluCounter, 506 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 764 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-18 20:30:16,163 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 764 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-18 20:30:16,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 798 states. [2022-11-18 20:30:16,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 798 to 798. [2022-11-18 20:30:16,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 798 states, 616 states have (on average 1.3847402597402598) internal successors, (853), 619 states have internal predecessors, (853), 124 states have call successors, (124), 57 states have call predecessors, (124), 57 states have return successors, (124), 121 states have call predecessors, (124), 124 states have call successors, (124) [2022-11-18 20:30:16,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 798 states to 798 states and 1101 transitions. [2022-11-18 20:30:16,245 INFO L78 Accepts]: Start accepts. Automaton has 798 states and 1101 transitions. Word has length 84 [2022-11-18 20:30:16,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:30:16,246 INFO L495 AbstractCegarLoop]: Abstraction has 798 states and 1101 transitions. [2022-11-18 20:30:16,246 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 2 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-11-18 20:30:16,246 INFO L276 IsEmpty]: Start isEmpty. Operand 798 states and 1101 transitions. [2022-11-18 20:30:16,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-11-18 20:30:16,249 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:30:16,249 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:30:16,250 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-18 20:30:16,250 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:30:16,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:30:16,250 INFO L85 PathProgramCache]: Analyzing trace with hash 1610117125, now seen corresponding path program 1 times [2022-11-18 20:30:16,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:30:16,251 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40523874] [2022-11-18 20:30:16,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:30:16,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:30:16,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:30:16,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-18 20:30:16,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:30:16,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-18 20:30:16,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:30:16,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-11-18 20:30:16,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:30:16,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-18 20:30:16,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:30:16,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-11-18 20:30:16,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:30:16,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-11-18 20:30:16,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:30:16,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-11-18 20:30:16,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:30:16,576 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-18 20:30:16,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:30:16,576 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40523874] [2022-11-18 20:30:16,576 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [40523874] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:30:16,577 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:30:16,577 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-18 20:30:16,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799042385] [2022-11-18 20:30:16,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:30:16,577 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-18 20:30:16,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:30:16,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-18 20:30:16,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-18 20:30:16,579 INFO L87 Difference]: Start difference. First operand 798 states and 1101 transitions. Second operand has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 6 states have internal predecessors, (66), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2022-11-18 20:30:17,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:30:17,018 INFO L93 Difference]: Finished difference Result 2313 states and 3243 transitions. [2022-11-18 20:30:17,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-18 20:30:17,018 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 6 states have internal predecessors, (66), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) Word has length 87 [2022-11-18 20:30:17,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:30:17,026 INFO L225 Difference]: With dead ends: 2313 [2022-11-18 20:30:17,027 INFO L226 Difference]: Without dead ends: 1628 [2022-11-18 20:30:17,029 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-11-18 20:30:17,029 INFO L413 NwaCegarLoop]: 349 mSDtfsCounter, 324 mSDsluCounter, 1570 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 342 SdHoareTripleChecker+Valid, 1919 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-18 20:30:17,030 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [342 Valid, 1919 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-18 20:30:17,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1628 states. [2022-11-18 20:30:17,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1628 to 1082. [2022-11-18 20:30:17,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1082 states, 827 states have (on average 1.3724304715840387) internal successors, (1135), 832 states have internal predecessors, (1135), 172 states have call successors, (172), 82 states have call predecessors, (172), 82 states have return successors, (172), 167 states have call predecessors, (172), 172 states have call successors, (172) [2022-11-18 20:30:17,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1082 states to 1082 states and 1479 transitions. [2022-11-18 20:30:17,213 INFO L78 Accepts]: Start accepts. Automaton has 1082 states and 1479 transitions. Word has length 87 [2022-11-18 20:30:17,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:30:17,214 INFO L495 AbstractCegarLoop]: Abstraction has 1082 states and 1479 transitions. [2022-11-18 20:30:17,214 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 6 states have internal predecessors, (66), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2022-11-18 20:30:17,214 INFO L276 IsEmpty]: Start isEmpty. Operand 1082 states and 1479 transitions. [2022-11-18 20:30:17,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-11-18 20:30:17,215 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:30:17,216 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:30:17,216 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-18 20:30:17,216 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:30:17,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:30:17,217 INFO L85 PathProgramCache]: Analyzing trace with hash 1820782171, now seen corresponding path program 1 times [2022-11-18 20:30:17,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:30:17,217 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051917844] [2022-11-18 20:30:17,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:30:17,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:30:17,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:30:17,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-18 20:30:17,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:30:17,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-18 20:30:17,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:30:17,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-11-18 20:30:17,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:30:17,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-18 20:30:17,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:30:17,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-11-18 20:30:17,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:30:17,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-11-18 20:30:17,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:30:17,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-11-18 20:30:17,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:30:17,400 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-18 20:30:17,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:30:17,400 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051917844] [2022-11-18 20:30:17,400 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051917844] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:30:17,401 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:30:17,401 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-18 20:30:17,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110746467] [2022-11-18 20:30:17,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:30:17,401 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 20:30:17,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:30:17,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 20:30:17,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-18 20:30:17,402 INFO L87 Difference]: Start difference. First operand 1082 states and 1479 transitions. Second operand has 4 states, 4 states have (on average 17.5) internal successors, (70), 3 states have internal predecessors, (70), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-11-18 20:30:17,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:30:17,561 INFO L93 Difference]: Finished difference Result 2007 states and 2768 transitions. [2022-11-18 20:30:17,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-18 20:30:17,562 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 3 states have internal predecessors, (70), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 91 [2022-11-18 20:30:17,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:30:17,567 INFO L225 Difference]: With dead ends: 2007 [2022-11-18 20:30:17,567 INFO L226 Difference]: Without dead ends: 1106 [2022-11-18 20:30:17,571 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-18 20:30:17,572 INFO L413 NwaCegarLoop]: 259 mSDtfsCounter, 5 mSDsluCounter, 503 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 762 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-18 20:30:17,573 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 762 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-18 20:30:17,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1106 states. [2022-11-18 20:30:17,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1106 to 1106. [2022-11-18 20:30:17,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1106 states, 845 states have (on average 1.3644970414201183) internal successors, (1153), 850 states have internal predecessors, (1153), 172 states have call successors, (172), 88 states have call predecessors, (172), 88 states have return successors, (172), 167 states have call predecessors, (172), 172 states have call successors, (172) [2022-11-18 20:30:17,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1106 states to 1106 states and 1497 transitions. [2022-11-18 20:30:17,712 INFO L78 Accepts]: Start accepts. Automaton has 1106 states and 1497 transitions. Word has length 91 [2022-11-18 20:30:17,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:30:17,712 INFO L495 AbstractCegarLoop]: Abstraction has 1106 states and 1497 transitions. [2022-11-18 20:30:17,712 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 3 states have internal predecessors, (70), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-11-18 20:30:17,712 INFO L276 IsEmpty]: Start isEmpty. Operand 1106 states and 1497 transitions. [2022-11-18 20:30:17,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2022-11-18 20:30:17,716 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:30:17,717 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:30:17,717 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-18 20:30:17,717 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:30:17,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:30:17,718 INFO L85 PathProgramCache]: Analyzing trace with hash 1723609181, now seen corresponding path program 1 times [2022-11-18 20:30:17,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:30:17,718 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470518633] [2022-11-18 20:30:17,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:30:17,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:30:17,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:30:18,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-18 20:30:18,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:30:18,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-18 20:30:18,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:30:18,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-11-18 20:30:18,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:30:18,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-18 20:30:18,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:30:18,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-11-18 20:30:18,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:30:18,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-11-18 20:30:18,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:30:18,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-11-18 20:30:18,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:30:18,044 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-11-18 20:30:18,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:30:18,045 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470518633] [2022-11-18 20:30:18,047 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1470518633] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:30:18,047 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:30:18,047 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-18 20:30:18,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682398476] [2022-11-18 20:30:18,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:30:18,048 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-18 20:30:18,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:30:18,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-18 20:30:18,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-18 20:30:18,049 INFO L87 Difference]: Start difference. First operand 1106 states and 1497 transitions. Second operand has 8 states, 6 states have (on average 11.0) internal successors, (66), 7 states have internal predecessors, (66), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) [2022-11-18 20:30:18,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:30:18,523 INFO L93 Difference]: Finished difference Result 1536 states and 2187 transitions. [2022-11-18 20:30:18,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-18 20:30:18,523 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 11.0) internal successors, (66), 7 states have internal predecessors, (66), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) Word has length 90 [2022-11-18 20:30:18,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:30:18,531 INFO L225 Difference]: With dead ends: 1536 [2022-11-18 20:30:18,532 INFO L226 Difference]: Without dead ends: 1534 [2022-11-18 20:30:18,533 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2022-11-18 20:30:18,534 INFO L413 NwaCegarLoop]: 446 mSDtfsCounter, 329 mSDsluCounter, 2086 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 355 SdHoareTripleChecker+Valid, 2532 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 20:30:18,535 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [355 Valid, 2532 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 20:30:18,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1534 states. [2022-11-18 20:30:18,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1534 to 1114. [2022-11-18 20:30:18,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1114 states, 849 states have (on average 1.3627797408716136) internal successors, (1157), 856 states have internal predecessors, (1157), 174 states have call successors, (174), 90 states have call predecessors, (174), 90 states have return successors, (174), 167 states have call predecessors, (174), 174 states have call successors, (174) [2022-11-18 20:30:18,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1114 states to 1114 states and 1505 transitions. [2022-11-18 20:30:18,709 INFO L78 Accepts]: Start accepts. Automaton has 1114 states and 1505 transitions. Word has length 90 [2022-11-18 20:30:18,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:30:18,710 INFO L495 AbstractCegarLoop]: Abstraction has 1114 states and 1505 transitions. [2022-11-18 20:30:18,710 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 11.0) internal successors, (66), 7 states have internal predecessors, (66), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) [2022-11-18 20:30:18,710 INFO L276 IsEmpty]: Start isEmpty. Operand 1114 states and 1505 transitions. [2022-11-18 20:30:18,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-11-18 20:30:18,712 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:30:18,712 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:30:18,712 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-18 20:30:18,713 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:30:18,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:30:18,713 INFO L85 PathProgramCache]: Analyzing trace with hash 2094931668, now seen corresponding path program 1 times [2022-11-18 20:30:18,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:30:18,714 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909957128] [2022-11-18 20:30:18,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:30:18,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:30:18,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:30:18,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-18 20:30:18,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:30:18,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-18 20:30:18,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:30:18,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-11-18 20:30:18,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:30:18,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-18 20:30:18,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:30:18,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-11-18 20:30:18,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:30:18,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-11-18 20:30:18,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:30:18,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-11-18 20:30:18,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:30:18,893 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-11-18 20:30:18,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:30:18,894 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909957128] [2022-11-18 20:30:18,894 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1909957128] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:30:18,894 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:30:18,894 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-18 20:30:18,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045427373] [2022-11-18 20:30:18,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:30:18,895 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-18 20:30:18,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:30:18,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-18 20:30:18,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-18 20:30:18,896 INFO L87 Difference]: Start difference. First operand 1114 states and 1505 transitions. Second operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 6 states have internal predecessors, (69), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-11-18 20:30:19,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:30:19,312 INFO L93 Difference]: Finished difference Result 2204 states and 3042 transitions. [2022-11-18 20:30:19,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-18 20:30:19,313 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 6 states have internal predecessors, (69), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 93 [2022-11-18 20:30:19,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:30:19,319 INFO L225 Difference]: With dead ends: 2204 [2022-11-18 20:30:19,319 INFO L226 Difference]: Without dead ends: 1353 [2022-11-18 20:30:19,322 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-11-18 20:30:19,323 INFO L413 NwaCegarLoop]: 342 mSDtfsCounter, 371 mSDsluCounter, 1548 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 376 SdHoareTripleChecker+Valid, 1890 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 20:30:19,323 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [376 Valid, 1890 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 20:30:19,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1353 states. [2022-11-18 20:30:19,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1353 to 1117. [2022-11-18 20:30:19,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1117 states, 863 states have (on average 1.3534183082271147) internal successors, (1168), 875 states have internal predecessors, (1168), 162 states have call successors, (162), 91 states have call predecessors, (162), 91 states have return successors, (162), 150 states have call predecessors, (162), 162 states have call successors, (162) [2022-11-18 20:30:19,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1117 states to 1117 states and 1492 transitions. [2022-11-18 20:30:19,504 INFO L78 Accepts]: Start accepts. Automaton has 1117 states and 1492 transitions. Word has length 93 [2022-11-18 20:30:19,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:30:19,505 INFO L495 AbstractCegarLoop]: Abstraction has 1117 states and 1492 transitions. [2022-11-18 20:30:19,505 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 6 states have internal predecessors, (69), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-11-18 20:30:19,505 INFO L276 IsEmpty]: Start isEmpty. Operand 1117 states and 1492 transitions. [2022-11-18 20:30:19,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2022-11-18 20:30:19,507 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:30:19,507 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:30:19,507 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-18 20:30:19,508 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:30:19,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:30:19,508 INFO L85 PathProgramCache]: Analyzing trace with hash -1811425973, now seen corresponding path program 1 times [2022-11-18 20:30:19,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:30:19,509 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910240635] [2022-11-18 20:30:19,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:30:19,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:30:19,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:30:19,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-18 20:30:19,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:30:19,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-18 20:30:19,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:30:19,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-11-18 20:30:19,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:30:19,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-18 20:30:19,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:30:19,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-11-18 20:30:19,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:30:19,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-11-18 20:30:19,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:30:19,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-11-18 20:30:19,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:30:19,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-11-18 20:30:19,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:30:19,868 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-11-18 20:30:19,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:30:19,869 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910240635] [2022-11-18 20:30:19,869 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [910240635] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:30:19,869 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:30:19,869 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-18 20:30:19,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291432608] [2022-11-18 20:30:19,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:30:19,870 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-18 20:30:19,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:30:19,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-18 20:30:19,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-18 20:30:19,871 INFO L87 Difference]: Start difference. First operand 1117 states and 1492 transitions. Second operand has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 6 states have internal predecessors, (68), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2022-11-18 20:30:20,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:30:20,315 INFO L93 Difference]: Finished difference Result 2255 states and 3097 transitions. [2022-11-18 20:30:20,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-18 20:30:20,316 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 6 states have internal predecessors, (68), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) Word has length 95 [2022-11-18 20:30:20,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:30:20,323 INFO L225 Difference]: With dead ends: 2255 [2022-11-18 20:30:20,323 INFO L226 Difference]: Without dead ends: 1381 [2022-11-18 20:30:20,326 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-11-18 20:30:20,328 INFO L413 NwaCegarLoop]: 372 mSDtfsCounter, 286 mSDsluCounter, 1668 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 300 SdHoareTripleChecker+Valid, 2040 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 20:30:20,328 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [300 Valid, 2040 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 20:30:20,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1381 states. [2022-11-18 20:30:20,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1381 to 1008. [2022-11-18 20:30:20,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1008 states, 781 states have (on average 1.3559539052496798) internal successors, (1059), 791 states have internal predecessors, (1059), 145 states have call successors, (145), 81 states have call predecessors, (145), 81 states have return successors, (145), 135 states have call predecessors, (145), 145 states have call successors, (145) [2022-11-18 20:30:20,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1008 states to 1008 states and 1349 transitions. [2022-11-18 20:30:20,519 INFO L78 Accepts]: Start accepts. Automaton has 1008 states and 1349 transitions. Word has length 95 [2022-11-18 20:30:20,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:30:20,519 INFO L495 AbstractCegarLoop]: Abstraction has 1008 states and 1349 transitions. [2022-11-18 20:30:20,520 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 6 states have internal predecessors, (68), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2022-11-18 20:30:20,520 INFO L276 IsEmpty]: Start isEmpty. Operand 1008 states and 1349 transitions. [2022-11-18 20:30:20,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-11-18 20:30:20,521 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:30:20,521 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:30:20,521 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-18 20:30:20,522 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:30:20,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:30:20,522 INFO L85 PathProgramCache]: Analyzing trace with hash -375753860, now seen corresponding path program 1 times [2022-11-18 20:30:20,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:30:20,522 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513524865] [2022-11-18 20:30:20,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:30:20,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:30:20,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:30:20,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-18 20:30:20,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:30:20,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-18 20:30:20,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:30:20,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-11-18 20:30:20,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:30:20,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-18 20:30:20,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:30:20,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-11-18 20:30:20,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:30:20,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-11-18 20:30:20,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:30:20,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-11-18 20:30:20,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:30:20,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-11-18 20:30:20,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:30:20,894 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-18 20:30:20,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:30:20,894 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513524865] [2022-11-18 20:30:20,895 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1513524865] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:30:20,895 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:30:20,895 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-18 20:30:20,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370306756] [2022-11-18 20:30:20,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:30:20,897 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-18 20:30:20,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:30:20,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-18 20:30:20,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-18 20:30:20,898 INFO L87 Difference]: Start difference. First operand 1008 states and 1349 transitions. Second operand has 8 states, 8 states have (on average 9.125) internal successors, (73), 7 states have internal predecessors, (73), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2022-11-18 20:30:22,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:30:22,037 INFO L93 Difference]: Finished difference Result 2311 states and 3183 transitions. [2022-11-18 20:30:22,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-18 20:30:22,038 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.125) internal successors, (73), 7 states have internal predecessors, (73), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Word has length 96 [2022-11-18 20:30:22,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:30:22,047 INFO L225 Difference]: With dead ends: 2311 [2022-11-18 20:30:22,047 INFO L226 Difference]: Without dead ends: 1466 [2022-11-18 20:30:22,050 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2022-11-18 20:30:22,051 INFO L413 NwaCegarLoop]: 427 mSDtfsCounter, 669 mSDsluCounter, 1671 mSDsCounter, 0 mSdLazyCounter, 505 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 675 SdHoareTripleChecker+Valid, 2098 SdHoareTripleChecker+Invalid, 558 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 505 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-18 20:30:22,051 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [675 Valid, 2098 Invalid, 558 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 505 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-18 20:30:22,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1466 states. [2022-11-18 20:30:22,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1466 to 1024. [2022-11-18 20:30:22,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1024 states, 789 states have (on average 1.3333333333333333) internal successors, (1052), 800 states have internal predecessors, (1052), 148 states have call successors, (148), 86 states have call predecessors, (148), 86 states have return successors, (148), 137 states have call predecessors, (148), 148 states have call successors, (148) [2022-11-18 20:30:22,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1024 states to 1024 states and 1348 transitions. [2022-11-18 20:30:22,384 INFO L78 Accepts]: Start accepts. Automaton has 1024 states and 1348 transitions. Word has length 96 [2022-11-18 20:30:22,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:30:22,385 INFO L495 AbstractCegarLoop]: Abstraction has 1024 states and 1348 transitions. [2022-11-18 20:30:22,385 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.125) internal successors, (73), 7 states have internal predecessors, (73), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2022-11-18 20:30:22,385 INFO L276 IsEmpty]: Start isEmpty. Operand 1024 states and 1348 transitions. [2022-11-18 20:30:22,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-11-18 20:30:22,387 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:30:22,387 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:30:22,387 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-18 20:30:22,387 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:30:22,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:30:22,388 INFO L85 PathProgramCache]: Analyzing trace with hash -566843121, now seen corresponding path program 1 times [2022-11-18 20:30:22,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:30:22,388 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959179207] [2022-11-18 20:30:22,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:30:22,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:30:22,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:30:22,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-18 20:30:22,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:30:22,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-18 20:30:22,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:30:22,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-18 20:30:22,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:30:22,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-11-18 20:30:22,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:30:22,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-11-18 20:30:22,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:30:22,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-11-18 20:30:22,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:30:22,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-11-18 20:30:22,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:30:22,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-11-18 20:30:22,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:30:22,554 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-18 20:30:22,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:30:22,555 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959179207] [2022-11-18 20:30:22,555 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [959179207] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:30:22,555 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:30:22,555 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-18 20:30:22,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202119614] [2022-11-18 20:30:22,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:30:22,556 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 20:30:22,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:30:22,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 20:30:22,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-18 20:30:22,557 INFO L87 Difference]: Start difference. First operand 1024 states and 1348 transitions. Second operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-11-18 20:30:23,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:30:23,200 INFO L93 Difference]: Finished difference Result 2878 states and 3865 transitions. [2022-11-18 20:30:23,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-18 20:30:23,201 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 97 [2022-11-18 20:30:23,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:30:23,211 INFO L225 Difference]: With dead ends: 2878 [2022-11-18 20:30:23,212 INFO L226 Difference]: Without dead ends: 2068 [2022-11-18 20:30:23,215 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-18 20:30:23,216 INFO L413 NwaCegarLoop]: 454 mSDtfsCounter, 372 mSDsluCounter, 643 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 372 SdHoareTripleChecker+Valid, 1097 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 20:30:23,216 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [372 Valid, 1097 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 20:30:23,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2068 states. [2022-11-18 20:30:23,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2068 to 1768. [2022-11-18 20:30:23,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1768 states, 1343 states have (on average 1.326880119136262) internal successors, (1782), 1362 states have internal predecessors, (1782), 272 states have call successors, (272), 152 states have call predecessors, (272), 152 states have return successors, (272), 253 states have call predecessors, (272), 272 states have call successors, (272) [2022-11-18 20:30:23,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1768 states to 1768 states and 2326 transitions. [2022-11-18 20:30:23,618 INFO L78 Accepts]: Start accepts. Automaton has 1768 states and 2326 transitions. Word has length 97 [2022-11-18 20:30:23,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:30:23,619 INFO L495 AbstractCegarLoop]: Abstraction has 1768 states and 2326 transitions. [2022-11-18 20:30:23,619 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-11-18 20:30:23,620 INFO L276 IsEmpty]: Start isEmpty. Operand 1768 states and 2326 transitions. [2022-11-18 20:30:23,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-11-18 20:30:23,621 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:30:23,622 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:30:23,622 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-18 20:30:23,622 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:30:23,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:30:23,623 INFO L85 PathProgramCache]: Analyzing trace with hash 1375100484, now seen corresponding path program 1 times [2022-11-18 20:30:23,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:30:23,623 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325100676] [2022-11-18 20:30:23,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:30:23,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:30:23,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:30:23,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-18 20:30:23,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:30:23,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-18 20:30:23,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:30:24,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-18 20:30:24,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:30:24,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-11-18 20:30:24,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:30:24,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-11-18 20:30:24,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:30:24,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-11-18 20:30:24,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:30:24,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-11-18 20:30:24,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:30:24,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-11-18 20:30:24,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:30:24,055 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-18 20:30:24,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:30:24,056 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325100676] [2022-11-18 20:30:24,056 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1325100676] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:30:24,056 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:30:24,056 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-18 20:30:24,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447485019] [2022-11-18 20:30:24,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:30:24,058 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-18 20:30:24,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:30:24,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-18 20:30:24,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-18 20:30:24,060 INFO L87 Difference]: Start difference. First operand 1768 states and 2326 transitions. Second operand has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 6 states have internal predecessors, (76), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2022-11-18 20:30:25,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:30:25,386 INFO L93 Difference]: Finished difference Result 3919 states and 5292 transitions. [2022-11-18 20:30:25,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-18 20:30:25,387 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 6 states have internal predecessors, (76), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) Word has length 99 [2022-11-18 20:30:25,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:30:25,398 INFO L225 Difference]: With dead ends: 3919 [2022-11-18 20:30:25,399 INFO L226 Difference]: Without dead ends: 2447 [2022-11-18 20:30:25,402 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2022-11-18 20:30:25,403 INFO L413 NwaCegarLoop]: 467 mSDtfsCounter, 698 mSDsluCounter, 1544 mSDsCounter, 0 mSdLazyCounter, 397 mSolverCounterSat, 195 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 701 SdHoareTripleChecker+Valid, 2011 SdHoareTripleChecker+Invalid, 592 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 195 IncrementalHoareTripleChecker+Valid, 397 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-18 20:30:25,404 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [701 Valid, 2011 Invalid, 592 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [195 Valid, 397 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-18 20:30:25,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2447 states. [2022-11-18 20:30:25,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2447 to 1793. [2022-11-18 20:30:25,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1793 states, 1355 states have (on average 1.3210332103321034) internal successors, (1790), 1375 states have internal predecessors, (1790), 280 states have call successors, (280), 157 states have call predecessors, (280), 157 states have return successors, (280), 260 states have call predecessors, (280), 280 states have call successors, (280) [2022-11-18 20:30:25,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1793 states to 1793 states and 2350 transitions. [2022-11-18 20:30:25,737 INFO L78 Accepts]: Start accepts. Automaton has 1793 states and 2350 transitions. Word has length 99 [2022-11-18 20:30:25,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:30:25,738 INFO L495 AbstractCegarLoop]: Abstraction has 1793 states and 2350 transitions. [2022-11-18 20:30:25,738 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 6 states have internal predecessors, (76), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2022-11-18 20:30:25,738 INFO L276 IsEmpty]: Start isEmpty. Operand 1793 states and 2350 transitions. [2022-11-18 20:30:25,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-11-18 20:30:25,740 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:30:25,741 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:30:25,741 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-11-18 20:30:25,741 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:30:25,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:30:25,742 INFO L85 PathProgramCache]: Analyzing trace with hash -599061911, now seen corresponding path program 1 times [2022-11-18 20:30:25,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:30:25,742 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103026388] [2022-11-18 20:30:25,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:30:25,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:30:25,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:30:25,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-18 20:30:25,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:30:25,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-18 20:30:25,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:30:25,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-11-18 20:30:25,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:30:25,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-11-18 20:30:25,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:30:25,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-11-18 20:30:25,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:30:25,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-11-18 20:30:25,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:30:25,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-11-18 20:30:25,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:30:25,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-11-18 20:30:25,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:30:25,927 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-18 20:30:25,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:30:25,927 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103026388] [2022-11-18 20:30:25,927 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1103026388] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:30:25,928 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:30:25,928 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-18 20:30:25,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27293736] [2022-11-18 20:30:25,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:30:25,929 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 20:30:25,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:30:25,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 20:30:25,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-18 20:30:25,930 INFO L87 Difference]: Start difference. First operand 1793 states and 2350 transitions. Second operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-11-18 20:30:26,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:30:26,771 INFO L93 Difference]: Finished difference Result 4650 states and 6153 transitions. [2022-11-18 20:30:26,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-18 20:30:26,772 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 101 [2022-11-18 20:30:26,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:30:26,789 INFO L225 Difference]: With dead ends: 4650 [2022-11-18 20:30:26,789 INFO L226 Difference]: Without dead ends: 3194 [2022-11-18 20:30:26,796 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-18 20:30:26,797 INFO L413 NwaCegarLoop]: 470 mSDtfsCounter, 399 mSDsluCounter, 677 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 399 SdHoareTripleChecker+Valid, 1147 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-18 20:30:26,798 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [399 Valid, 1147 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-18 20:30:26,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3194 states. [2022-11-18 20:30:27,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3194 to 2814. [2022-11-18 20:30:27,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2814 states, 2101 states have (on average 1.3122322703474536) internal successors, (2757), 2132 states have internal predecessors, (2757), 460 states have call successors, (460), 252 states have call predecessors, (460), 252 states have return successors, (460), 429 states have call predecessors, (460), 460 states have call successors, (460) [2022-11-18 20:30:27,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2814 states to 2814 states and 3677 transitions. [2022-11-18 20:30:27,365 INFO L78 Accepts]: Start accepts. Automaton has 2814 states and 3677 transitions. Word has length 101 [2022-11-18 20:30:27,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:30:27,365 INFO L495 AbstractCegarLoop]: Abstraction has 2814 states and 3677 transitions. [2022-11-18 20:30:27,366 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-11-18 20:30:27,367 INFO L276 IsEmpty]: Start isEmpty. Operand 2814 states and 3677 transitions. [2022-11-18 20:30:27,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-11-18 20:30:27,370 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:30:27,370 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:30:27,370 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-11-18 20:30:27,371 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:30:27,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:30:27,371 INFO L85 PathProgramCache]: Analyzing trace with hash 647926777, now seen corresponding path program 1 times [2022-11-18 20:30:27,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:30:27,371 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503983125] [2022-11-18 20:30:27,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:30:27,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:30:27,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:30:27,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-18 20:30:27,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:30:27,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-18 20:30:27,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:30:27,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-18 20:30:27,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:30:27,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-18 20:30:27,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:30:27,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-18 20:30:27,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:30:27,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-11-18 20:30:27,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:30:27,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-11-18 20:30:27,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:30:27,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-11-18 20:30:27,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:30:27,495 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-18 20:30:27,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:30:27,496 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503983125] [2022-11-18 20:30:27,496 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1503983125] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:30:27,496 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:30:27,496 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-18 20:30:27,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102697670] [2022-11-18 20:30:27,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:30:27,498 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 20:30:27,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:30:27,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 20:30:27,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-18 20:30:27,499 INFO L87 Difference]: Start difference. First operand 2814 states and 3677 transitions. Second operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-11-18 20:30:28,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:30:28,426 INFO L93 Difference]: Finished difference Result 6657 states and 8764 transitions. [2022-11-18 20:30:28,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-18 20:30:28,426 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 101 [2022-11-18 20:30:28,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:30:28,467 INFO L225 Difference]: With dead ends: 6657 [2022-11-18 20:30:28,467 INFO L226 Difference]: Without dead ends: 4300 [2022-11-18 20:30:28,474 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-18 20:30:28,475 INFO L413 NwaCegarLoop]: 477 mSDtfsCounter, 373 mSDsluCounter, 656 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 373 SdHoareTripleChecker+Valid, 1133 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 20:30:28,475 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [373 Valid, 1133 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 20:30:28,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4300 states. [2022-11-18 20:30:29,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4300 to 4030. [2022-11-18 20:30:29,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4030 states, 2993 states have (on average 1.3087203474774474) internal successors, (3917), 3037 states have internal predecessors, (3917), 672 states have call successors, (672), 364 states have call predecessors, (672), 364 states have return successors, (672), 628 states have call predecessors, (672), 672 states have call successors, (672) [2022-11-18 20:30:29,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4030 states to 4030 states and 5261 transitions. [2022-11-18 20:30:29,265 INFO L78 Accepts]: Start accepts. Automaton has 4030 states and 5261 transitions. Word has length 101 [2022-11-18 20:30:29,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:30:29,265 INFO L495 AbstractCegarLoop]: Abstraction has 4030 states and 5261 transitions. [2022-11-18 20:30:29,265 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-11-18 20:30:29,266 INFO L276 IsEmpty]: Start isEmpty. Operand 4030 states and 5261 transitions. [2022-11-18 20:30:29,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2022-11-18 20:30:29,268 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:30:29,269 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:30:29,269 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-11-18 20:30:29,269 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:30:29,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:30:29,270 INFO L85 PathProgramCache]: Analyzing trace with hash -1760044486, now seen corresponding path program 1 times [2022-11-18 20:30:29,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:30:29,270 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578227042] [2022-11-18 20:30:29,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:30:29,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:30:29,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:30:29,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-18 20:30:29,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:30:29,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-18 20:30:29,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:30:29,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-11-18 20:30:29,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:30:29,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-11-18 20:30:29,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:30:29,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-11-18 20:30:29,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:30:29,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-11-18 20:30:29,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:30:29,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-11-18 20:30:29,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:30:29,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-11-18 20:30:29,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:30:29,372 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-18 20:30:29,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:30:29,373 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578227042] [2022-11-18 20:30:29,373 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1578227042] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:30:29,373 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:30:29,374 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-18 20:30:29,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811764991] [2022-11-18 20:30:29,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:30:29,377 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 20:30:29,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:30:29,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 20:30:29,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 20:30:29,379 INFO L87 Difference]: Start difference. First operand 4030 states and 5261 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-11-18 20:30:30,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:30:30,663 INFO L93 Difference]: Finished difference Result 9092 states and 12309 transitions. [2022-11-18 20:30:30,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 20:30:30,664 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 102 [2022-11-18 20:30:30,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:30:30,696 INFO L225 Difference]: With dead ends: 9092 [2022-11-18 20:30:30,696 INFO L226 Difference]: Without dead ends: 5416 [2022-11-18 20:30:30,705 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 20:30:30,707 INFO L413 NwaCegarLoop]: 407 mSDtfsCounter, 123 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 631 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 20:30:30,707 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 631 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 20:30:30,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5416 states. [2022-11-18 20:30:31,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5416 to 4036. [2022-11-18 20:30:31,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4036 states, 2999 states have (on average 1.3081027009003001) internal successors, (3923), 3043 states have internal predecessors, (3923), 672 states have call successors, (672), 364 states have call predecessors, (672), 364 states have return successors, (672), 628 states have call predecessors, (672), 672 states have call successors, (672) [2022-11-18 20:30:31,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4036 states to 4036 states and 5267 transitions. [2022-11-18 20:30:31,393 INFO L78 Accepts]: Start accepts. Automaton has 4036 states and 5267 transitions. Word has length 102 [2022-11-18 20:30:31,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:30:31,394 INFO L495 AbstractCegarLoop]: Abstraction has 4036 states and 5267 transitions. [2022-11-18 20:30:31,394 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-11-18 20:30:31,395 INFO L276 IsEmpty]: Start isEmpty. Operand 4036 states and 5267 transitions. [2022-11-18 20:30:31,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-11-18 20:30:31,397 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:30:31,397 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:30:31,398 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-11-18 20:30:31,398 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:30:31,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:30:31,398 INFO L85 PathProgramCache]: Analyzing trace with hash 1930890164, now seen corresponding path program 1 times [2022-11-18 20:30:31,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:30:31,399 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459330951] [2022-11-18 20:30:31,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:30:31,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:30:31,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:30:31,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-18 20:30:31,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:30:31,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-18 20:30:31,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:30:31,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-18 20:30:31,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:30:31,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-18 20:30:31,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:30:31,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-18 20:30:31,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:30:31,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-11-18 20:30:31,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:30:31,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-11-18 20:30:31,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:30:31,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-11-18 20:30:31,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:30:31,570 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-18 20:30:31,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:30:31,571 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459330951] [2022-11-18 20:30:31,571 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1459330951] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:30:31,571 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:30:31,571 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-18 20:30:31,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33767793] [2022-11-18 20:30:31,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:30:31,572 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 20:30:31,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:30:31,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 20:30:31,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-18 20:30:31,573 INFO L87 Difference]: Start difference. First operand 4036 states and 5267 transitions. Second operand has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-11-18 20:30:32,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:30:32,555 INFO L93 Difference]: Finished difference Result 8476 states and 11323 transitions. [2022-11-18 20:30:32,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-18 20:30:32,556 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 103 [2022-11-18 20:30:32,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:30:32,576 INFO L225 Difference]: With dead ends: 8476 [2022-11-18 20:30:32,576 INFO L226 Difference]: Without dead ends: 4516 [2022-11-18 20:30:32,585 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-18 20:30:32,586 INFO L413 NwaCegarLoop]: 294 mSDtfsCounter, 263 mSDsluCounter, 493 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 288 SdHoareTripleChecker+Valid, 787 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-18 20:30:32,586 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [288 Valid, 787 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-18 20:30:32,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4516 states. [2022-11-18 20:30:33,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4516 to 3681. [2022-11-18 20:30:33,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3681 states, 2727 states have (on average 1.3182984965163183) internal successors, (3595), 2761 states have internal predecessors, (3595), 620 states have call successors, (620), 333 states have call predecessors, (620), 333 states have return successors, (620), 586 states have call predecessors, (620), 620 states have call successors, (620) [2022-11-18 20:30:33,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3681 states to 3681 states and 4835 transitions. [2022-11-18 20:30:33,365 INFO L78 Accepts]: Start accepts. Automaton has 3681 states and 4835 transitions. Word has length 103 [2022-11-18 20:30:33,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:30:33,366 INFO L495 AbstractCegarLoop]: Abstraction has 3681 states and 4835 transitions. [2022-11-18 20:30:33,366 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-11-18 20:30:33,367 INFO L276 IsEmpty]: Start isEmpty. Operand 3681 states and 4835 transitions. [2022-11-18 20:30:33,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2022-11-18 20:30:33,369 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:30:33,369 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:30:33,370 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-11-18 20:30:33,370 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:30:33,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:30:33,371 INFO L85 PathProgramCache]: Analyzing trace with hash -1500264054, now seen corresponding path program 1 times [2022-11-18 20:30:33,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:30:33,371 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013080958] [2022-11-18 20:30:33,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:30:33,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:30:33,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:30:33,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-18 20:30:33,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:30:33,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-18 20:30:33,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:30:33,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-11-18 20:30:33,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:30:33,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-11-18 20:30:33,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:30:33,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-11-18 20:30:33,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:30:33,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-11-18 20:30:33,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:30:33,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-11-18 20:30:33,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:30:33,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-11-18 20:30:33,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:30:33,465 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-18 20:30:33,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:30:33,466 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013080958] [2022-11-18 20:30:33,466 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1013080958] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:30:33,466 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:30:33,466 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-18 20:30:33,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734260404] [2022-11-18 20:30:33,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:30:33,468 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 20:30:33,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:30:33,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 20:30:33,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 20:30:33,475 INFO L87 Difference]: Start difference. First operand 3681 states and 4835 transitions. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-11-18 20:30:34,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:30:34,616 INFO L93 Difference]: Finished difference Result 8070 states and 10879 transitions. [2022-11-18 20:30:34,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 20:30:34,617 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 104 [2022-11-18 20:30:34,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:30:34,637 INFO L225 Difference]: With dead ends: 8070 [2022-11-18 20:30:34,637 INFO L226 Difference]: Without dead ends: 4570 [2022-11-18 20:30:34,645 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 20:30:34,646 INFO L413 NwaCegarLoop]: 400 mSDtfsCounter, 123 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 625 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 20:30:34,648 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 625 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 20:30:34,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4570 states. [2022-11-18 20:30:35,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4570 to 3691. [2022-11-18 20:30:35,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3691 states, 2737 states have (on average 1.3171355498721227) internal successors, (3605), 2771 states have internal predecessors, (3605), 620 states have call successors, (620), 333 states have call predecessors, (620), 333 states have return successors, (620), 586 states have call predecessors, (620), 620 states have call successors, (620) [2022-11-18 20:30:35,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3691 states to 3691 states and 4845 transitions. [2022-11-18 20:30:35,350 INFO L78 Accepts]: Start accepts. Automaton has 3691 states and 4845 transitions. Word has length 104 [2022-11-18 20:30:35,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:30:35,351 INFO L495 AbstractCegarLoop]: Abstraction has 3691 states and 4845 transitions. [2022-11-18 20:30:35,351 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-11-18 20:30:35,352 INFO L276 IsEmpty]: Start isEmpty. Operand 3691 states and 4845 transitions. [2022-11-18 20:30:35,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2022-11-18 20:30:35,354 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:30:35,354 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:30:35,354 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-11-18 20:30:35,354 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:30:35,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:30:35,355 INFO L85 PathProgramCache]: Analyzing trace with hash -1445902481, now seen corresponding path program 1 times [2022-11-18 20:30:35,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:30:35,355 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770936583] [2022-11-18 20:30:35,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:30:35,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:30:35,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:30:35,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-18 20:30:35,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:30:35,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-18 20:30:35,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:30:35,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-11-18 20:30:35,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:30:35,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-11-18 20:30:35,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:30:35,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-11-18 20:30:35,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:30:35,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-11-18 20:30:35,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:30:35,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-11-18 20:30:35,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:30:35,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-11-18 20:30:35,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:30:35,505 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-18 20:30:35,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:30:35,506 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770936583] [2022-11-18 20:30:35,506 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [770936583] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:30:35,506 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:30:35,506 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-18 20:30:35,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559285151] [2022-11-18 20:30:35,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:30:35,507 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 20:30:35,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:30:35,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 20:30:35,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-18 20:30:35,508 INFO L87 Difference]: Start difference. First operand 3691 states and 4845 transitions. Second operand has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-11-18 20:30:36,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:30:36,442 INFO L93 Difference]: Finished difference Result 8053 states and 10848 transitions. [2022-11-18 20:30:36,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-18 20:30:36,443 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 104 [2022-11-18 20:30:36,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:30:36,465 INFO L225 Difference]: With dead ends: 8053 [2022-11-18 20:30:36,465 INFO L226 Difference]: Without dead ends: 4481 [2022-11-18 20:30:36,474 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-18 20:30:36,475 INFO L413 NwaCegarLoop]: 305 mSDtfsCounter, 211 mSDsluCounter, 499 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 804 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-18 20:30:36,476 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [236 Valid, 804 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-18 20:30:36,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4481 states. [2022-11-18 20:30:37,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4481 to 2783. [2022-11-18 20:30:37,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2783 states, 2063 states have (on average 1.3116820164808531) internal successors, (2706), 2082 states have internal predecessors, (2706), 469 states have call successors, (469), 250 states have call predecessors, (469), 250 states have return successors, (469), 450 states have call predecessors, (469), 469 states have call successors, (469) [2022-11-18 20:30:37,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2783 states to 2783 states and 3644 transitions. [2022-11-18 20:30:37,124 INFO L78 Accepts]: Start accepts. Automaton has 2783 states and 3644 transitions. Word has length 104 [2022-11-18 20:30:37,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:30:37,125 INFO L495 AbstractCegarLoop]: Abstraction has 2783 states and 3644 transitions. [2022-11-18 20:30:37,125 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-11-18 20:30:37,125 INFO L276 IsEmpty]: Start isEmpty. Operand 2783 states and 3644 transitions. [2022-11-18 20:30:37,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2022-11-18 20:30:37,130 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:30:37,130 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:30:37,130 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-11-18 20:30:37,131 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:30:37,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:30:37,131 INFO L85 PathProgramCache]: Analyzing trace with hash 486642331, now seen corresponding path program 1 times [2022-11-18 20:30:37,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:30:37,132 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951789583] [2022-11-18 20:30:37,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:30:37,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:30:37,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:30:37,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-18 20:30:37,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:30:37,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-18 20:30:37,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:30:37,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-11-18 20:30:37,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:30:37,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-18 20:30:37,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:30:37,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-11-18 20:30:37,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:30:37,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-11-18 20:30:37,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:30:37,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-11-18 20:30:37,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:30:37,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-11-18 20:30:37,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:30:37,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-11-18 20:30:37,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:30:37,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-11-18 20:30:37,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:30:37,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-11-18 20:30:37,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:30:37,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-11-18 20:30:37,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:30:37,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-11-18 20:30:37,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:30:37,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-11-18 20:30:37,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:30:37,562 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 16 proven. 12 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2022-11-18 20:30:37,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:30:37,563 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951789583] [2022-11-18 20:30:37,563 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1951789583] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:30:37,564 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [482879288] [2022-11-18 20:30:37,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:30:37,564 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:30:37,564 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d29f079-78c4-4116-83da-dc1ebb38fecd/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:30:37,571 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d29f079-78c4-4116-83da-dc1ebb38fecd/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:30:37,592 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d29f079-78c4-4116-83da-dc1ebb38fecd/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-18 20:30:37,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:30:37,792 INFO L263 TraceCheckSpWp]: Trace formula consists of 698 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-18 20:30:37,803 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:30:38,062 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 61 proven. 4 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-11-18 20:30:38,062 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:30:38,297 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 28 proven. 2 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2022-11-18 20:30:38,298 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [482879288] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:30:38,298 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 20:30:38,298 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2022-11-18 20:30:38,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307995071] [2022-11-18 20:30:38,299 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 20:30:38,299 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-18 20:30:38,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:30:38,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-18 20:30:38,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2022-11-18 20:30:38,301 INFO L87 Difference]: Start difference. First operand 2783 states and 3644 transitions. Second operand has 13 states, 13 states have (on average 15.23076923076923) internal successors, (198), 12 states have internal predecessors, (198), 6 states have call successors, (37), 4 states have call predecessors, (37), 6 states have return successors, (37), 7 states have call predecessors, (37), 6 states have call successors, (37) [2022-11-18 20:30:43,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:30:43,804 INFO L93 Difference]: Finished difference Result 9096 states and 12764 transitions. [2022-11-18 20:30:43,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-11-18 20:30:43,812 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 15.23076923076923) internal successors, (198), 12 states have internal predecessors, (198), 6 states have call successors, (37), 4 states have call predecessors, (37), 6 states have return successors, (37), 7 states have call predecessors, (37), 6 states have call successors, (37) Word has length 153 [2022-11-18 20:30:43,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:30:43,841 INFO L225 Difference]: With dead ends: 9096 [2022-11-18 20:30:43,842 INFO L226 Difference]: Without dead ends: 6563 [2022-11-18 20:30:43,849 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 378 GetRequests, 335 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 499 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=383, Invalid=1509, Unknown=0, NotChecked=0, Total=1892 [2022-11-18 20:30:43,850 INFO L413 NwaCegarLoop]: 290 mSDtfsCounter, 2682 mSDsluCounter, 2050 mSDsCounter, 0 mSdLazyCounter, 1380 mSolverCounterSat, 932 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2682 SdHoareTripleChecker+Valid, 2340 SdHoareTripleChecker+Invalid, 2312 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 932 IncrementalHoareTripleChecker+Valid, 1380 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-11-18 20:30:43,851 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2682 Valid, 2340 Invalid, 2312 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [932 Valid, 1380 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-11-18 20:30:43,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6563 states. [2022-11-18 20:30:44,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6563 to 3532. [2022-11-18 20:30:44,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3532 states, 2623 states have (on average 1.3027068242470454) internal successors, (3417), 2647 states have internal predecessors, (3417), 585 states have call successors, (585), 323 states have call predecessors, (585), 323 states have return successors, (585), 561 states have call predecessors, (585), 585 states have call successors, (585) [2022-11-18 20:30:44,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3532 states to 3532 states and 4587 transitions. [2022-11-18 20:30:44,828 INFO L78 Accepts]: Start accepts. Automaton has 3532 states and 4587 transitions. Word has length 153 [2022-11-18 20:30:44,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:30:44,829 INFO L495 AbstractCegarLoop]: Abstraction has 3532 states and 4587 transitions. [2022-11-18 20:30:44,829 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 15.23076923076923) internal successors, (198), 12 states have internal predecessors, (198), 6 states have call successors, (37), 4 states have call predecessors, (37), 6 states have return successors, (37), 7 states have call predecessors, (37), 6 states have call successors, (37) [2022-11-18 20:30:44,829 INFO L276 IsEmpty]: Start isEmpty. Operand 3532 states and 4587 transitions. [2022-11-18 20:30:44,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2022-11-18 20:30:44,836 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:30:44,836 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:30:44,852 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d29f079-78c4-4116-83da-dc1ebb38fecd/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-18 20:30:45,044 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d29f079-78c4-4116-83da-dc1ebb38fecd/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-11-18 20:30:45,044 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:30:45,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:30:45,045 INFO L85 PathProgramCache]: Analyzing trace with hash 1175059624, now seen corresponding path program 1 times [2022-11-18 20:30:45,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:30:45,045 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461213991] [2022-11-18 20:30:45,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:30:45,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:30:45,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:30:45,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-18 20:30:45,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:30:45,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-18 20:30:45,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:30:45,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-11-18 20:30:45,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:30:45,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-18 20:30:45,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:30:45,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-11-18 20:30:45,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:30:45,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-11-18 20:30:45,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:30:45,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-11-18 20:30:45,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:30:45,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-11-18 20:30:45,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:30:45,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-11-18 20:30:45,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:30:45,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-11-18 20:30:45,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:30:45,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-11-18 20:30:45,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:30:45,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-11-18 20:30:45,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:30:45,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-11-18 20:30:45,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:30:45,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-11-18 20:30:45,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:30:45,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2022-11-18 20:30:45,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:30:45,353 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2022-11-18 20:30:45,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:30:45,353 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461213991] [2022-11-18 20:30:45,353 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1461213991] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:30:45,354 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:30:45,354 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-18 20:30:45,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993606055] [2022-11-18 20:30:45,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:30:45,355 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-18 20:30:45,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:30:45,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-18 20:30:45,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-18 20:30:45,357 INFO L87 Difference]: Start difference. First operand 3532 states and 4587 transitions. Second operand has 7 states, 7 states have (on average 13.142857142857142) internal successors, (92), 6 states have internal predecessors, (92), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) [2022-11-18 20:30:47,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:30:47,732 INFO L93 Difference]: Finished difference Result 12118 states and 16493 transitions. [2022-11-18 20:30:47,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-18 20:30:47,733 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.142857142857142) internal successors, (92), 6 states have internal predecessors, (92), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) Word has length 162 [2022-11-18 20:30:47,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:30:47,773 INFO L225 Difference]: With dead ends: 12118 [2022-11-18 20:30:47,773 INFO L226 Difference]: Without dead ends: 8940 [2022-11-18 20:30:47,783 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2022-11-18 20:30:47,784 INFO L413 NwaCegarLoop]: 452 mSDtfsCounter, 628 mSDsluCounter, 1977 mSDsCounter, 0 mSdLazyCounter, 267 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 647 SdHoareTripleChecker+Valid, 2429 SdHoareTripleChecker+Invalid, 366 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 267 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-18 20:30:47,784 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [647 Valid, 2429 Invalid, 366 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 267 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-18 20:30:47,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8940 states. [2022-11-18 20:30:49,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8940 to 6288. [2022-11-18 20:30:49,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6288 states, 4611 states have (on average 1.3029711559314683) internal successors, (6008), 4657 states have internal predecessors, (6008), 1095 states have call successors, (1095), 581 states have call predecessors, (1095), 581 states have return successors, (1095), 1049 states have call predecessors, (1095), 1095 states have call successors, (1095) [2022-11-18 20:30:49,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6288 states to 6288 states and 8198 transitions. [2022-11-18 20:30:49,314 INFO L78 Accepts]: Start accepts. Automaton has 6288 states and 8198 transitions. Word has length 162 [2022-11-18 20:30:49,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:30:49,315 INFO L495 AbstractCegarLoop]: Abstraction has 6288 states and 8198 transitions. [2022-11-18 20:30:49,315 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.142857142857142) internal successors, (92), 6 states have internal predecessors, (92), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) [2022-11-18 20:30:49,315 INFO L276 IsEmpty]: Start isEmpty. Operand 6288 states and 8198 transitions. [2022-11-18 20:30:49,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2022-11-18 20:30:49,327 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:30:49,327 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:30:49,328 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-11-18 20:30:49,328 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:30:49,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:30:49,328 INFO L85 PathProgramCache]: Analyzing trace with hash -52637384, now seen corresponding path program 1 times [2022-11-18 20:30:49,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:30:49,329 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414158659] [2022-11-18 20:30:49,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:30:49,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:30:49,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:30:49,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-18 20:30:49,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:30:49,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-18 20:30:49,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:30:49,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-18 20:30:49,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:30:49,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-11-18 20:30:49,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:30:49,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-11-18 20:30:49,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:30:49,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-11-18 20:30:49,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:30:49,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-11-18 20:30:49,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:30:49,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-11-18 20:30:49,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:30:49,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-11-18 20:30:49,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:30:49,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-11-18 20:30:49,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:30:49,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-11-18 20:30:49,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:30:49,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-11-18 20:30:49,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:30:49,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-11-18 20:30:49,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:30:49,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-11-18 20:30:49,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:30:49,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2022-11-18 20:30:49,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:30:49,898 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 12 proven. 17 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2022-11-18 20:30:49,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:30:49,898 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414158659] [2022-11-18 20:30:49,899 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [414158659] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:30:49,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [104582559] [2022-11-18 20:30:49,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:30:49,899 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:30:49,900 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d29f079-78c4-4116-83da-dc1ebb38fecd/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:30:49,901 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d29f079-78c4-4116-83da-dc1ebb38fecd/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:30:49,908 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d29f079-78c4-4116-83da-dc1ebb38fecd/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-18 20:30:50,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:30:50,112 INFO L263 TraceCheckSpWp]: Trace formula consists of 734 conjuncts, 16 conjunts are in the unsatisfiable core [2022-11-18 20:30:50,117 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:30:50,485 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 32 proven. 47 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-18 20:30:50,486 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:30:50,727 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 11 proven. 20 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2022-11-18 20:30:50,728 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [104582559] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:30:50,728 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 20:30:50,728 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 16 [2022-11-18 20:30:50,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261516299] [2022-11-18 20:30:50,728 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 20:30:50,729 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-11-18 20:30:50,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:30:50,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-11-18 20:30:50,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2022-11-18 20:30:50,730 INFO L87 Difference]: Start difference. First operand 6288 states and 8198 transitions. Second operand has 16 states, 16 states have (on average 12.875) internal successors, (206), 14 states have internal predecessors, (206), 6 states have call successors, (43), 4 states have call predecessors, (43), 7 states have return successors, (42), 8 states have call predecessors, (42), 6 states have call successors, (42) [2022-11-18 20:31:06,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:31:06,477 INFO L93 Difference]: Finished difference Result 29181 states and 39381 transitions. [2022-11-18 20:31:06,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2022-11-18 20:31:06,480 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 12.875) internal successors, (206), 14 states have internal predecessors, (206), 6 states have call successors, (43), 4 states have call predecessors, (43), 7 states have return successors, (42), 8 states have call predecessors, (42), 6 states have call successors, (42) Word has length 162 [2022-11-18 20:31:06,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:31:06,568 INFO L225 Difference]: With dead ends: 29181 [2022-11-18 20:31:06,568 INFO L226 Difference]: Without dead ends: 23173 [2022-11-18 20:31:06,585 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 528 GetRequests, 410 SyntacticMatches, 1 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5081 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=1835, Invalid=12207, Unknown=0, NotChecked=0, Total=14042 [2022-11-18 20:31:06,586 INFO L413 NwaCegarLoop]: 1478 mSDtfsCounter, 5085 mSDsluCounter, 11644 mSDsCounter, 0 mSdLazyCounter, 5862 mSolverCounterSat, 3469 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5085 SdHoareTripleChecker+Valid, 13122 SdHoareTripleChecker+Invalid, 9331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 3469 IncrementalHoareTripleChecker+Valid, 5862 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.6s IncrementalHoareTripleChecker+Time [2022-11-18 20:31:06,586 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5085 Valid, 13122 Invalid, 9331 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [3469 Valid, 5862 Invalid, 0 Unknown, 0 Unchecked, 6.6s Time] [2022-11-18 20:31:06,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23173 states. [2022-11-18 20:31:08,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23173 to 8387. [2022-11-18 20:31:08,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8387 states, 6194 states have (on average 1.3041653212786568) internal successors, (8078), 6252 states have internal predecessors, (8078), 1423 states have call successors, (1423), 769 states have call predecessors, (1423), 769 states have return successors, (1423), 1365 states have call predecessors, (1423), 1423 states have call successors, (1423) [2022-11-18 20:31:08,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8387 states to 8387 states and 10924 transitions. [2022-11-18 20:31:08,451 INFO L78 Accepts]: Start accepts. Automaton has 8387 states and 10924 transitions. Word has length 162 [2022-11-18 20:31:08,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:31:08,452 INFO L495 AbstractCegarLoop]: Abstraction has 8387 states and 10924 transitions. [2022-11-18 20:31:08,452 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 12.875) internal successors, (206), 14 states have internal predecessors, (206), 6 states have call successors, (43), 4 states have call predecessors, (43), 7 states have return successors, (42), 8 states have call predecessors, (42), 6 states have call successors, (42) [2022-11-18 20:31:08,452 INFO L276 IsEmpty]: Start isEmpty. Operand 8387 states and 10924 transitions. [2022-11-18 20:31:08,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2022-11-18 20:31:08,467 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:31:08,467 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:31:08,473 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d29f079-78c4-4116-83da-dc1ebb38fecd/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-18 20:31:08,673 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d29f079-78c4-4116-83da-dc1ebb38fecd/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:31:08,673 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:31:08,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:31:08,674 INFO L85 PathProgramCache]: Analyzing trace with hash -1883995866, now seen corresponding path program 1 times [2022-11-18 20:31:08,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:31:08,674 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367189865] [2022-11-18 20:31:08,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:31:08,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:31:08,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:31:09,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-18 20:31:09,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:31:09,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-18 20:31:09,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:31:09,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-11-18 20:31:09,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:31:09,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-11-18 20:31:09,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:31:09,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-11-18 20:31:09,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:31:09,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-11-18 20:31:09,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:31:09,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-11-18 20:31:09,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:31:09,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-11-18 20:31:09,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:31:09,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-11-18 20:31:09,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:31:09,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-11-18 20:31:09,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:31:09,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-11-18 20:31:09,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:31:09,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-11-18 20:31:09,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:31:09,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-11-18 20:31:09,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:31:09,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-11-18 20:31:09,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:31:09,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2022-11-18 20:31:09,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:31:09,452 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 16 proven. 14 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2022-11-18 20:31:09,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:31:09,452 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367189865] [2022-11-18 20:31:09,452 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [367189865] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:31:09,453 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1282646348] [2022-11-18 20:31:09,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:31:09,453 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:31:09,453 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d29f079-78c4-4116-83da-dc1ebb38fecd/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:31:09,454 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d29f079-78c4-4116-83da-dc1ebb38fecd/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:31:09,484 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d29f079-78c4-4116-83da-dc1ebb38fecd/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-18 20:31:09,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:31:09,669 INFO L263 TraceCheckSpWp]: Trace formula consists of 739 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-18 20:31:09,673 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:31:09,768 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 49 proven. 6 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-11-18 20:31:09,768 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:31:09,891 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2022-11-18 20:31:09,892 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1282646348] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-18 20:31:09,892 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-18 20:31:09,892 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8, 7] total 14 [2022-11-18 20:31:09,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398785393] [2022-11-18 20:31:09,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:31:09,894 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-18 20:31:09,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:31:09,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-18 20:31:09,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2022-11-18 20:31:09,895 INFO L87 Difference]: Start difference. First operand 8387 states and 10924 transitions. Second operand has 5 states, 4 states have (on average 23.25) internal successors, (93), 5 states have internal predecessors, (93), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) [2022-11-18 20:31:11,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:31:11,021 INFO L93 Difference]: Finished difference Result 13717 states and 17918 transitions. [2022-11-18 20:31:11,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-18 20:31:11,022 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 23.25) internal successors, (93), 5 states have internal predecessors, (93), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) Word has length 166 [2022-11-18 20:31:11,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:31:11,041 INFO L225 Difference]: With dead ends: 13717 [2022-11-18 20:31:11,041 INFO L226 Difference]: Without dead ends: 5526 [2022-11-18 20:31:11,053 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 368 GetRequests, 356 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2022-11-18 20:31:11,053 INFO L413 NwaCegarLoop]: 258 mSDtfsCounter, 2 mSDsluCounter, 507 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 765 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-18 20:31:11,054 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 765 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-18 20:31:11,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5526 states. [2022-11-18 20:31:12,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5526 to 5294. [2022-11-18 20:31:12,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5294 states, 3912 states have (on average 1.3034253578732107) internal successors, (5099), 3946 states have internal predecessors, (5099), 901 states have call successors, (901), 480 states have call predecessors, (901), 480 states have return successors, (901), 867 states have call predecessors, (901), 901 states have call successors, (901) [2022-11-18 20:31:12,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5294 states to 5294 states and 6901 transitions. [2022-11-18 20:31:12,254 INFO L78 Accepts]: Start accepts. Automaton has 5294 states and 6901 transitions. Word has length 166 [2022-11-18 20:31:12,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:31:12,254 INFO L495 AbstractCegarLoop]: Abstraction has 5294 states and 6901 transitions. [2022-11-18 20:31:12,255 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 23.25) internal successors, (93), 5 states have internal predecessors, (93), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) [2022-11-18 20:31:12,255 INFO L276 IsEmpty]: Start isEmpty. Operand 5294 states and 6901 transitions. [2022-11-18 20:31:12,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2022-11-18 20:31:12,265 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:31:12,265 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:31:12,279 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d29f079-78c4-4116-83da-dc1ebb38fecd/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-18 20:31:12,472 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d29f079-78c4-4116-83da-dc1ebb38fecd/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:31:12,472 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:31:12,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:31:12,473 INFO L85 PathProgramCache]: Analyzing trace with hash 981286631, now seen corresponding path program 1 times [2022-11-18 20:31:12,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:31:12,473 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508409526] [2022-11-18 20:31:12,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:31:12,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:31:12,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:31:13,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-18 20:31:13,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:31:13,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-18 20:31:13,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:31:13,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-11-18 20:31:13,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:31:13,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-11-18 20:31:13,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:31:13,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-11-18 20:31:13,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:31:13,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-11-18 20:31:13,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:31:13,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-11-18 20:31:13,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:31:13,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-11-18 20:31:13,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:31:13,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-11-18 20:31:13,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:31:13,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-11-18 20:31:13,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:31:13,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-11-18 20:31:13,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:31:13,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-11-18 20:31:13,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:31:13,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-11-18 20:31:13,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:31:13,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-11-18 20:31:13,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:31:13,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2022-11-18 20:31:13,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:31:13,229 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 15 proven. 14 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2022-11-18 20:31:13,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:31:13,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508409526] [2022-11-18 20:31:13,229 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1508409526] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:31:13,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2080846390] [2022-11-18 20:31:13,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:31:13,230 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:31:13,230 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d29f079-78c4-4116-83da-dc1ebb38fecd/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:31:13,231 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d29f079-78c4-4116-83da-dc1ebb38fecd/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:31:13,256 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d29f079-78c4-4116-83da-dc1ebb38fecd/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-18 20:31:13,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:31:13,443 INFO L263 TraceCheckSpWp]: Trace formula consists of 756 conjuncts, 27 conjunts are in the unsatisfiable core [2022-11-18 20:31:13,447 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:31:14,299 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 59 proven. 22 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-18 20:31:14,299 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:31:14,804 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 15 proven. 14 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2022-11-18 20:31:14,805 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2080846390] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:31:14,805 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 20:31:14,806 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 8] total 17 [2022-11-18 20:31:14,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892158710] [2022-11-18 20:31:14,806 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 20:31:14,807 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-18 20:31:14,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:31:14,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-18 20:31:14,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2022-11-18 20:31:14,808 INFO L87 Difference]: Start difference. First operand 5294 states and 6901 transitions. Second operand has 17 states, 17 states have (on average 13.529411764705882) internal successors, (230), 17 states have internal predecessors, (230), 7 states have call successors, (32), 5 states have call predecessors, (32), 5 states have return successors, (31), 7 states have call predecessors, (31), 7 states have call successors, (31) [2022-11-18 20:31:23,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:31:23,812 INFO L93 Difference]: Finished difference Result 20989 states and 29229 transitions. [2022-11-18 20:31:23,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2022-11-18 20:31:23,813 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 13.529411764705882) internal successors, (230), 17 states have internal predecessors, (230), 7 states have call successors, (32), 5 states have call predecessors, (32), 5 states have return successors, (31), 7 states have call predecessors, (31), 7 states have call successors, (31) Word has length 167 [2022-11-18 20:31:23,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:31:23,872 INFO L225 Difference]: With dead ends: 20989 [2022-11-18 20:31:23,873 INFO L226 Difference]: Without dead ends: 15948 [2022-11-18 20:31:23,885 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 444 GetRequests, 362 SyntacticMatches, 2 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2426 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=1304, Invalid=5338, Unknown=0, NotChecked=0, Total=6642 [2022-11-18 20:31:23,886 INFO L413 NwaCegarLoop]: 595 mSDtfsCounter, 2508 mSDsluCounter, 2298 mSDsCounter, 0 mSdLazyCounter, 2583 mSolverCounterSat, 1286 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2508 SdHoareTripleChecker+Valid, 2893 SdHoareTripleChecker+Invalid, 3869 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1286 IncrementalHoareTripleChecker+Valid, 2583 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-11-18 20:31:23,886 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2508 Valid, 2893 Invalid, 3869 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1286 Valid, 2583 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2022-11-18 20:31:23,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15948 states. [2022-11-18 20:31:26,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15948 to 9196. [2022-11-18 20:31:26,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9196 states, 6903 states have (on average 1.3069679849340867) internal successors, (9022), 6957 states have internal predecessors, (9022), 1469 states have call successors, (1469), 823 states have call predecessors, (1469), 823 states have return successors, (1469), 1415 states have call predecessors, (1469), 1469 states have call successors, (1469) [2022-11-18 20:31:26,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9196 states to 9196 states and 11960 transitions. [2022-11-18 20:31:26,215 INFO L78 Accepts]: Start accepts. Automaton has 9196 states and 11960 transitions. Word has length 167 [2022-11-18 20:31:26,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:31:26,216 INFO L495 AbstractCegarLoop]: Abstraction has 9196 states and 11960 transitions. [2022-11-18 20:31:26,216 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 13.529411764705882) internal successors, (230), 17 states have internal predecessors, (230), 7 states have call successors, (32), 5 states have call predecessors, (32), 5 states have return successors, (31), 7 states have call predecessors, (31), 7 states have call successors, (31) [2022-11-18 20:31:26,217 INFO L276 IsEmpty]: Start isEmpty. Operand 9196 states and 11960 transitions. [2022-11-18 20:31:26,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2022-11-18 20:31:26,232 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:31:26,233 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:31:26,244 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d29f079-78c4-4116-83da-dc1ebb38fecd/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-18 20:31:26,439 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d29f079-78c4-4116-83da-dc1ebb38fecd/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2022-11-18 20:31:26,439 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:31:26,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:31:26,440 INFO L85 PathProgramCache]: Analyzing trace with hash 926865534, now seen corresponding path program 1 times [2022-11-18 20:31:26,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:31:26,440 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577303716] [2022-11-18 20:31:26,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:31:26,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:31:26,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:31:27,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-18 20:31:27,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:31:27,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-18 20:31:27,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:31:27,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-11-18 20:31:27,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:31:27,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-11-18 20:31:27,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:31:27,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-11-18 20:31:27,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:31:27,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-11-18 20:31:27,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:31:27,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-11-18 20:31:27,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:31:27,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-11-18 20:31:27,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:31:27,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-11-18 20:31:27,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:31:27,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-11-18 20:31:27,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:31:27,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-11-18 20:31:27,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:31:27,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-11-18 20:31:27,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:31:27,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-11-18 20:31:27,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:31:27,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-11-18 20:31:27,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:31:27,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2022-11-18 20:31:27,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:31:27,715 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 25 proven. 5 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2022-11-18 20:31:27,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:31:27,715 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577303716] [2022-11-18 20:31:27,716 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [577303716] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:31:27,716 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [129180889] [2022-11-18 20:31:27,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:31:27,716 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:31:27,716 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d29f079-78c4-4116-83da-dc1ebb38fecd/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:31:27,717 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d29f079-78c4-4116-83da-dc1ebb38fecd/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:31:27,722 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d29f079-78c4-4116-83da-dc1ebb38fecd/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-18 20:31:27,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:31:27,938 INFO L263 TraceCheckSpWp]: Trace formula consists of 754 conjuncts, 44 conjunts are in the unsatisfiable core [2022-11-18 20:31:27,942 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:31:29,179 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 73 proven. 9 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-18 20:31:29,180 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:31:30,503 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 15 proven. 15 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2022-11-18 20:31:30,504 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [129180889] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:31:30,504 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 20:31:30,505 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 12] total 27 [2022-11-18 20:31:30,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102680132] [2022-11-18 20:31:30,505 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 20:31:30,506 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-11-18 20:31:30,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:31:30,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-11-18 20:31:30,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=580, Unknown=0, NotChecked=0, Total=702 [2022-11-18 20:31:30,507 INFO L87 Difference]: Start difference. First operand 9196 states and 11960 transitions. Second operand has 27 states, 27 states have (on average 9.62962962962963) internal successors, (260), 27 states have internal predecessors, (260), 10 states have call successors, (41), 5 states have call predecessors, (41), 5 states have return successors, (40), 10 states have call predecessors, (40), 10 states have call successors, (40) [2022-11-18 20:32:23,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:32:23,802 INFO L93 Difference]: Finished difference Result 29957 states and 41919 transitions. [2022-11-18 20:32:23,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 238 states. [2022-11-18 20:32:23,803 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 9.62962962962963) internal successors, (260), 27 states have internal predecessors, (260), 10 states have call successors, (41), 5 states have call predecessors, (41), 5 states have return successors, (40), 10 states have call predecessors, (40), 10 states have call successors, (40) Word has length 167 [2022-11-18 20:32:23,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:32:23,877 INFO L225 Difference]: With dead ends: 29957 [2022-11-18 20:32:23,877 INFO L226 Difference]: Without dead ends: 21025 [2022-11-18 20:32:23,903 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 610 GetRequests, 353 SyntacticMatches, 2 SemanticMatches, 255 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28943 ImplicationChecksByTransitivity, 36.1s TimeCoverageRelationStatistics Valid=8691, Invalid=57101, Unknown=0, NotChecked=0, Total=65792 [2022-11-18 20:32:23,904 INFO L413 NwaCegarLoop]: 537 mSDtfsCounter, 8847 mSDsluCounter, 4597 mSDsCounter, 0 mSdLazyCounter, 8207 mSolverCounterSat, 4317 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8848 SdHoareTripleChecker+Valid, 5134 SdHoareTripleChecker+Invalid, 12524 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 4317 IncrementalHoareTripleChecker+Valid, 8207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.5s IncrementalHoareTripleChecker+Time [2022-11-18 20:32:23,904 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8848 Valid, 5134 Invalid, 12524 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [4317 Valid, 8207 Invalid, 0 Unknown, 0 Unchecked, 9.5s Time] [2022-11-18 20:32:23,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21025 states. [2022-11-18 20:32:26,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21025 to 9240. [2022-11-18 20:32:26,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9240 states, 6937 states have (on average 1.305463456825717) internal successors, (9056), 6991 states have internal predecessors, (9056), 1474 states have call successors, (1474), 828 states have call predecessors, (1474), 828 states have return successors, (1474), 1420 states have call predecessors, (1474), 1474 states have call successors, (1474) [2022-11-18 20:32:26,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9240 states to 9240 states and 12004 transitions. [2022-11-18 20:32:26,548 INFO L78 Accepts]: Start accepts. Automaton has 9240 states and 12004 transitions. Word has length 167 [2022-11-18 20:32:26,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:32:26,549 INFO L495 AbstractCegarLoop]: Abstraction has 9240 states and 12004 transitions. [2022-11-18 20:32:26,549 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 9.62962962962963) internal successors, (260), 27 states have internal predecessors, (260), 10 states have call successors, (41), 5 states have call predecessors, (41), 5 states have return successors, (40), 10 states have call predecessors, (40), 10 states have call successors, (40) [2022-11-18 20:32:26,549 INFO L276 IsEmpty]: Start isEmpty. Operand 9240 states and 12004 transitions. [2022-11-18 20:32:26,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2022-11-18 20:32:26,556 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:32:26,556 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:32:26,563 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d29f079-78c4-4116-83da-dc1ebb38fecd/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-18 20:32:26,762 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d29f079-78c4-4116-83da-dc1ebb38fecd/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2022-11-18 20:32:26,763 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:32:26,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:32:26,763 INFO L85 PathProgramCache]: Analyzing trace with hash -1308252018, now seen corresponding path program 1 times [2022-11-18 20:32:26,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:32:26,763 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477101404] [2022-11-18 20:32:26,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:32:26,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:32:26,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:26,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-18 20:32:26,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:26,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-18 20:32:26,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:26,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-18 20:32:26,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:26,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-11-18 20:32:26,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:27,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-11-18 20:32:27,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:27,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-11-18 20:32:27,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:27,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-11-18 20:32:27,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:27,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-11-18 20:32:27,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:27,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-11-18 20:32:27,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:27,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-11-18 20:32:27,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:27,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-11-18 20:32:27,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:27,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-11-18 20:32:27,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:27,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-11-18 20:32:27,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:27,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-11-18 20:32:27,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:27,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2022-11-18 20:32:27,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:27,069 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 14 proven. 31 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2022-11-18 20:32:27,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:32:27,070 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477101404] [2022-11-18 20:32:27,070 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477101404] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:32:27,070 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1212173961] [2022-11-18 20:32:27,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:32:27,071 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:32:27,071 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d29f079-78c4-4116-83da-dc1ebb38fecd/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:32:27,076 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d29f079-78c4-4116-83da-dc1ebb38fecd/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:32:27,095 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d29f079-78c4-4116-83da-dc1ebb38fecd/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-18 20:32:27,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:27,264 INFO L263 TraceCheckSpWp]: Trace formula consists of 756 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-18 20:32:27,268 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:32:27,539 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 8 proven. 90 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-11-18 20:32:27,539 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:32:27,774 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 14 proven. 31 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2022-11-18 20:32:27,774 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1212173961] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:32:27,774 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 20:32:27,775 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 10 [2022-11-18 20:32:27,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091788416] [2022-11-18 20:32:27,775 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 20:32:27,776 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-18 20:32:27,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:32:27,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-18 20:32:27,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-11-18 20:32:27,777 INFO L87 Difference]: Start difference. First operand 9240 states and 12004 transitions. Second operand has 10 states, 10 states have (on average 15.5) internal successors, (155), 9 states have internal predecessors, (155), 4 states have call successors, (32), 5 states have call predecessors, (32), 7 states have return successors, (31), 4 states have call predecessors, (31), 3 states have call successors, (31) [2022-11-18 20:32:32,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:32:32,904 INFO L93 Difference]: Finished difference Result 25835 states and 33833 transitions. [2022-11-18 20:32:32,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-18 20:32:32,904 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 15.5) internal successors, (155), 9 states have internal predecessors, (155), 4 states have call successors, (32), 5 states have call predecessors, (32), 7 states have return successors, (31), 4 states have call predecessors, (31), 3 states have call successors, (31) Word has length 169 [2022-11-18 20:32:32,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:32:32,954 INFO L225 Difference]: With dead ends: 25835 [2022-11-18 20:32:32,954 INFO L226 Difference]: Without dead ends: 16859 [2022-11-18 20:32:32,969 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 386 GetRequests, 363 SyntacticMatches, 5 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=299, Unknown=0, NotChecked=0, Total=380 [2022-11-18 20:32:32,970 INFO L413 NwaCegarLoop]: 350 mSDtfsCounter, 516 mSDsluCounter, 1924 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 521 SdHoareTripleChecker+Valid, 2274 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-18 20:32:32,970 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [521 Valid, 2274 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-18 20:32:32,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16859 states. [2022-11-18 20:32:35,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16859 to 11808. [2022-11-18 20:32:35,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11808 states, 8933 states have (on average 1.292287025635285) internal successors, (11544), 9003 states have internal predecessors, (11544), 1811 states have call successors, (1811), 1063 states have call predecessors, (1811), 1063 states have return successors, (1811), 1741 states have call predecessors, (1811), 1811 states have call successors, (1811) [2022-11-18 20:32:35,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11808 states to 11808 states and 15166 transitions. [2022-11-18 20:32:35,922 INFO L78 Accepts]: Start accepts. Automaton has 11808 states and 15166 transitions. Word has length 169 [2022-11-18 20:32:35,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:32:35,923 INFO L495 AbstractCegarLoop]: Abstraction has 11808 states and 15166 transitions. [2022-11-18 20:32:35,923 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 15.5) internal successors, (155), 9 states have internal predecessors, (155), 4 states have call successors, (32), 5 states have call predecessors, (32), 7 states have return successors, (31), 4 states have call predecessors, (31), 3 states have call successors, (31) [2022-11-18 20:32:35,923 INFO L276 IsEmpty]: Start isEmpty. Operand 11808 states and 15166 transitions. [2022-11-18 20:32:35,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2022-11-18 20:32:35,931 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:32:35,931 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:32:35,940 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d29f079-78c4-4116-83da-dc1ebb38fecd/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-18 20:32:36,137 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d29f079-78c4-4116-83da-dc1ebb38fecd/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2022-11-18 20:32:36,137 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:32:36,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:32:36,137 INFO L85 PathProgramCache]: Analyzing trace with hash 494131333, now seen corresponding path program 1 times [2022-11-18 20:32:36,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:32:36,138 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111829610] [2022-11-18 20:32:36,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:32:36,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:32:36,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:36,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-18 20:32:36,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:36,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-18 20:32:36,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:36,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-18 20:32:36,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:36,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-11-18 20:32:36,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:36,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-11-18 20:32:36,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:36,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-11-18 20:32:36,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:36,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-11-18 20:32:36,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:36,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-11-18 20:32:36,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:36,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-11-18 20:32:36,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:36,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-11-18 20:32:36,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:36,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-11-18 20:32:36,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:36,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-11-18 20:32:36,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:36,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-11-18 20:32:36,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:36,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-11-18 20:32:36,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:36,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2022-11-18 20:32:36,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:36,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2022-11-18 20:32:36,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:36,381 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-11-18 20:32:36,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:32:36,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111829610] [2022-11-18 20:32:36,381 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [111829610] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:32:36,381 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:32:36,381 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-18 20:32:36,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141711887] [2022-11-18 20:32:36,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:32:36,384 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-18 20:32:36,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:32:36,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-18 20:32:36,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-18 20:32:36,385 INFO L87 Difference]: Start difference. First operand 11808 states and 15166 transitions. Second operand has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 6 states have internal predecessors, (94), 3 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) [2022-11-18 20:32:44,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:32:44,192 INFO L93 Difference]: Finished difference Result 33688 states and 44610 transitions. [2022-11-18 20:32:44,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-18 20:32:44,193 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 6 states have internal predecessors, (94), 3 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) Word has length 171 [2022-11-18 20:32:44,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:32:44,265 INFO L225 Difference]: With dead ends: 33688 [2022-11-18 20:32:44,265 INFO L226 Difference]: Without dead ends: 24670 [2022-11-18 20:32:44,281 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2022-11-18 20:32:44,282 INFO L413 NwaCegarLoop]: 495 mSDtfsCounter, 504 mSDsluCounter, 2050 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 519 SdHoareTripleChecker+Valid, 2545 SdHoareTripleChecker+Invalid, 355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-18 20:32:44,282 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [519 Valid, 2545 Invalid, 355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 265 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-18 20:32:44,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24670 states. [2022-11-18 20:32:48,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24670 to 17376. [2022-11-18 20:32:48,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17376 states, 12966 states have (on average 1.283047971618078) internal successors, (16636), 13085 states have internal predecessors, (16636), 2809 states have call successors, (2809), 1600 states have call predecessors, (2809), 1600 states have return successors, (2809), 2690 states have call predecessors, (2809), 2809 states have call successors, (2809) [2022-11-18 20:32:48,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17376 states to 17376 states and 22254 transitions. [2022-11-18 20:32:48,907 INFO L78 Accepts]: Start accepts. Automaton has 17376 states and 22254 transitions. Word has length 171 [2022-11-18 20:32:48,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:32:48,908 INFO L495 AbstractCegarLoop]: Abstraction has 17376 states and 22254 transitions. [2022-11-18 20:32:48,908 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 6 states have internal predecessors, (94), 3 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) [2022-11-18 20:32:48,908 INFO L276 IsEmpty]: Start isEmpty. Operand 17376 states and 22254 transitions. [2022-11-18 20:32:48,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2022-11-18 20:32:48,987 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:32:48,987 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:32:48,987 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-11-18 20:32:48,987 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:32:48,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:32:48,989 INFO L85 PathProgramCache]: Analyzing trace with hash -2126458504, now seen corresponding path program 1 times [2022-11-18 20:32:48,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:32:48,989 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144923542] [2022-11-18 20:32:48,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:32:48,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:32:49,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:49,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-18 20:32:49,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:49,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-18 20:32:49,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:49,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-18 20:32:49,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:49,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-11-18 20:32:49,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:49,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-11-18 20:32:49,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:49,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-11-18 20:32:49,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:49,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-11-18 20:32:49,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:49,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-11-18 20:32:49,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:49,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-11-18 20:32:49,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:49,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-11-18 20:32:49,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:49,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-11-18 20:32:49,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:49,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-11-18 20:32:49,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:49,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2022-11-18 20:32:49,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:49,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-11-18 20:32:49,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:49,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-11-18 20:32:49,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:49,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2022-11-18 20:32:49,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:49,876 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 30 proven. 6 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2022-11-18 20:32:49,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:32:49,877 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144923542] [2022-11-18 20:32:49,877 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [144923542] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:32:49,877 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1259439694] [2022-11-18 20:32:49,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:32:49,878 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:32:49,878 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d29f079-78c4-4116-83da-dc1ebb38fecd/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:32:49,879 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d29f079-78c4-4116-83da-dc1ebb38fecd/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:32:49,899 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d29f079-78c4-4116-83da-dc1ebb38fecd/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-18 20:32:50,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:50,095 INFO L263 TraceCheckSpWp]: Trace formula consists of 770 conjuncts, 19 conjunts are in the unsatisfiable core [2022-11-18 20:32:50,100 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:32:50,445 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 72 proven. 26 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-11-18 20:32:50,445 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:32:50,772 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 22 proven. 14 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2022-11-18 20:32:50,772 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1259439694] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:32:50,772 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 20:32:50,773 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 7] total 19 [2022-11-18 20:32:50,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782501037] [2022-11-18 20:32:50,773 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 20:32:50,774 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-11-18 20:32:50,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:32:50,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-11-18 20:32:50,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2022-11-18 20:32:50,775 INFO L87 Difference]: Start difference. First operand 17376 states and 22254 transitions. Second operand has 19 states, 19 states have (on average 12.526315789473685) internal successors, (238), 19 states have internal predecessors, (238), 8 states have call successors, (43), 5 states have call predecessors, (43), 6 states have return successors, (42), 8 states have call predecessors, (42), 8 states have call successors, (42) [2022-11-18 20:33:05,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:33:05,703 INFO L93 Difference]: Finished difference Result 40839 states and 53636 transitions. [2022-11-18 20:33:05,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2022-11-18 20:33:05,703 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 12.526315789473685) internal successors, (238), 19 states have internal predecessors, (238), 8 states have call successors, (43), 5 states have call predecessors, (43), 6 states have return successors, (42), 8 states have call predecessors, (42), 8 states have call successors, (42) Word has length 172 [2022-11-18 20:33:05,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:33:05,781 INFO L225 Difference]: With dead ends: 40839 [2022-11-18 20:33:05,781 INFO L226 Difference]: Without dead ends: 24831 [2022-11-18 20:33:05,803 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 450 GetRequests, 379 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1395 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=890, Invalid=4366, Unknown=0, NotChecked=0, Total=5256 [2022-11-18 20:33:05,804 INFO L413 NwaCegarLoop]: 864 mSDtfsCounter, 2513 mSDsluCounter, 6595 mSDsCounter, 0 mSdLazyCounter, 6101 mSolverCounterSat, 2096 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2513 SdHoareTripleChecker+Valid, 7459 SdHoareTripleChecker+Invalid, 8197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 2096 IncrementalHoareTripleChecker+Valid, 6101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2022-11-18 20:33:05,804 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2513 Valid, 7459 Invalid, 8197 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [2096 Valid, 6101 Invalid, 0 Unknown, 0 Unchecked, 4.7s Time] [2022-11-18 20:33:05,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24831 states. [2022-11-18 20:33:11,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24831 to 16666. [2022-11-18 20:33:11,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16666 states, 12385 states have (on average 1.2811465482438433) internal successors, (15867), 12498 states have internal predecessors, (15867), 2734 states have call successors, (2734), 1546 states have call predecessors, (2734), 1546 states have return successors, (2734), 2621 states have call predecessors, (2734), 2734 states have call successors, (2734) [2022-11-18 20:33:11,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16666 states to 16666 states and 21335 transitions. [2022-11-18 20:33:11,119 INFO L78 Accepts]: Start accepts. Automaton has 16666 states and 21335 transitions. Word has length 172 [2022-11-18 20:33:11,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:33:11,120 INFO L495 AbstractCegarLoop]: Abstraction has 16666 states and 21335 transitions. [2022-11-18 20:33:11,120 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 12.526315789473685) internal successors, (238), 19 states have internal predecessors, (238), 8 states have call successors, (43), 5 states have call predecessors, (43), 6 states have return successors, (42), 8 states have call predecessors, (42), 8 states have call successors, (42) [2022-11-18 20:33:11,121 INFO L276 IsEmpty]: Start isEmpty. Operand 16666 states and 21335 transitions. [2022-11-18 20:33:11,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2022-11-18 20:33:11,126 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:33:11,126 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:33:11,135 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d29f079-78c4-4116-83da-dc1ebb38fecd/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-18 20:33:11,333 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d29f079-78c4-4116-83da-dc1ebb38fecd/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2022-11-18 20:33:11,333 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:33:11,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:33:11,333 INFO L85 PathProgramCache]: Analyzing trace with hash -1658950161, now seen corresponding path program 1 times [2022-11-18 20:33:11,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:33:11,334 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537384504] [2022-11-18 20:33:11,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:33:11,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:33:11,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:33:12,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-18 20:33:12,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:33:12,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-18 20:33:12,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:33:12,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-11-18 20:33:12,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:33:12,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-11-18 20:33:12,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:33:12,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-11-18 20:33:12,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:33:12,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-11-18 20:33:12,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:33:12,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-11-18 20:33:12,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:33:12,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-11-18 20:33:12,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:33:12,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-11-18 20:33:12,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:33:12,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-11-18 20:33:12,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:33:12,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-11-18 20:33:12,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:33:12,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-11-18 20:33:12,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:33:12,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-11-18 20:33:12,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:33:12,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2022-11-18 20:33:12,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:33:12,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-11-18 20:33:12,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:33:12,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2022-11-18 20:33:12,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:33:12,239 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 29 proven. 11 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2022-11-18 20:33:12,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:33:12,239 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537384504] [2022-11-18 20:33:12,239 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1537384504] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:33:12,239 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1292637139] [2022-11-18 20:33:12,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:33:12,240 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:33:12,240 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d29f079-78c4-4116-83da-dc1ebb38fecd/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:33:12,241 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d29f079-78c4-4116-83da-dc1ebb38fecd/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:33:12,248 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d29f079-78c4-4116-83da-dc1ebb38fecd/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-18 20:33:12,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:33:12,450 INFO L263 TraceCheckSpWp]: Trace formula consists of 776 conjuncts, 16 conjunts are in the unsatisfiable core [2022-11-18 20:33:12,453 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:33:12,766 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 53 proven. 54 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-18 20:33:12,766 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:33:13,020 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 17 proven. 29 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2022-11-18 20:33:13,021 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1292637139] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:33:13,021 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 20:33:13,021 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 8] total 19 [2022-11-18 20:33:13,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541900353] [2022-11-18 20:33:13,021 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 20:33:13,022 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-11-18 20:33:13,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:33:13,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-11-18 20:33:13,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2022-11-18 20:33:13,023 INFO L87 Difference]: Start difference. First operand 16666 states and 21335 transitions. Second operand has 19 states, 19 states have (on average 12.631578947368421) internal successors, (240), 18 states have internal predecessors, (240), 8 states have call successors, (45), 4 states have call predecessors, (45), 6 states have return successors, (44), 9 states have call predecessors, (44), 8 states have call successors, (44) [2022-11-18 20:33:38,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:33:38,136 INFO L93 Difference]: Finished difference Result 41404 states and 55188 transitions. [2022-11-18 20:33:38,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 144 states. [2022-11-18 20:33:38,136 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 12.631578947368421) internal successors, (240), 18 states have internal predecessors, (240), 8 states have call successors, (45), 4 states have call predecessors, (45), 6 states have return successors, (44), 9 states have call predecessors, (44), 8 states have call successors, (44) Word has length 177 [2022-11-18 20:33:38,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:33:38,232 INFO L225 Difference]: With dead ends: 41404 [2022-11-18 20:33:38,233 INFO L226 Difference]: Without dead ends: 26656 [2022-11-18 20:33:38,256 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 569 GetRequests, 410 SyntacticMatches, 1 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9629 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=3419, Invalid=22021, Unknown=0, NotChecked=0, Total=25440 [2022-11-18 20:33:38,257 INFO L413 NwaCegarLoop]: 1301 mSDtfsCounter, 3629 mSDsluCounter, 8552 mSDsCounter, 0 mSdLazyCounter, 7813 mSolverCounterSat, 3680 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3629 SdHoareTripleChecker+Valid, 9853 SdHoareTripleChecker+Invalid, 11493 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 3680 IncrementalHoareTripleChecker+Valid, 7813 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.4s IncrementalHoareTripleChecker+Time [2022-11-18 20:33:38,257 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3629 Valid, 9853 Invalid, 11493 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [3680 Valid, 7813 Invalid, 0 Unknown, 0 Unchecked, 7.4s Time] [2022-11-18 20:33:38,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26656 states. [2022-11-18 20:33:43,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26656 to 16680. [2022-11-18 20:33:43,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16680 states, 12399 states have (on average 1.275586740866199) internal successors, (15816), 12512 states have internal predecessors, (15816), 2734 states have call successors, (2734), 1546 states have call predecessors, (2734), 1546 states have return successors, (2734), 2621 states have call predecessors, (2734), 2734 states have call successors, (2734) [2022-11-18 20:33:43,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16680 states to 16680 states and 21284 transitions. [2022-11-18 20:33:43,884 INFO L78 Accepts]: Start accepts. Automaton has 16680 states and 21284 transitions. Word has length 177 [2022-11-18 20:33:43,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:33:43,885 INFO L495 AbstractCegarLoop]: Abstraction has 16680 states and 21284 transitions. [2022-11-18 20:33:43,885 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 12.631578947368421) internal successors, (240), 18 states have internal predecessors, (240), 8 states have call successors, (45), 4 states have call predecessors, (45), 6 states have return successors, (44), 9 states have call predecessors, (44), 8 states have call successors, (44) [2022-11-18 20:33:43,886 INFO L276 IsEmpty]: Start isEmpty. Operand 16680 states and 21284 transitions. [2022-11-18 20:33:43,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2022-11-18 20:33:43,891 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:33:43,891 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:33:43,899 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d29f079-78c4-4116-83da-dc1ebb38fecd/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-18 20:33:44,097 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d29f079-78c4-4116-83da-dc1ebb38fecd/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:33:44,097 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:33:44,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:33:44,097 INFO L85 PathProgramCache]: Analyzing trace with hash -1778707627, now seen corresponding path program 1 times [2022-11-18 20:33:44,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:33:44,098 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487855193] [2022-11-18 20:33:44,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:33:44,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:33:44,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:33:44,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-18 20:33:44,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:33:44,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-18 20:33:44,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:33:44,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-11-18 20:33:44,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:33:44,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-11-18 20:33:44,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:33:44,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-11-18 20:33:44,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:33:44,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-11-18 20:33:44,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:33:44,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-11-18 20:33:44,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:33:44,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-11-18 20:33:44,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:33:44,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-11-18 20:33:44,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:33:44,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-11-18 20:33:44,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:33:44,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-11-18 20:33:44,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:33:44,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-11-18 20:33:44,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:33:44,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-11-18 20:33:44,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:33:44,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2022-11-18 20:33:44,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:33:44,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-11-18 20:33:44,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:33:44,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2022-11-18 20:33:44,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:33:44,460 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2022-11-18 20:33:44,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:33:44,461 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487855193] [2022-11-18 20:33:44,461 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [487855193] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:33:44,462 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:33:44,462 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-18 20:33:44,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935811425] [2022-11-18 20:33:44,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:33:44,464 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-18 20:33:44,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:33:44,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-18 20:33:44,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-18 20:33:44,465 INFO L87 Difference]: Start difference. First operand 16680 states and 21284 transitions. Second operand has 7 states, 7 states have (on average 15.714285714285714) internal successors, (110), 6 states have internal predecessors, (110), 3 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) [2022-11-18 20:33:52,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:33:52,334 INFO L93 Difference]: Finished difference Result 35084 states and 46017 transitions. [2022-11-18 20:33:52,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-18 20:33:52,335 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.714285714285714) internal successors, (110), 6 states have internal predecessors, (110), 3 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) Word has length 178 [2022-11-18 20:33:52,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:33:52,398 INFO L225 Difference]: With dead ends: 35084 [2022-11-18 20:33:52,398 INFO L226 Difference]: Without dead ends: 20714 [2022-11-18 20:33:52,421 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2022-11-18 20:33:52,422 INFO L413 NwaCegarLoop]: 499 mSDtfsCounter, 601 mSDsluCounter, 1586 mSDsCounter, 0 mSdLazyCounter, 369 mSolverCounterSat, 175 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 604 SdHoareTripleChecker+Valid, 2085 SdHoareTripleChecker+Invalid, 544 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 175 IncrementalHoareTripleChecker+Valid, 369 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-18 20:33:52,422 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [604 Valid, 2085 Invalid, 544 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [175 Valid, 369 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-18 20:33:52,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20714 states. [2022-11-18 20:33:57,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20714 to 16670. [2022-11-18 20:33:57,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16670 states, 12389 states have (on average 1.2741948502704012) internal successors, (15786), 12502 states have internal predecessors, (15786), 2734 states have call successors, (2734), 1546 states have call predecessors, (2734), 1546 states have return successors, (2734), 2621 states have call predecessors, (2734), 2734 states have call successors, (2734) [2022-11-18 20:33:57,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16670 states to 16670 states and 21254 transitions. [2022-11-18 20:33:57,715 INFO L78 Accepts]: Start accepts. Automaton has 16670 states and 21254 transitions. Word has length 178 [2022-11-18 20:33:57,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:33:57,716 INFO L495 AbstractCegarLoop]: Abstraction has 16670 states and 21254 transitions. [2022-11-18 20:33:57,716 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.714285714285714) internal successors, (110), 6 states have internal predecessors, (110), 3 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) [2022-11-18 20:33:57,716 INFO L276 IsEmpty]: Start isEmpty. Operand 16670 states and 21254 transitions. [2022-11-18 20:33:57,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2022-11-18 20:33:57,720 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:33:57,720 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:33:57,720 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2022-11-18 20:33:57,720 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:33:57,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:33:57,721 INFO L85 PathProgramCache]: Analyzing trace with hash 2012173287, now seen corresponding path program 1 times [2022-11-18 20:33:57,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:33:57,721 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900357921] [2022-11-18 20:33:57,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:33:57,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:33:57,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:33:58,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-18 20:33:58,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:33:58,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-18 20:33:58,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:33:58,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-18 20:33:58,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:33:58,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-11-18 20:33:58,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:33:58,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-11-18 20:33:58,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:33:58,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-11-18 20:33:58,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:33:58,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-11-18 20:33:58,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:33:58,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-11-18 20:33:58,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:33:58,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-11-18 20:33:58,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:33:58,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-11-18 20:33:58,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:33:58,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-11-18 20:33:58,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:33:58,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-11-18 20:33:58,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:33:58,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-11-18 20:33:58,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:33:58,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-11-18 20:33:58,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:33:58,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2022-11-18 20:33:58,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:33:58,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2022-11-18 20:33:58,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:33:58,313 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 20 proven. 6 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2022-11-18 20:33:58,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:33:58,313 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900357921] [2022-11-18 20:33:58,313 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [900357921] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:33:58,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [77024164] [2022-11-18 20:33:58,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:33:58,314 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:33:58,314 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d29f079-78c4-4116-83da-dc1ebb38fecd/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:33:58,316 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d29f079-78c4-4116-83da-dc1ebb38fecd/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:33:58,324 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d29f079-78c4-4116-83da-dc1ebb38fecd/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-18 20:33:58,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:33:58,537 INFO L263 TraceCheckSpWp]: Trace formula consists of 794 conjuncts, 16 conjunts are in the unsatisfiable core [2022-11-18 20:33:58,540 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:33:58,837 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 28 proven. 54 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-11-18 20:33:58,838 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:33:59,084 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 14 proven. 16 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2022-11-18 20:33:59,085 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [77024164] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:33:59,085 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 20:33:59,085 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 16 [2022-11-18 20:33:59,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119236081] [2022-11-18 20:33:59,085 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 20:33:59,086 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-11-18 20:33:59,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:33:59,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-11-18 20:33:59,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2022-11-18 20:33:59,087 INFO L87 Difference]: Start difference. First operand 16670 states and 21254 transitions. Second operand has 16 states, 16 states have (on average 15.1875) internal successors, (243), 15 states have internal predecessors, (243), 7 states have call successors, (47), 4 states have call predecessors, (47), 6 states have return successors, (46), 8 states have call predecessors, (46), 7 states have call successors, (46) [2022-11-18 20:34:26,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:34:26,664 INFO L93 Difference]: Finished difference Result 53755 states and 72813 transitions. [2022-11-18 20:34:26,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2022-11-18 20:34:26,672 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 15.1875) internal successors, (243), 15 states have internal predecessors, (243), 7 states have call successors, (47), 4 states have call predecessors, (47), 6 states have return successors, (46), 8 states have call predecessors, (46), 7 states have call successors, (46) Word has length 178 [2022-11-18 20:34:26,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:34:26,795 INFO L225 Difference]: With dead ends: 53755 [2022-11-18 20:34:26,796 INFO L226 Difference]: Without dead ends: 38292 [2022-11-18 20:34:26,823 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 579 GetRequests, 460 SyntacticMatches, 1 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5057 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=1944, Invalid=12336, Unknown=0, NotChecked=0, Total=14280 [2022-11-18 20:34:26,825 INFO L413 NwaCegarLoop]: 1229 mSDtfsCounter, 3146 mSDsluCounter, 8118 mSDsCounter, 0 mSdLazyCounter, 8745 mSolverCounterSat, 3125 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3146 SdHoareTripleChecker+Valid, 9347 SdHoareTripleChecker+Invalid, 11870 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 3125 IncrementalHoareTripleChecker+Valid, 8745 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.1s IncrementalHoareTripleChecker+Time [2022-11-18 20:34:26,827 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3146 Valid, 9347 Invalid, 11870 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [3125 Valid, 8745 Invalid, 0 Unknown, 0 Unchecked, 8.1s Time] [2022-11-18 20:34:26,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38292 states. [2022-11-18 20:34:33,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38292 to 20911. [2022-11-18 20:34:33,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20911 states, 15496 states have (on average 1.2762648425400103) internal successors, (19777), 15646 states have internal predecessors, (19777), 3464 states have call successors, (3464), 1950 states have call predecessors, (3464), 1950 states have return successors, (3464), 3314 states have call predecessors, (3464), 3464 states have call successors, (3464) [2022-11-18 20:34:33,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20911 states to 20911 states and 26705 transitions. [2022-11-18 20:34:33,723 INFO L78 Accepts]: Start accepts. Automaton has 20911 states and 26705 transitions. Word has length 178 [2022-11-18 20:34:33,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:34:33,723 INFO L495 AbstractCegarLoop]: Abstraction has 20911 states and 26705 transitions. [2022-11-18 20:34:33,723 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 15.1875) internal successors, (243), 15 states have internal predecessors, (243), 7 states have call successors, (47), 4 states have call predecessors, (47), 6 states have return successors, (46), 8 states have call predecessors, (46), 7 states have call successors, (46) [2022-11-18 20:34:33,723 INFO L276 IsEmpty]: Start isEmpty. Operand 20911 states and 26705 transitions. [2022-11-18 20:34:33,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2022-11-18 20:34:33,727 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:34:33,727 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:34:33,732 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d29f079-78c4-4116-83da-dc1ebb38fecd/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-18 20:34:33,927 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d29f079-78c4-4116-83da-dc1ebb38fecd/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2022-11-18 20:34:33,928 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:34:33,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:34:33,928 INFO L85 PathProgramCache]: Analyzing trace with hash -1051233495, now seen corresponding path program 1 times [2022-11-18 20:34:33,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:34:33,928 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624424326] [2022-11-18 20:34:33,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:34:33,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:34:33,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:34,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-18 20:34:34,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:34,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-18 20:34:34,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:34,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-11-18 20:34:34,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:34,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-11-18 20:34:34,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:34,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-11-18 20:34:34,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:34,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-11-18 20:34:34,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:34,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-11-18 20:34:34,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:34,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-11-18 20:34:34,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:34,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-11-18 20:34:34,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:34,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-11-18 20:34:34,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:34,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-11-18 20:34:34,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:34,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-11-18 20:34:34,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:34,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-11-18 20:34:34,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:34,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2022-11-18 20:34:34,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:34,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2022-11-18 20:34:34,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:34,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2022-11-18 20:34:34,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:34,189 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 29 proven. 2 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2022-11-18 20:34:34,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:34:34,190 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624424326] [2022-11-18 20:34:34,190 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624424326] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:34:34,190 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [734269833] [2022-11-18 20:34:34,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:34:34,191 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:34:34,191 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d29f079-78c4-4116-83da-dc1ebb38fecd/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:34:34,192 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d29f079-78c4-4116-83da-dc1ebb38fecd/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:34:34,203 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d29f079-78c4-4116-83da-dc1ebb38fecd/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-18 20:34:34,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:34,382 INFO L263 TraceCheckSpWp]: Trace formula consists of 779 conjuncts, 11 conjunts are in the unsatisfiable core [2022-11-18 20:34:34,385 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:34:34,586 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 52 proven. 4 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2022-11-18 20:34:34,586 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:34:34,810 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 29 proven. 2 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2022-11-18 20:34:34,810 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [734269833] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:34:34,810 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 20:34:34,810 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 9 [2022-11-18 20:34:34,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703035518] [2022-11-18 20:34:34,811 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 20:34:34,811 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-18 20:34:34,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:34:34,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-18 20:34:34,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-11-18 20:34:34,813 INFO L87 Difference]: Start difference. First operand 20911 states and 26705 transitions. Second operand has 9 states, 9 states have (on average 17.0) internal successors, (153), 8 states have internal predecessors, (153), 3 states have call successors, (30), 4 states have call predecessors, (30), 7 states have return successors, (31), 4 states have call predecessors, (31), 3 states have call successors, (31) [2022-11-18 20:34:45,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:34:45,211 INFO L93 Difference]: Finished difference Result 48591 states and 63877 transitions. [2022-11-18 20:34:45,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-18 20:34:45,211 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 17.0) internal successors, (153), 8 states have internal predecessors, (153), 3 states have call successors, (30), 4 states have call predecessors, (30), 7 states have return successors, (31), 4 states have call predecessors, (31), 3 states have call successors, (31) Word has length 179 [2022-11-18 20:34:45,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:34:45,265 INFO L225 Difference]: With dead ends: 48591 [2022-11-18 20:34:45,265 INFO L226 Difference]: Without dead ends: 27860 [2022-11-18 20:34:45,283 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 399 GetRequests, 385 SyntacticMatches, 4 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2022-11-18 20:34:45,284 INFO L413 NwaCegarLoop]: 368 mSDtfsCounter, 220 mSDsluCounter, 1987 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 2355 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 20:34:45,284 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [245 Valid, 2355 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 20:34:45,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27860 states. [2022-11-18 20:34:51,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27860 to 20911. [2022-11-18 20:34:51,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20911 states, 15496 states have (on average 1.2760712441920496) internal successors, (19774), 15646 states have internal predecessors, (19774), 3464 states have call successors, (3464), 1950 states have call predecessors, (3464), 1950 states have return successors, (3464), 3314 states have call predecessors, (3464), 3464 states have call successors, (3464) [2022-11-18 20:34:51,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20911 states to 20911 states and 26702 transitions. [2022-11-18 20:34:51,959 INFO L78 Accepts]: Start accepts. Automaton has 20911 states and 26702 transitions. Word has length 179 [2022-11-18 20:34:51,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:34:51,960 INFO L495 AbstractCegarLoop]: Abstraction has 20911 states and 26702 transitions. [2022-11-18 20:34:51,960 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 17.0) internal successors, (153), 8 states have internal predecessors, (153), 3 states have call successors, (30), 4 states have call predecessors, (30), 7 states have return successors, (31), 4 states have call predecessors, (31), 3 states have call successors, (31) [2022-11-18 20:34:51,960 INFO L276 IsEmpty]: Start isEmpty. Operand 20911 states and 26702 transitions. [2022-11-18 20:34:51,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2022-11-18 20:34:51,964 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:34:51,964 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:34:51,969 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d29f079-78c4-4116-83da-dc1ebb38fecd/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-18 20:34:52,164 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d29f079-78c4-4116-83da-dc1ebb38fecd/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2022-11-18 20:34:52,165 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:34:52,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:34:52,165 INFO L85 PathProgramCache]: Analyzing trace with hash -1307283623, now seen corresponding path program 1 times [2022-11-18 20:34:52,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:34:52,165 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941963841] [2022-11-18 20:34:52,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:34:52,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:34:52,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:52,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-18 20:34:52,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:52,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-18 20:34:52,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:52,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-11-18 20:34:52,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:52,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-11-18 20:34:52,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:52,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-11-18 20:34:52,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:52,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-11-18 20:34:52,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:52,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-11-18 20:34:52,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:52,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-11-18 20:34:52,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:52,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-11-18 20:34:52,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:52,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-11-18 20:34:52,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:52,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-11-18 20:34:52,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:52,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-11-18 20:34:52,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:52,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-11-18 20:34:52,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:52,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2022-11-18 20:34:52,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:52,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2022-11-18 20:34:52,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:52,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2022-11-18 20:34:52,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:52,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2022-11-18 20:34:52,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:52,458 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 29 proven. 6 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2022-11-18 20:34:52,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:34:52,459 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941963841] [2022-11-18 20:34:52,459 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [941963841] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:34:52,459 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [946539729] [2022-11-18 20:34:52,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:34:52,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:34:52,460 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d29f079-78c4-4116-83da-dc1ebb38fecd/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:34:52,461 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d29f079-78c4-4116-83da-dc1ebb38fecd/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:34:52,468 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d29f079-78c4-4116-83da-dc1ebb38fecd/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-18 20:34:52,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:52,659 INFO L263 TraceCheckSpWp]: Trace formula consists of 797 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-18 20:34:52,662 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:34:52,797 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 67 proven. 4 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2022-11-18 20:34:52,797 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:34:52,949 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 29 proven. 6 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2022-11-18 20:34:52,950 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [946539729] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:34:52,950 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 20:34:52,950 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 9 [2022-11-18 20:34:52,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159181453] [2022-11-18 20:34:52,950 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 20:34:52,951 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-18 20:34:52,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:34:52,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-18 20:34:52,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-11-18 20:34:52,952 INFO L87 Difference]: Start difference. First operand 20911 states and 26702 transitions. Second operand has 9 states, 9 states have (on average 17.666666666666668) internal successors, (159), 8 states have internal predecessors, (159), 3 states have call successors, (32), 4 states have call predecessors, (32), 7 states have return successors, (33), 4 states have call predecessors, (33), 3 states have call successors, (33) [2022-11-18 20:35:02,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:35:02,980 INFO L93 Difference]: Finished difference Result 48639 states and 63941 transitions. [2022-11-18 20:35:02,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-18 20:35:02,981 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 17.666666666666668) internal successors, (159), 8 states have internal predecessors, (159), 3 states have call successors, (32), 4 states have call predecessors, (32), 7 states have return successors, (33), 4 states have call predecessors, (33), 3 states have call successors, (33) Word has length 187 [2022-11-18 20:35:02,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:35:03,036 INFO L225 Difference]: With dead ends: 48639 [2022-11-18 20:35:03,036 INFO L226 Difference]: Without dead ends: 27908 [2022-11-18 20:35:03,055 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 417 GetRequests, 405 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2022-11-18 20:35:03,055 INFO L413 NwaCegarLoop]: 367 mSDtfsCounter, 214 mSDsluCounter, 1966 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 238 SdHoareTripleChecker+Valid, 2333 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-18 20:35:03,055 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [238 Valid, 2333 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-18 20:35:03,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27908 states. [2022-11-18 20:35:11,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27908 to 20911. [2022-11-18 20:35:11,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20911 states, 15496 states have (on average 1.2758776458440888) internal successors, (19771), 15646 states have internal predecessors, (19771), 3464 states have call successors, (3464), 1950 states have call predecessors, (3464), 1950 states have return successors, (3464), 3314 states have call predecessors, (3464), 3464 states have call successors, (3464) [2022-11-18 20:35:11,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20911 states to 20911 states and 26699 transitions. [2022-11-18 20:35:11,437 INFO L78 Accepts]: Start accepts. Automaton has 20911 states and 26699 transitions. Word has length 187 [2022-11-18 20:35:11,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:35:11,437 INFO L495 AbstractCegarLoop]: Abstraction has 20911 states and 26699 transitions. [2022-11-18 20:35:11,438 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 17.666666666666668) internal successors, (159), 8 states have internal predecessors, (159), 3 states have call successors, (32), 4 states have call predecessors, (32), 7 states have return successors, (33), 4 states have call predecessors, (33), 3 states have call successors, (33) [2022-11-18 20:35:11,438 INFO L276 IsEmpty]: Start isEmpty. Operand 20911 states and 26699 transitions. [2022-11-18 20:35:11,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2022-11-18 20:35:11,442 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:35:11,442 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:35:11,447 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d29f079-78c4-4116-83da-dc1ebb38fecd/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-11-18 20:35:11,642 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d29f079-78c4-4116-83da-dc1ebb38fecd/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable40 [2022-11-18 20:35:11,643 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:35:11,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:35:11,643 INFO L85 PathProgramCache]: Analyzing trace with hash -673539533, now seen corresponding path program 1 times [2022-11-18 20:35:11,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:35:11,643 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778269419] [2022-11-18 20:35:11,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:35:11,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:35:11,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-18 20:35:11,716 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-18 20:35:11,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-18 20:35:11,906 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-18 20:35:11,907 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-18 20:35:11,908 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-18 20:35:11,910 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2022-11-18 20:35:11,915 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:35:11,920 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-18 20:35:12,100 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 08:35:12 BoogieIcfgContainer [2022-11-18 20:35:12,100 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-18 20:35:12,101 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-18 20:35:12,101 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-18 20:35:12,101 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-18 20:35:12,102 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:30:09" (3/4) ... [2022-11-18 20:35:12,104 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-18 20:35:12,341 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d29f079-78c4-4116-83da-dc1ebb38fecd/bin/uautomizer-TMbwUNV5ro/witness.graphml [2022-11-18 20:35:12,342 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-18 20:35:12,345 INFO L158 Benchmark]: Toolchain (without parser) took 304534.39ms. Allocated memory was 130.0MB in the beginning and 4.8GB in the end (delta: 4.7GB). Free memory was 84.6MB in the beginning and 3.6GB in the end (delta: -3.5GB). Peak memory consumption was 1.2GB. Max. memory is 16.1GB. [2022-11-18 20:35:12,345 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 130.0MB. Free memory is still 102.0MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-18 20:35:12,346 INFO L158 Benchmark]: CACSL2BoogieTranslator took 584.82ms. Allocated memory is still 130.0MB. Free memory was 84.4MB in the beginning and 93.8MB in the end (delta: -9.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-11-18 20:35:12,346 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.25ms. Allocated memory is still 130.0MB. Free memory was 93.8MB in the beginning and 90.4MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-18 20:35:12,346 INFO L158 Benchmark]: Boogie Preprocessor took 38.06ms. Allocated memory is still 130.0MB. Free memory was 90.4MB in the beginning and 87.6MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-18 20:35:12,346 INFO L158 Benchmark]: RCFGBuilder took 913.13ms. Allocated memory is still 130.0MB. Free memory was 87.6MB in the beginning and 55.8MB in the end (delta: 31.8MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2022-11-18 20:35:12,346 INFO L158 Benchmark]: TraceAbstraction took 302686.62ms. Allocated memory was 130.0MB in the beginning and 4.8GB in the end (delta: 4.7GB). Free memory was 55.1MB in the beginning and 3.6GB in the end (delta: -3.5GB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. [2022-11-18 20:35:12,347 INFO L158 Benchmark]: Witness Printer took 240.80ms. Allocated memory is still 4.8GB. Free memory was 3.6GB in the beginning and 3.6GB in the end (delta: 31.7MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2022-11-18 20:35:12,348 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.24ms. Allocated memory is still 130.0MB. Free memory is still 102.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 584.82ms. Allocated memory is still 130.0MB. Free memory was 84.4MB in the beginning and 93.8MB in the end (delta: -9.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 55.25ms. Allocated memory is still 130.0MB. Free memory was 93.8MB in the beginning and 90.4MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 38.06ms. Allocated memory is still 130.0MB. Free memory was 90.4MB in the beginning and 87.6MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 913.13ms. Allocated memory is still 130.0MB. Free memory was 87.6MB in the beginning and 55.8MB in the end (delta: 31.8MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * TraceAbstraction took 302686.62ms. Allocated memory was 130.0MB in the beginning and 4.8GB in the end (delta: 4.7GB). Free memory was 55.1MB in the beginning and 3.6GB in the end (delta: -3.5GB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. * Witness Printer took 240.80ms. Allocated memory is still 4.8GB. Free memory was 3.6GB in the beginning and 3.6GB in the end (delta: 31.7MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 618]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L25] port_t cs1 ; [L28] port_t cs2 ; [L48] int8_t s2p_new ; [L32] int8_t s1s2_old ; [L27] int8_t cs1_new ; [L31] port_t s1s2 ; [L36] int8_t s1s1_new ; [L37] port_t s2s1 ; [L34] port_t s1s1 ; [L40] port_t s2s2 ; [L26] int8_t cs1_old ; [L62] static _Bool side1Failed_History_2 ; [L61] static _Bool side1Failed_History_1 ; [L60] static _Bool side1Failed_History_0 ; [L47] int8_t s2p_old ; [L30] int8_t cs2_new ; [L70] static msg_t manual_selection_History_1 ; [L71] static msg_t manual_selection_History_2 ; [L45] int8_t s1p_new ; [L54] msg_t side2_written ; [L43] port_t s1p ; [L69] static msg_t manual_selection_History_0 ; [L42] int8_t s2s2_new ; [L29] int8_t cs2_old ; [L44] int8_t s1p_old ; [L65] static _Bool side2Failed_History_2 ; [L38] int8_t s2s1_old ; [L24] msg_t nomsg = (msg_t )-1; [L64] static _Bool side2Failed_History_1 ; [L63] static _Bool side2Failed_History_0 ; [L39] int8_t s2s1_new ; [L51] _Bool side1Failed ; [L41] int8_t s2s2_old ; [L53] msg_t side1_written ; [L46] port_t s2p ; [L35] int8_t s1s1_old ; [L66] static int8_t active_side_History_0 ; [L67] static int8_t active_side_History_1 ; [L52] _Bool side2Failed ; [L68] static int8_t active_side_History_2 ; [L33] int8_t s1s2_new ; VAL [active_side_History_0=0, active_side_History_1=0, active_side_History_2=0, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L542] int c1 ; [L543] int i2 ; [L546] c1 = 0 [L547] side1Failed = __VERIFIER_nondet_bool() [L548] side2Failed = __VERIFIER_nondet_bool() [L549] side1_written = __VERIFIER_nondet_char() [L550] side2_written = __VERIFIER_nondet_char() [L551] side1Failed_History_0 = __VERIFIER_nondet_bool() [L552] side1Failed_History_1 = __VERIFIER_nondet_bool() [L553] side1Failed_History_2 = __VERIFIER_nondet_bool() [L554] side2Failed_History_0 = __VERIFIER_nondet_bool() [L555] side2Failed_History_1 = __VERIFIER_nondet_bool() [L556] side2Failed_History_2 = __VERIFIER_nondet_bool() [L557] active_side_History_0 = __VERIFIER_nondet_char() [L558] active_side_History_1 = __VERIFIER_nondet_char() [L559] active_side_History_2 = __VERIFIER_nondet_char() [L560] manual_selection_History_0 = __VERIFIER_nondet_char() [L561] manual_selection_History_1 = __VERIFIER_nondet_char() [L562] manual_selection_History_2 = __VERIFIER_nondet_char() [L563] CALL, EXPR init() [L197] COND FALSE !((int )side1Failed_History_0 != 0) VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=0, side1Failed_History_0=0, side2_written=0] [L200] COND FALSE !((int )side2Failed_History_0 != 0) VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=0, side1Failed_History_0=0, side2_written=0, side2Failed_History_0=0] [L203] COND FALSE !((int )active_side_History_0 != -2) VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=0, side1Failed_History_0=0, side2_written=0, side2Failed_History_0=0] [L206] COND FALSE !((int )manual_selection_History_0 != 0) VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=0, side1Failed_History_0=0, side2_written=0, side2Failed_History_0=0] [L209] COND FALSE !((int )side1Failed_History_1 != 0) VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=0, side1Failed_History_0=0, side1Failed_History_1=0, side2_written=0, side2Failed_History_0=0] [L212] COND FALSE !((int )side2Failed_History_1 != 0) VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=0, side1Failed_History_0=0, side1Failed_History_1=0, side2_written=0, side2Failed_History_0=0, side2Failed_History_1=0] [L215] COND FALSE !((int )active_side_History_1 != -2) VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=0, side1Failed_History_0=0, side1Failed_History_1=0, side2_written=0, side2Failed_History_0=0, side2Failed_History_1=0] [L218] COND FALSE !((int )manual_selection_History_1 != 0) VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=0, side1Failed_History_0=0, side1Failed_History_1=0, side2_written=0, side2Failed_History_0=0, side2Failed_History_1=0] [L221] COND FALSE !((int )side1Failed_History_2 != 0) VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed_History_0=0, side2Failed_History_1=0] [L224] COND FALSE !((int )side2Failed_History_2 != 0) VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L227] COND FALSE !((int )active_side_History_2 != -2) VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L230] COND FALSE !((int )manual_selection_History_2 != 0) [L233] return (1); VAL [\result=1, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L563] RET, EXPR init() [L563] i2 = init() [L564] CALL assume_abort_if_not(i2) VAL [\old(cond)=1, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L58] COND FALSE !(!cond) VAL [\old(cond)=1, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cond=1, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L564] RET assume_abort_if_not(i2) VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, c1=0, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, i2=1, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L565] cs1_old = nomsg [L566] cs1_new = nomsg [L567] cs2_old = nomsg [L568] cs2_new = nomsg [L569] s1s2_old = nomsg [L570] s1s2_new = nomsg [L571] s1s1_old = nomsg [L572] s1s1_new = nomsg [L573] s2s1_old = nomsg [L574] s2s1_new = nomsg [L575] s2s2_old = nomsg [L576] s2s2_new = nomsg [L577] s1p_old = nomsg [L578] s1p_new = nomsg [L579] s2p_old = nomsg [L580] s2p_new = nomsg [L581] i2 = 0 VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, c1=0, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, i2=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L582] COND TRUE 1 [L584] CALL Console_task_each_pals_period() [L251] msg_t manual_selection ; [L252] char tmp ; [L255] tmp = __VERIFIER_nondet_char() [L256] manual_selection = tmp [L257] CALL write_manual_selection_history(manual_selection) [L167] manual_selection_History_2 = manual_selection_History_1 [L168] manual_selection_History_1 = manual_selection_History_0 [L169] manual_selection_History_0 = val VAL [\old(val)=127, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, val=127] [L257] RET write_manual_selection_history(manual_selection) [L258] cs1_new = manual_selection != nomsg && cs1_new == nomsg ? manual_selection : cs1_new [L259] cs2_new = manual_selection != nomsg && cs2_new == nomsg ? manual_selection : cs2_new [L260] manual_selection = (msg_t )0 VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=127, cs1_old=-1, cs2=0, cs2_new=127, cs2_old=-1, manual_selection=0, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=127] [L584] RET Console_task_each_pals_period() [L585] CALL Side1_activestandby_task_each_pals_period() [L266] int8_t side1 ; [L267] int8_t side2 ; [L268] msg_t manual_selection ; [L269] int8_t next_state ; [L272] side1 = nomsg [L273] side2 = nomsg [L274] manual_selection = (msg_t )0 [L275] side1Failed = __VERIFIER_nondet_bool() [L276] CALL write_side1_failed_history(side1Failed) [L77] side1Failed_History_2 = side1Failed_History_1 [L78] side1Failed_History_1 = side1Failed_History_0 [L79] side1Failed_History_0 = val VAL [\old(val)=-255, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=127, cs1_old=-1, cs2=0, cs2_new=127, cs2_old=-1, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=0, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, val=-255] [L276] RET write_side1_failed_history(side1Failed) [L277] COND TRUE \read(side1Failed) [L278] s1s1_new = nomsg != nomsg && s1s1_new == nomsg ? nomsg : s1s1_new [L279] s1s2_new = nomsg != nomsg && s1s2_new == nomsg ? nomsg : s1s2_new [L280] s1p_new = nomsg != nomsg && s1p_new == nomsg ? nomsg : s1p_new [L281] side1_written = nomsg VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=127, cs1_old=-1, cs2=0, cs2_new=127, cs2_old=-1, manual_selection=0, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2=-1, side2_written=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L585] RET Side1_activestandby_task_each_pals_period() [L586] CALL Side2_activestandby_task_each_pals_period() [L323] int8_t side1 ; [L324] int8_t side2 ; [L325] msg_t manual_selection ; [L326] int8_t next_state ; [L329] side1 = nomsg [L330] side2 = nomsg [L331] manual_selection = (msg_t )0 [L332] side2Failed = __VERIFIER_nondet_bool() [L333] CALL write_side2_failed_history(side2Failed) [L107] side2Failed_History_2 = side2Failed_History_1 [L108] side2Failed_History_1 = side2Failed_History_0 [L109] side2Failed_History_0 = val VAL [\old(val)=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=127, cs1_old=-1, cs2=0, cs2_new=127, cs2_old=-1, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, val=0] [L333] RET write_side2_failed_history(side2Failed) [L334] COND FALSE !(\read(side2Failed)) [L341] side1 = s1s2_old [L342] s1s2_old = nomsg [L343] side2 = s2s2_old [L344] s2s2_old = nomsg [L345] manual_selection = cs2_old [L346] cs2_old = nomsg VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=127, cs1_old=-1, cs2=0, cs2_new=127, cs2_old=-1, manual_selection=-1, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2=-1, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L347] COND TRUE (int )side1 == (int )side2 [L348] next_state = (int8_t )0 VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=127, cs1_old=-1, cs2=0, cs2_new=127, cs2_old=-1, manual_selection=-1, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, next_state=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2=-1, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L371] s2s1_new = next_state != nomsg && s2s1_new == nomsg ? next_state : s2s1_new [L372] s2s2_new = next_state != nomsg && s2s2_new == nomsg ? next_state : s2s2_new [L373] s2p_new = next_state != nomsg && s2p_new == nomsg ? next_state : s2p_new [L374] side2_written = next_state VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=127, cs1_old=-1, cs2=0, cs2_new=127, cs2_old=-1, manual_selection=-1, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, next_state=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=0, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=-1, s2s2=0, s2s2_new=0, s2s2_old=-1, side1=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2=-1, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L586] RET Side2_activestandby_task_each_pals_period() [L587] CALL Pendulum_prism_task_each_pals_period() [L380] int8_t active_side ; [L381] int8_t tmp ; [L382] int8_t side1 ; [L383] int8_t side2 ; VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=127, cs1_old=-1, cs2=0, cs2_new=127, cs2_old=-1, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=0, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=-1, s2s2=0, s2s2_new=0, s2s2_old=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L386] CALL, EXPR read_active_side_history((unsigned char)0) VAL [\old(index)=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=127, cs1_old=-1, cs2=0, cs2_new=127, cs2_old=-1, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=0, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=-1, s2s2=0, s2s2_new=0, s2s2_old=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L148] COND TRUE (int )index == 0 [L149] return (active_side_History_0); VAL [\old(index)=0, \result=-2, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=127, cs1_old=-1, cs2=0, cs2_new=127, cs2_old=-1, index=0, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=0, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=-1, s2s2=0, s2s2_new=0, s2s2_old=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L386] RET, EXPR read_active_side_history((unsigned char)0) VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=127, cs1_old=-1, cs2=0, cs2_new=127, cs2_old=-1, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, read_active_side_history((unsigned char)0)=-2, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=0, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=-1, s2s2=0, s2s2_new=0, s2s2_old=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L386] tmp = read_active_side_history((unsigned char)0) [L387] active_side = tmp [L388] side1 = nomsg [L389] side2 = nomsg [L390] side1 = s1p_old [L391] s1p_old = nomsg [L392] side2 = s2p_old [L393] s2p_old = nomsg VAL [active_side=-2, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=127, cs1_old=-1, cs2=0, cs2_new=127, cs2_old=-1, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=0, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=-1, s2s2=0, s2s2_new=0, s2s2_old=-1, side1=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2=-1, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=-2] [L394] COND FALSE !((int )side1 == 1) VAL [active_side=-2, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=127, cs1_old=-1, cs2=0, cs2_new=127, cs2_old=-1, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=0, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=-1, s2s2=0, s2s2_new=0, s2s2_old=-1, side1=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2=-1, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=-2] [L397] COND FALSE !((int )side2 == 1) VAL [active_side=-2, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=127, cs1_old=-1, cs2=0, cs2_new=127, cs2_old=-1, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=0, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=-1, s2s2=0, s2s2_new=0, s2s2_old=-1, side1=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2=-1, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=-2] [L400] COND FALSE !((int )side1 == 0) VAL [active_side=-2, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=127, cs1_old=-1, cs2=0, cs2_new=127, cs2_old=-1, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=0, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=-1, s2s2=0, s2s2_new=0, s2s2_old=-1, side1=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2=-1, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=-2] [L408] COND TRUE (int )side1 == (int )nomsg VAL [active_side=-2, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=127, cs1_old=-1, cs2=0, cs2_new=127, cs2_old=-1, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=0, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=-1, s2s2=0, s2s2_new=0, s2s2_old=-1, side1=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2=-1, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=-2] [L409] COND FALSE !((int )side2 == 0) [L412] active_side = (int8_t )0 VAL [active_side=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=127, cs1_old=-1, cs2=0, cs2_new=127, cs2_old=-1, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=0, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=-1, s2s2=0, s2s2_new=0, s2s2_old=-1, side1=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2=-1, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=-2] [L417] CALL write_active_side_history(active_side) [L137] active_side_History_2 = active_side_History_1 [L138] active_side_History_1 = active_side_History_0 [L139] active_side_History_0 = val VAL [\old(val)=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=127, cs1_old=-1, cs2=0, cs2_new=127, cs2_old=-1, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=0, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=-1, s2s2=0, s2s2_new=0, s2s2_old=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, val=0] [L417] RET write_active_side_history(active_side) [L587] RET Pendulum_prism_task_each_pals_period() [L588] cs1_old = cs1_new [L589] cs1_new = nomsg [L590] cs2_old = cs2_new [L591] cs2_new = nomsg [L592] s1s2_old = s1s2_new [L593] s1s2_new = nomsg [L594] s1s1_old = s1s1_new [L595] s1s1_new = nomsg [L596] s2s1_old = s2s1_new [L597] s2s1_new = nomsg [L598] s2s2_old = s2s2_new [L599] s2s2_new = nomsg [L600] s1p_old = s1p_new [L601] s1p_new = nomsg [L602] s2p_old = s2p_new [L603] s2p_new = nomsg [L604] CALL, EXPR check() [L423] int tmp ; [L424] msg_t tmp___0 ; [L425] _Bool tmp___1 ; [L426] _Bool tmp___2 ; [L427] _Bool tmp___3 ; [L428] _Bool tmp___4 ; [L429] int8_t tmp___5 ; [L430] _Bool tmp___6 ; [L431] _Bool tmp___7 ; [L432] _Bool tmp___8 ; [L433] int8_t tmp___9 ; [L434] _Bool tmp___10 ; [L435] _Bool tmp___11 ; [L436] _Bool tmp___12 ; [L437] msg_t tmp___13 ; [L438] _Bool tmp___14 ; [L439] _Bool tmp___15 ; [L440] _Bool tmp___16 ; [L441] _Bool tmp___17 ; [L442] int8_t tmp___18 ; [L443] int8_t tmp___19 ; [L444] int8_t tmp___20 ; VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L447] COND FALSE !(! side1Failed) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L450] COND TRUE ! side2Failed [L451] tmp = 1 VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1] [L455] CALL assume_abort_if_not((_Bool )tmp) VAL [\old(cond)=1, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L58] COND FALSE !(!cond) VAL [\old(cond)=1, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cond=1, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L455] RET assume_abort_if_not((_Bool )tmp) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1] [L456] CALL, EXPR read_manual_selection_history((unsigned char)1) VAL [\old(index)=1, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L178] COND FALSE !((int )index == 0) VAL [\old(index)=1, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, index=1, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L181] COND TRUE (int )index == 1 [L182] return (manual_selection_History_1); VAL [\old(index)=1, \result=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, index=1, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L456] RET, EXPR read_manual_selection_history((unsigned char)1) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, read_manual_selection_history((unsigned char)1)=0, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1] [L456] tmp___0 = read_manual_selection_history((unsigned char)1) [L457] COND TRUE ! tmp___0 VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0] [L458] CALL, EXPR read_side1_failed_history((unsigned char)1) VAL [\old(index)=1, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L88] COND FALSE !((int )index == 0) VAL [\old(index)=1, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, index=1, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L91] COND TRUE (int )index == 1 [L92] return (side1Failed_History_1); VAL [\old(index)=1, \result=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, index=1, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L458] RET, EXPR read_side1_failed_history((unsigned char)1) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, read_side1_failed_history((unsigned char)1)=0, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0] [L458] tmp___1 = read_side1_failed_history((unsigned char)1) [L459] COND TRUE ! tmp___1 VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0, tmp___1=0] [L460] CALL, EXPR read_side1_failed_history((unsigned char)0) VAL [\old(index)=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L88] COND TRUE (int )index == 0 [L89] return (side1Failed_History_0); VAL [\old(index)=0, \result=-255, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, index=0, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L460] RET, EXPR read_side1_failed_history((unsigned char)0) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, read_side1_failed_history((unsigned char)0)=-255, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0, tmp___1=0] [L460] tmp___2 = read_side1_failed_history((unsigned char)0) [L461] COND FALSE !(! tmp___2) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0, tmp___1=0, tmp___2=1] [L486] CALL, EXPR read_side1_failed_history((unsigned char)1) VAL [\old(index)=1, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L88] COND FALSE !((int )index == 0) VAL [\old(index)=1, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, index=1, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L91] COND TRUE (int )index == 1 [L92] return (side1Failed_History_1); VAL [\old(index)=1, \result=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, index=1, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L486] RET, EXPR read_side1_failed_history((unsigned char)1) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, read_side1_failed_history((unsigned char)1)=0, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0, tmp___1=0, tmp___2=1] [L486] tmp___7 = read_side1_failed_history((unsigned char)1) [L487] COND FALSE !(\read(tmp___7)) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0, tmp___1=0, tmp___2=1, tmp___7=0] [L502] CALL, EXPR read_side1_failed_history((unsigned char)1) VAL [\old(index)=1, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L88] COND FALSE !((int )index == 0) VAL [\old(index)=1, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, index=1, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L91] COND TRUE (int )index == 1 [L92] return (side1Failed_History_1); VAL [\old(index)=1, \result=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, index=1, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L502] RET, EXPR read_side1_failed_history((unsigned char)1) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, read_side1_failed_history((unsigned char)1)=0, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0, tmp___1=0, tmp___2=1, tmp___7=0] [L502] tmp___11 = read_side1_failed_history((unsigned char)1) [L503] COND TRUE ! tmp___11 VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0, tmp___1=0, tmp___11=0, tmp___2=1, tmp___7=0] [L504] CALL, EXPR read_side2_failed_history((unsigned char)1) VAL [\old(index)=1, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L118] COND FALSE !((int )index == 0) VAL [\old(index)=1, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, index=1, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L121] COND TRUE (int )index == 1 [L122] return (side2Failed_History_1); VAL [\old(index)=1, \result=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, index=1, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L504] RET, EXPR read_side2_failed_history((unsigned char)1) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, read_side2_failed_history((unsigned char)1)=0, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0, tmp___1=0, tmp___11=0, tmp___2=1, tmp___7=0] [L504] tmp___12 = read_side2_failed_history((unsigned char)1) [L505] COND FALSE !(\read(tmp___12)) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0, tmp___1=0, tmp___11=0, tmp___12=0, tmp___2=1, tmp___7=0] [L518] CALL, EXPR read_active_side_history((unsigned char)2) VAL [\old(index)=2, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L148] COND FALSE !((int )index == 0) VAL [\old(index)=2, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, index=2, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L151] COND FALSE !((int )index == 1) VAL [\old(index)=2, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, index=2, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L154] COND TRUE (int )index == 2 [L155] return (active_side_History_2); VAL [\old(index)=2, \result=-2, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, index=2, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L518] RET, EXPR read_active_side_history((unsigned char)2) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, read_active_side_history((unsigned char)2)=-2, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0, tmp___1=0, tmp___11=0, tmp___12=0, tmp___2=1, tmp___7=0] [L518] tmp___20 = read_active_side_history((unsigned char)2) [L519] COND FALSE !((int )tmp___20 > -2) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0, tmp___1=0, tmp___11=0, tmp___12=0, tmp___2=1, tmp___20=-2, tmp___7=0] [L537] return (1); VAL [\result=1, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0, tmp___1=0, tmp___11=0, tmp___12=0, tmp___2=1, tmp___20=-2, tmp___7=0] [L604] RET, EXPR check() [L604] c1 = check() [L605] CALL assert(c1) VAL [\old(arg)=1, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L616] COND FALSE !(! arg) VAL [\old(arg)=1, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, arg=1, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L605] RET assert(c1) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, c1=1, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, i2=0, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L582] COND TRUE 1 [L584] CALL Console_task_each_pals_period() [L251] msg_t manual_selection ; [L252] char tmp ; [L255] tmp = __VERIFIER_nondet_char() [L256] manual_selection = tmp [L257] CALL write_manual_selection_history(manual_selection) [L167] manual_selection_History_2 = manual_selection_History_1 [L168] manual_selection_History_1 = manual_selection_History_0 [L169] manual_selection_History_0 = val VAL [\old(val)=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=0, manual_selection_History_1=127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, val=0] [L257] RET write_manual_selection_history(manual_selection) [L258] cs1_new = manual_selection != nomsg && cs1_new == nomsg ? manual_selection : cs1_new [L259] cs2_new = manual_selection != nomsg && cs2_new == nomsg ? manual_selection : cs2_new [L260] manual_selection = (msg_t )0 VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=127, cs2=0, cs2_new=0, cs2_old=127, manual_selection=0, manual_selection_History_0=0, manual_selection_History_1=127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=0] [L584] RET Console_task_each_pals_period() [L585] CALL Side1_activestandby_task_each_pals_period() [L266] int8_t side1 ; [L267] int8_t side2 ; [L268] msg_t manual_selection ; [L269] int8_t next_state ; [L272] side1 = nomsg [L273] side2 = nomsg [L274] manual_selection = (msg_t )0 [L275] side1Failed = __VERIFIER_nondet_bool() [L276] CALL write_side1_failed_history(side1Failed) [L77] side1Failed_History_2 = side1Failed_History_1 [L78] side1Failed_History_1 = side1Failed_History_0 [L79] side1Failed_History_0 = val VAL [\old(val)=257, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=127, cs2=0, cs2_new=0, cs2_old=127, manual_selection_History_0=0, manual_selection_History_1=127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, val=257] [L276] RET write_side1_failed_history(side1Failed) [L277] COND TRUE \read(side1Failed) [L278] s1s1_new = nomsg != nomsg && s1s1_new == nomsg ? nomsg : s1s1_new [L279] s1s2_new = nomsg != nomsg && s1s2_new == nomsg ? nomsg : s1s2_new [L280] s1p_new = nomsg != nomsg && s1p_new == nomsg ? nomsg : s1p_new [L281] side1_written = nomsg VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=127, cs2=0, cs2_new=0, cs2_old=127, manual_selection=0, manual_selection_History_0=0, manual_selection_History_1=127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2=-1, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L585] RET Side1_activestandby_task_each_pals_period() [L586] CALL Side2_activestandby_task_each_pals_period() [L323] int8_t side1 ; [L324] int8_t side2 ; [L325] msg_t manual_selection ; [L326] int8_t next_state ; [L329] side1 = nomsg [L330] side2 = nomsg [L331] manual_selection = (msg_t )0 [L332] side2Failed = __VERIFIER_nondet_bool() [L333] CALL write_side2_failed_history(side2Failed) [L107] side2Failed_History_2 = side2Failed_History_1 [L108] side2Failed_History_1 = side2Failed_History_0 [L109] side2Failed_History_0 = val VAL [\old(val)=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=127, cs2=0, cs2_new=0, cs2_old=127, manual_selection_History_0=0, manual_selection_History_1=127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, val=0] [L333] RET write_side2_failed_history(side2Failed) [L334] COND FALSE !(\read(side2Failed)) [L341] side1 = s1s2_old [L342] s1s2_old = nomsg [L343] side2 = s2s2_old [L344] s2s2_old = nomsg [L345] manual_selection = cs2_old [L346] cs2_old = nomsg VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=127, cs2=0, cs2_new=0, cs2_old=-1, manual_selection=127, manual_selection_History_0=0, manual_selection_History_1=127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L347] COND FALSE !((int )side1 == (int )side2) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=127, cs2=0, cs2_new=0, cs2_old=-1, manual_selection=127, manual_selection_History_0=0, manual_selection_History_1=127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L350] COND TRUE (int )side1 == (int )nomsg VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=127, cs2=0, cs2_new=0, cs2_old=-1, manual_selection=127, manual_selection_History_0=0, manual_selection_History_1=127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L351] COND TRUE (int )side2 != (int )nomsg [L352] next_state = (int8_t )0 VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=127, cs2=0, cs2_new=0, cs2_old=-1, manual_selection=127, manual_selection_History_0=0, manual_selection_History_1=127, manual_selection_History_2=0, next_state=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L371] s2s1_new = next_state != nomsg && s2s1_new == nomsg ? next_state : s2s1_new [L372] s2s2_new = next_state != nomsg && s2s2_new == nomsg ? next_state : s2s2_new [L373] s2p_new = next_state != nomsg && s2p_new == nomsg ? next_state : s2p_new [L374] side2_written = next_state VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=127, cs2=0, cs2_new=0, cs2_old=-1, manual_selection=127, manual_selection_History_0=0, manual_selection_History_1=127, manual_selection_History_2=0, next_state=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=-1, side1=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L586] RET Side2_activestandby_task_each_pals_period() [L587] CALL Pendulum_prism_task_each_pals_period() [L380] int8_t active_side ; [L381] int8_t tmp ; [L382] int8_t side1 ; [L383] int8_t side2 ; VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=127, cs2=0, cs2_new=0, cs2_old=-1, manual_selection_History_0=0, manual_selection_History_1=127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L386] CALL, EXPR read_active_side_history((unsigned char)0) VAL [\old(index)=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=127, cs2=0, cs2_new=0, cs2_old=-1, manual_selection_History_0=0, manual_selection_History_1=127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L148] COND TRUE (int )index == 0 [L149] return (active_side_History_0); VAL [\old(index)=0, \result=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=127, cs2=0, cs2_new=0, cs2_old=-1, index=0, manual_selection_History_0=0, manual_selection_History_1=127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L386] RET, EXPR read_active_side_history((unsigned char)0) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=127, cs2=0, cs2_new=0, cs2_old=-1, manual_selection_History_0=0, manual_selection_History_1=127, manual_selection_History_2=0, nomsg=-1, read_active_side_history((unsigned char)0)=0, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L386] tmp = read_active_side_history((unsigned char)0) [L387] active_side = tmp [L388] side1 = nomsg [L389] side2 = nomsg [L390] side1 = s1p_old [L391] s1p_old = nomsg [L392] side2 = s2p_old [L393] s2p_old = nomsg VAL [active_side=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=127, cs2=0, cs2_new=0, cs2_old=-1, manual_selection_History_0=0, manual_selection_History_1=127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=0, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=-1, side1=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=0] [L394] COND FALSE !((int )side1 == 1) VAL [active_side=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=127, cs2=0, cs2_new=0, cs2_old=-1, manual_selection_History_0=0, manual_selection_History_1=127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=0, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=-1, side1=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=0] [L397] COND FALSE !((int )side2 == 1) VAL [active_side=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=127, cs2=0, cs2_new=0, cs2_old=-1, manual_selection_History_0=0, manual_selection_History_1=127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=0, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=-1, side1=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=0] [L400] COND FALSE !((int )side1 == 0) VAL [active_side=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=127, cs2=0, cs2_new=0, cs2_old=-1, manual_selection_History_0=0, manual_selection_History_1=127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=0, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=-1, side1=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=0] [L408] COND TRUE (int )side1 == (int )nomsg VAL [active_side=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=127, cs2=0, cs2_new=0, cs2_old=-1, manual_selection_History_0=0, manual_selection_History_1=127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=0, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=-1, side1=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=0] [L409] COND TRUE (int )side2 == 0 [L410] active_side = (int8_t )2 VAL [active_side=2, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=127, cs2=0, cs2_new=0, cs2_old=-1, manual_selection_History_0=0, manual_selection_History_1=127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=0, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=-1, side1=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=0] [L417] CALL write_active_side_history(active_side) [L137] active_side_History_2 = active_side_History_1 [L138] active_side_History_1 = active_side_History_0 [L139] active_side_History_0 = val VAL [\old(val)=2, active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=127, cs2=0, cs2_new=0, cs2_old=-1, manual_selection_History_0=0, manual_selection_History_1=127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=0, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, val=2] [L417] RET write_active_side_history(active_side) [L587] RET Pendulum_prism_task_each_pals_period() [L588] cs1_old = cs1_new [L589] cs1_new = nomsg [L590] cs2_old = cs2_new [L591] cs2_new = nomsg [L592] s1s2_old = s1s2_new [L593] s1s2_new = nomsg [L594] s1s1_old = s1s1_new [L595] s1s1_new = nomsg [L596] s2s1_old = s2s1_new [L597] s2s1_new = nomsg [L598] s2s2_old = s2s2_new [L599] s2s2_new = nomsg [L600] s1p_old = s1p_new [L601] s1p_new = nomsg [L602] s2p_old = s2p_new [L603] s2p_new = nomsg [L604] CALL, EXPR check() [L423] int tmp ; [L424] msg_t tmp___0 ; [L425] _Bool tmp___1 ; [L426] _Bool tmp___2 ; [L427] _Bool tmp___3 ; [L428] _Bool tmp___4 ; [L429] int8_t tmp___5 ; [L430] _Bool tmp___6 ; [L431] _Bool tmp___7 ; [L432] _Bool tmp___8 ; [L433] int8_t tmp___9 ; [L434] _Bool tmp___10 ; [L435] _Bool tmp___11 ; [L436] _Bool tmp___12 ; [L437] msg_t tmp___13 ; [L438] _Bool tmp___14 ; [L439] _Bool tmp___15 ; [L440] _Bool tmp___16 ; [L441] _Bool tmp___17 ; [L442] int8_t tmp___18 ; [L443] int8_t tmp___19 ; [L444] int8_t tmp___20 ; VAL [active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=0, cs2=0, cs2_new=-1, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L447] COND FALSE !(! side1Failed) VAL [active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=0, cs2=0, cs2_new=-1, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L450] COND TRUE ! side2Failed [L451] tmp = 1 VAL [active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=0, cs2=0, cs2_new=-1, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1] [L455] CALL assume_abort_if_not((_Bool )tmp) VAL [\old(cond)=1, active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=0, cs2=0, cs2_new=-1, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L58] COND FALSE !(!cond) VAL [\old(cond)=1, active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cond=1, cs1=0, cs1_new=-1, cs1_old=0, cs2=0, cs2_new=-1, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L455] RET assume_abort_if_not((_Bool )tmp) VAL [active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=0, cs2=0, cs2_new=-1, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1] [L456] CALL, EXPR read_manual_selection_history((unsigned char)1) VAL [\old(index)=1, active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=0, cs2=0, cs2_new=-1, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L178] COND FALSE !((int )index == 0) VAL [\old(index)=1, active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=0, cs2=0, cs2_new=-1, cs2_old=0, index=1, manual_selection_History_0=0, manual_selection_History_1=127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L181] COND TRUE (int )index == 1 [L182] return (manual_selection_History_1); VAL [\old(index)=1, \result=127, active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=0, cs2=0, cs2_new=-1, cs2_old=0, index=1, manual_selection_History_0=0, manual_selection_History_1=127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L456] RET, EXPR read_manual_selection_history((unsigned char)1) VAL [active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=0, cs2=0, cs2_new=-1, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=127, manual_selection_History_2=0, nomsg=-1, read_manual_selection_history((unsigned char)1)=127, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1] [L456] tmp___0 = read_manual_selection_history((unsigned char)1) [L457] COND FALSE !(! tmp___0) VAL [active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=0, cs2=0, cs2_new=-1, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=127] [L486] CALL, EXPR read_side1_failed_history((unsigned char)1) VAL [\old(index)=1, active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=0, cs2=0, cs2_new=-1, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L88] COND FALSE !((int )index == 0) VAL [\old(index)=1, active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=0, cs2=0, cs2_new=-1, cs2_old=0, index=1, manual_selection_History_0=0, manual_selection_History_1=127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L91] COND TRUE (int )index == 1 [L92] return (side1Failed_History_1); VAL [\old(index)=1, \result=-255, active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=0, cs2=0, cs2_new=-1, cs2_old=0, index=1, manual_selection_History_0=0, manual_selection_History_1=127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L486] RET, EXPR read_side1_failed_history((unsigned char)1) VAL [active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=0, cs2=0, cs2_new=-1, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=127, manual_selection_History_2=0, nomsg=-1, read_side1_failed_history((unsigned char)1)=-255, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=127] [L486] tmp___7 = read_side1_failed_history((unsigned char)1) [L487] COND TRUE \read(tmp___7) VAL [active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=0, cs2=0, cs2_new=-1, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=127, tmp___7=1] [L488] CALL, EXPR read_side2_failed_history((unsigned char)1) VAL [\old(index)=1, active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=0, cs2=0, cs2_new=-1, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L118] COND FALSE !((int )index == 0) VAL [\old(index)=1, active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=0, cs2=0, cs2_new=-1, cs2_old=0, index=1, manual_selection_History_0=0, manual_selection_History_1=127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L121] COND TRUE (int )index == 1 [L122] return (side2Failed_History_1); VAL [\old(index)=1, \result=0, active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=0, cs2=0, cs2_new=-1, cs2_old=0, index=1, manual_selection_History_0=0, manual_selection_History_1=127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L488] RET, EXPR read_side2_failed_history((unsigned char)1) VAL [active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=0, cs2=0, cs2_new=-1, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=127, manual_selection_History_2=0, nomsg=-1, read_side2_failed_history((unsigned char)1)=0, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=127, tmp___7=1] [L488] tmp___8 = read_side2_failed_history((unsigned char)1) [L489] COND TRUE ! tmp___8 VAL [active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=0, cs2=0, cs2_new=-1, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=127, tmp___7=1, tmp___8=0] [L490] CALL, EXPR read_active_side_history((unsigned char)0) VAL [\old(index)=0, active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=0, cs2=0, cs2_new=-1, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L148] COND TRUE (int )index == 0 [L149] return (active_side_History_0); VAL [\old(index)=0, \result=2, active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=0, cs2=0, cs2_new=-1, cs2_old=0, index=0, manual_selection_History_0=0, manual_selection_History_1=127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L490] RET, EXPR read_active_side_history((unsigned char)0) VAL [active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=0, cs2=0, cs2_new=-1, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=127, manual_selection_History_2=0, nomsg=-1, read_active_side_history((unsigned char)0)=2, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=127, tmp___7=1, tmp___8=0] [L490] tmp___5 = read_active_side_history((unsigned char)0) [L491] COND FALSE !(! ((int )tmp___5 == 2)) VAL [active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=0, cs2=0, cs2_new=-1, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=127, tmp___5=2, tmp___7=1, tmp___8=0] [L494] CALL, EXPR read_side2_failed_history((unsigned char)0) VAL [\old(index)=0, active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=0, cs2=0, cs2_new=-1, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L118] COND TRUE (int )index == 0 [L119] return (side2Failed_History_0); VAL [\old(index)=0, \result=0, active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=0, cs2=0, cs2_new=-1, cs2_old=0, index=0, manual_selection_History_0=0, manual_selection_History_1=127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L494] RET, EXPR read_side2_failed_history((unsigned char)0) VAL [active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=0, cs2=0, cs2_new=-1, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=127, manual_selection_History_2=0, nomsg=-1, read_side2_failed_history((unsigned char)0)=0, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=127, tmp___5=2, tmp___7=1, tmp___8=0] [L494] tmp___6 = read_side2_failed_history((unsigned char)0) [L495] COND TRUE ! tmp___6 VAL [active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=0, cs2=0, cs2_new=-1, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=127, tmp___5=2, tmp___6=0, tmp___7=1, tmp___8=0] [L496] COND TRUE ! ((int )side2_written == 1) [L497] return (0); VAL [\result=0, active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=0, cs2=0, cs2_new=-1, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=127, tmp___5=2, tmp___6=0, tmp___7=1, tmp___8=0] [L604] RET, EXPR check() [L604] c1 = check() [L605] CALL assert(c1) VAL [\old(arg)=0, active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=0, cs2=0, cs2_new=-1, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L616] COND TRUE ! arg VAL [\old(arg)=0, active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, arg=0, cs1=0, cs1_new=-1, cs1_old=0, cs2=0, cs2_new=-1, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L618] reach_error() VAL [\old(arg)=0, active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, arg=0, cs1=0, cs1_new=-1, cs1_old=0, cs2=0, cs2_new=-1, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 8 procedures, 180 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 302.4s, OverallIterations: 42, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.2s, AutomataDifference: 211.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 38005 SdHoareTripleChecker+Valid, 46.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 37688 mSDsluCounter, 93566 SdHoareTripleChecker+Invalid, 39.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 75552 mSDsCounter, 20103 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 44496 IncrementalHoareTripleChecker+Invalid, 64599 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 20103 mSolverCounterUnsat, 18014 mSDtfsCounter, 44496 mSolverCounterSat, 0.9s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 5781 GetRequests, 4717 SyntacticMatches, 19 SemanticMatches, 1045 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53204 ImplicationChecksByTransitivity, 55.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=20911occurred in iteration=39, InterpolantAutomatonStates: 981, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 63.4s AutomataMinimizationTime, 41 MinimizatonAttempts, 114603 StatesRemovedByMinimization, 32 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.7s SsaConstructionTime, 2.4s SatisfiabilityAnalysisTime, 20.3s InterpolantComputationTime, 6564 NumberOfCodeBlocks, 6564 NumberOfCodeBlocksAsserted, 53 NumberOfCheckSat, 8184 ConstructedInterpolants, 0 QuantifiedInterpolants, 27153 SizeOfPredicates, 41 NumberOfNonLiveVariables, 8353 ConjunctsInSsa, 188 ConjunctsInUnsatCore, 63 InterpolantComputations, 31 PerfectInterpolantSequences, 3227/3820 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-11-18 20:35:12,387 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d29f079-78c4-4116-83da-dc1ebb38fecd/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE