./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.2.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version d790fecc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64dfb5de-24a6-477f-bc41-806157af07bc/bin/uautomizer-verify-84ZbGMXZE1/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64dfb5de-24a6-477f-bc41-806157af07bc/bin/uautomizer-verify-84ZbGMXZE1/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64dfb5de-24a6-477f-bc41-806157af07bc/bin/uautomizer-verify-84ZbGMXZE1/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64dfb5de-24a6-477f-bc41-806157af07bc/bin/uautomizer-verify-84ZbGMXZE1/config/AutomizerReach.xml -i ../../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.2.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64dfb5de-24a6-477f-bc41-806157af07bc/bin/uautomizer-verify-84ZbGMXZE1/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64dfb5de-24a6-477f-bc41-806157af07bc/bin/uautomizer-verify-84ZbGMXZE1 --witnessprinter.witness.filename witness --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 0451b84ecb7a9b49daa0d007f78b5b7787a8fa890fb4c838a3b9a1c5be28a03a --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-12-02 14:37:34,869 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-12-02 14:37:34,922 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64dfb5de-24a6-477f-bc41-806157af07bc/bin/uautomizer-verify-84ZbGMXZE1/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-12-02 14:37:34,928 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-12-02 14:37:34,928 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-12-02 14:37:34,950 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-12-02 14:37:34,951 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-12-02 14:37:34,951 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-12-02 14:37:34,951 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-12-02 14:37:34,952 INFO L153 SettingsManager]: * Use memory slicer=true [2024-12-02 14:37:34,952 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-12-02 14:37:34,952 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-12-02 14:37:34,952 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-12-02 14:37:34,952 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-12-02 14:37:34,952 INFO L153 SettingsManager]: * Use SBE=true [2024-12-02 14:37:34,953 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-12-02 14:37:34,953 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-12-02 14:37:34,953 INFO L153 SettingsManager]: * sizeof long=4 [2024-12-02 14:37:34,953 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-12-02 14:37:34,953 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-12-02 14:37:34,953 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-12-02 14:37:34,953 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-12-02 14:37:34,953 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-12-02 14:37:34,953 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-12-02 14:37:34,953 INFO L153 SettingsManager]: * sizeof long double=12 [2024-12-02 14:37:34,954 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-12-02 14:37:34,954 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-12-02 14:37:34,954 INFO L153 SettingsManager]: * Use constant arrays=true [2024-12-02 14:37:34,954 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-12-02 14:37:34,954 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-12-02 14:37:34,954 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-12-02 14:37:34,954 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-12-02 14:37:34,954 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-12-02 14:37:34,954 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-12-02 14:37:34,954 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-12-02 14:37:34,954 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-12-02 14:37:34,955 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-12-02 14:37:34,955 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-12-02 14:37:34,955 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-12-02 14:37:34,955 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-12-02 14:37:34,955 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-12-02 14:37:34,955 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-12-02 14:37:34,955 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-12-02 14:37:34,955 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-12-02 14:37:34,955 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-12-02 14:37:34,955 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-12-02 14:37:34,955 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-12-02 14:37:34,956 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-12-02 14:37:34,956 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_64dfb5de-24a6-477f-bc41-806157af07bc/bin/uautomizer-verify-84ZbGMXZE1 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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 -> 0451b84ecb7a9b49daa0d007f78b5b7787a8fa890fb4c838a3b9a1c5be28a03a [2024-12-02 14:37:35,194 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-12-02 14:37:35,202 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-12-02 14:37:35,205 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-12-02 14:37:35,206 INFO L270 PluginConnector]: Initializing CDTParser... [2024-12-02 14:37:35,207 INFO L274 PluginConnector]: CDTParser initialized [2024-12-02 14:37:35,208 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64dfb5de-24a6-477f-bc41-806157af07bc/bin/uautomizer-verify-84ZbGMXZE1/../../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.2.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2024-12-02 14:37:37,944 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64dfb5de-24a6-477f-bc41-806157af07bc/bin/uautomizer-verify-84ZbGMXZE1/data/d71727dd0/613a45a8babf439fb3ebcd7909768453/FLAGf3024a334 [2024-12-02 14:37:38,178 INFO L384 CDTParser]: Found 1 translation units. [2024-12-02 14:37:38,179 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64dfb5de-24a6-477f-bc41-806157af07bc/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.2.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2024-12-02 14:37:38,188 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64dfb5de-24a6-477f-bc41-806157af07bc/bin/uautomizer-verify-84ZbGMXZE1/data/d71727dd0/613a45a8babf439fb3ebcd7909768453/FLAGf3024a334 [2024-12-02 14:37:38,205 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64dfb5de-24a6-477f-bc41-806157af07bc/bin/uautomizer-verify-84ZbGMXZE1/data/d71727dd0/613a45a8babf439fb3ebcd7909768453 [2024-12-02 14:37:38,207 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-12-02 14:37:38,209 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-12-02 14:37:38,210 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-12-02 14:37:38,210 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-12-02 14:37:38,215 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-12-02 14:37:38,216 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 02:37:38" (1/1) ... [2024-12-02 14:37:38,217 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6930058c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:37:38, skipping insertion in model container [2024-12-02 14:37:38,217 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 02:37:38" (1/1) ... [2024-12-02 14:37:38,240 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-12-02 14:37:38,432 WARN L250 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_64dfb5de-24a6-477f-bc41-806157af07bc/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.2.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c[4411,4424] [2024-12-02 14:37:38,452 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-02 14:37:38,465 INFO L200 MainTranslator]: Completed pre-run [2024-12-02 14:37:38,497 WARN L250 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_64dfb5de-24a6-477f-bc41-806157af07bc/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.2.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c[4411,4424] [2024-12-02 14:37:38,510 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-02 14:37:38,527 INFO L204 MainTranslator]: Completed translation [2024-12-02 14:37:38,528 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:37:38 WrapperNode [2024-12-02 14:37:38,528 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-12-02 14:37:38,529 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-12-02 14:37:38,529 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-12-02 14:37:38,529 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-12-02 14:37:38,536 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:37:38" (1/1) ... [2024-12-02 14:37:38,544 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:37:38" (1/1) ... [2024-12-02 14:37:38,569 INFO L138 Inliner]: procedures = 23, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 348 [2024-12-02 14:37:38,569 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-12-02 14:37:38,570 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-12-02 14:37:38,570 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-12-02 14:37:38,570 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-12-02 14:37:38,581 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:37:38" (1/1) ... [2024-12-02 14:37:38,581 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:37:38" (1/1) ... [2024-12-02 14:37:38,583 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:37:38" (1/1) ... [2024-12-02 14:37:38,598 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-12-02 14:37:38,598 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:37:38" (1/1) ... [2024-12-02 14:37:38,598 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:37:38" (1/1) ... [2024-12-02 14:37:38,605 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:37:38" (1/1) ... [2024-12-02 14:37:38,607 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:37:38" (1/1) ... [2024-12-02 14:37:38,610 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:37:38" (1/1) ... [2024-12-02 14:37:38,612 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:37:38" (1/1) ... [2024-12-02 14:37:38,613 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:37:38" (1/1) ... [2024-12-02 14:37:38,616 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-12-02 14:37:38,617 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-12-02 14:37:38,617 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-12-02 14:37:38,617 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-12-02 14:37:38,618 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:37:38" (1/1) ... [2024-12-02 14:37:38,623 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-12-02 14:37:38,635 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64dfb5de-24a6-477f-bc41-806157af07bc/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 14:37:38,647 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64dfb5de-24a6-477f-bc41-806157af07bc/bin/uautomizer-verify-84ZbGMXZE1/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-12-02 14:37:38,649 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64dfb5de-24a6-477f-bc41-806157af07bc/bin/uautomizer-verify-84ZbGMXZE1/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-12-02 14:37:38,675 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-12-02 14:37:38,675 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-12-02 14:37:38,675 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-12-02 14:37:38,675 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-12-02 14:37:38,773 INFO L234 CfgBuilder]: Building ICFG [2024-12-02 14:37:38,775 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-12-02 14:37:39,099 INFO L? ?]: Removed 34 outVars from TransFormulas that were not future-live. [2024-12-02 14:37:39,100 INFO L283 CfgBuilder]: Performing block encoding [2024-12-02 14:37:39,109 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-12-02 14:37:39,109 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2024-12-02 14:37:39,110 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 02:37:39 BoogieIcfgContainer [2024-12-02 14:37:39,110 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-12-02 14:37:39,112 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-12-02 14:37:39,112 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-12-02 14:37:39,117 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-12-02 14:37:39,117 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 02:37:38" (1/3) ... [2024-12-02 14:37:39,117 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@731b5983 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 02:37:39, skipping insertion in model container [2024-12-02 14:37:39,118 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:37:38" (2/3) ... [2024-12-02 14:37:39,118 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@731b5983 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 02:37:39, skipping insertion in model container [2024-12-02 14:37:39,118 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 02:37:39" (3/3) ... [2024-12-02 14:37:39,119 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.3.2.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2024-12-02 14:37:39,133 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-12-02 14:37:39,135 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr-var-start-time.3.2.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c that has 1 procedures, 82 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2024-12-02 14:37:39,187 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-12-02 14:37:39,198 INFO L333 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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;@33cdbe30, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-02 14:37:39,198 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-12-02 14:37:39,202 INFO L276 IsEmpty]: Start isEmpty. Operand has 82 states, 80 states have (on average 1.675) internal successors, (134), 81 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:37:39,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-12-02 14:37:39,209 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:37:39,209 INFO L218 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] [2024-12-02 14:37:39,210 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 14:37:39,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:37:39,215 INFO L85 PathProgramCache]: Analyzing trace with hash -1356231251, now seen corresponding path program 1 times [2024-12-02 14:37:39,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:37:39,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590582621] [2024-12-02 14:37:39,223 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:37:39,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:37:39,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:37:39,507 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:37:39,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:37:39,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590582621] [2024-12-02 14:37:39,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1590582621] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 14:37:39,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 14:37:39,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-02 14:37:39,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526621189] [2024-12-02 14:37:39,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 14:37:39,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 14:37:39,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:37:39,531 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 14:37:39,531 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 14:37:39,533 INFO L87 Difference]: Start difference. First operand has 82 states, 80 states have (on average 1.675) internal successors, (134), 81 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:37:39,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:37:39,586 INFO L93 Difference]: Finished difference Result 190 states and 300 transitions. [2024-12-02 14:37:39,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 14:37:39,588 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2024-12-02 14:37:39,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:37:39,594 INFO L225 Difference]: With dead ends: 190 [2024-12-02 14:37:39,595 INFO L226 Difference]: Without dead ends: 122 [2024-12-02 14:37:39,598 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 14:37:39,601 INFO L435 NwaCegarLoop]: 174 mSDtfsCounter, 87 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 14:37:39,602 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 267 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 14:37:39,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2024-12-02 14:37:39,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 120. [2024-12-02 14:37:39,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 119 states have (on average 1.495798319327731) internal successors, (178), 119 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:37:39,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 178 transitions. [2024-12-02 14:37:39,634 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 178 transitions. Word has length 37 [2024-12-02 14:37:39,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:37:39,634 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 178 transitions. [2024-12-02 14:37:39,635 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:37:39,635 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 178 transitions. [2024-12-02 14:37:39,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-12-02 14:37:39,636 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:37:39,636 INFO L218 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] [2024-12-02 14:37:39,636 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-12-02 14:37:39,636 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 14:37:39,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:37:39,637 INFO L85 PathProgramCache]: Analyzing trace with hash -775084619, now seen corresponding path program 1 times [2024-12-02 14:37:39,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:37:39,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428760093] [2024-12-02 14:37:39,638 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:37:39,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:37:39,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:37:39,751 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:37:39,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:37:39,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428760093] [2024-12-02 14:37:39,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1428760093] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 14:37:39,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 14:37:39,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-02 14:37:39,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133527435] [2024-12-02 14:37:39,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 14:37:39,753 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 14:37:39,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:37:39,754 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 14:37:39,754 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 14:37:39,754 INFO L87 Difference]: Start difference. First operand 120 states and 178 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:37:39,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:37:39,787 INFO L93 Difference]: Finished difference Result 288 states and 442 transitions. [2024-12-02 14:37:39,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 14:37:39,788 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2024-12-02 14:37:39,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:37:39,789 INFO L225 Difference]: With dead ends: 288 [2024-12-02 14:37:39,789 INFO L226 Difference]: Without dead ends: 188 [2024-12-02 14:37:39,790 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 14:37:39,791 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 72 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 14:37:39,791 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 219 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 14:37:39,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2024-12-02 14:37:39,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 186. [2024-12-02 14:37:39,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 185 states have (on average 1.518918918918919) internal successors, (281), 185 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:37:39,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 281 transitions. [2024-12-02 14:37:39,805 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 281 transitions. Word has length 38 [2024-12-02 14:37:39,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:37:39,805 INFO L471 AbstractCegarLoop]: Abstraction has 186 states and 281 transitions. [2024-12-02 14:37:39,806 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:37:39,806 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 281 transitions. [2024-12-02 14:37:39,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-12-02 14:37:39,807 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:37:39,807 INFO L218 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] [2024-12-02 14:37:39,807 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-12-02 14:37:39,807 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 14:37:39,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:37:39,808 INFO L85 PathProgramCache]: Analyzing trace with hash 1501816372, now seen corresponding path program 1 times [2024-12-02 14:37:39,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:37:39,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145516008] [2024-12-02 14:37:39,808 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:37:39,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:37:39,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:37:39,948 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:37:39,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:37:39,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145516008] [2024-12-02 14:37:39,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2145516008] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 14:37:39,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 14:37:39,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-12-02 14:37:39,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699665201] [2024-12-02 14:37:39,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 14:37:39,949 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-02 14:37:39,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:37:39,949 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-02 14:37:39,950 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-12-02 14:37:39,950 INFO L87 Difference]: Start difference. First operand 186 states and 281 transitions. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:37:40,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:37:40,052 INFO L93 Difference]: Finished difference Result 850 states and 1325 transitions. [2024-12-02 14:37:40,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-02 14:37:40,053 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2024-12-02 14:37:40,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:37:40,056 INFO L225 Difference]: With dead ends: 850 [2024-12-02 14:37:40,057 INFO L226 Difference]: Without dead ends: 684 [2024-12-02 14:37:40,057 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-12-02 14:37:40,058 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 462 mSDsluCounter, 509 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 462 SdHoareTripleChecker+Valid, 620 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-12-02 14:37:40,059 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [462 Valid, 620 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-12-02 14:37:40,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 684 states. [2024-12-02 14:37:40,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 684 to 350. [2024-12-02 14:37:40,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 350 states, 349 states have (on average 1.527220630372493) internal successors, (533), 349 states have internal predecessors, (533), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:37:40,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 533 transitions. [2024-12-02 14:37:40,083 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 533 transitions. Word has length 39 [2024-12-02 14:37:40,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:37:40,083 INFO L471 AbstractCegarLoop]: Abstraction has 350 states and 533 transitions. [2024-12-02 14:37:40,083 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:37:40,084 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 533 transitions. [2024-12-02 14:37:40,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-12-02 14:37:40,084 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:37:40,085 INFO L218 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, 1] [2024-12-02 14:37:40,085 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-12-02 14:37:40,085 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 14:37:40,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:37:40,085 INFO L85 PathProgramCache]: Analyzing trace with hash -707789038, now seen corresponding path program 1 times [2024-12-02 14:37:40,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:37:40,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814931491] [2024-12-02 14:37:40,086 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:37:40,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:37:40,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:37:40,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:37:40,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:37:40,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814931491] [2024-12-02 14:37:40,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [814931491] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 14:37:40,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 14:37:40,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-12-02 14:37:40,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789706798] [2024-12-02 14:37:40,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 14:37:40,240 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-02 14:37:40,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:37:40,241 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-02 14:37:40,241 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-12-02 14:37:40,241 INFO L87 Difference]: Start difference. First operand 350 states and 533 transitions. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:37:40,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:37:40,308 INFO L93 Difference]: Finished difference Result 1228 states and 1888 transitions. [2024-12-02 14:37:40,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-02 14:37:40,309 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2024-12-02 14:37:40,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:37:40,313 INFO L225 Difference]: With dead ends: 1228 [2024-12-02 14:37:40,313 INFO L226 Difference]: Without dead ends: 898 [2024-12-02 14:37:40,314 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-12-02 14:37:40,315 INFO L435 NwaCegarLoop]: 186 mSDtfsCounter, 276 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 276 SdHoareTripleChecker+Valid, 376 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-12-02 14:37:40,315 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [276 Valid, 376 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-12-02 14:37:40,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 898 states. [2024-12-02 14:37:40,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 898 to 894. [2024-12-02 14:37:40,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 894 states, 893 states have (on average 1.528555431131019) internal successors, (1365), 893 states have internal predecessors, (1365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:37:40,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 894 states to 894 states and 1365 transitions. [2024-12-02 14:37:40,344 INFO L78 Accepts]: Start accepts. Automaton has 894 states and 1365 transitions. Word has length 40 [2024-12-02 14:37:40,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:37:40,345 INFO L471 AbstractCegarLoop]: Abstraction has 894 states and 1365 transitions. [2024-12-02 14:37:40,345 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:37:40,345 INFO L276 IsEmpty]: Start isEmpty. Operand 894 states and 1365 transitions. [2024-12-02 14:37:40,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-12-02 14:37:40,346 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:37:40,346 INFO L218 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, 1, 1, 1] [2024-12-02 14:37:40,347 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-12-02 14:37:40,347 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 14:37:40,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:37:40,347 INFO L85 PathProgramCache]: Analyzing trace with hash 1119396873, now seen corresponding path program 1 times [2024-12-02 14:37:40,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:37:40,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814241131] [2024-12-02 14:37:40,348 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:37:40,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:37:40,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:37:40,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:37:40,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:37:40,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814241131] [2024-12-02 14:37:40,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1814241131] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 14:37:40,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 14:37:40,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-12-02 14:37:40,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660333879] [2024-12-02 14:37:40,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 14:37:40,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-02 14:37:40,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:37:40,483 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-02 14:37:40,484 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-12-02 14:37:40,484 INFO L87 Difference]: Start difference. First operand 894 states and 1365 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:37:40,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:37:40,646 INFO L93 Difference]: Finished difference Result 2642 states and 4055 transitions. [2024-12-02 14:37:40,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-02 14:37:40,647 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2024-12-02 14:37:40,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:37:40,654 INFO L225 Difference]: With dead ends: 2642 [2024-12-02 14:37:40,655 INFO L226 Difference]: Without dead ends: 1768 [2024-12-02 14:37:40,656 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-12-02 14:37:40,657 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 472 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 472 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-12-02 14:37:40,657 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [472 Valid, 137 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-12-02 14:37:40,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1768 states. [2024-12-02 14:37:40,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1768 to 1766. [2024-12-02 14:37:40,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1766 states, 1765 states have (on average 1.5257790368271955) internal successors, (2693), 1765 states have internal predecessors, (2693), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:37:40,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1766 states to 1766 states and 2693 transitions. [2024-12-02 14:37:40,721 INFO L78 Accepts]: Start accepts. Automaton has 1766 states and 2693 transitions. Word has length 42 [2024-12-02 14:37:40,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:37:40,721 INFO L471 AbstractCegarLoop]: Abstraction has 1766 states and 2693 transitions. [2024-12-02 14:37:40,721 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:37:40,722 INFO L276 IsEmpty]: Start isEmpty. Operand 1766 states and 2693 transitions. [2024-12-02 14:37:40,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-12-02 14:37:40,723 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:37:40,723 INFO L218 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, 1, 1, 1] [2024-12-02 14:37:40,723 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-12-02 14:37:40,724 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 14:37:40,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:37:40,724 INFO L85 PathProgramCache]: Analyzing trace with hash -1549405756, now seen corresponding path program 1 times [2024-12-02 14:37:40,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:37:40,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062890441] [2024-12-02 14:37:40,724 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:37:40,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:37:40,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:37:41,069 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:37:41,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:37:41,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062890441] [2024-12-02 14:37:41,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1062890441] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 14:37:41,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 14:37:41,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-12-02 14:37:41,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258535277] [2024-12-02 14:37:41,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 14:37:41,070 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-02 14:37:41,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:37:41,070 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-02 14:37:41,071 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-12-02 14:37:41,071 INFO L87 Difference]: Start difference. First operand 1766 states and 2693 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:37:41,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:37:41,104 INFO L93 Difference]: Finished difference Result 1864 states and 2838 transitions. [2024-12-02 14:37:41,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-02 14:37:41,104 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2024-12-02 14:37:41,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:37:41,111 INFO L225 Difference]: With dead ends: 1864 [2024-12-02 14:37:41,111 INFO L226 Difference]: Without dead ends: 1862 [2024-12-02 14:37:41,112 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-12-02 14:37:41,113 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 0 mSDsluCounter, 320 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 430 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 14:37:41,113 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 430 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 14:37:41,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1862 states. [2024-12-02 14:37:41,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1862 to 1862. [2024-12-02 14:37:41,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1862 states, 1861 states have (on average 1.4986566362170877) internal successors, (2789), 1861 states have internal predecessors, (2789), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:37:41,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1862 states to 1862 states and 2789 transitions. [2024-12-02 14:37:41,164 INFO L78 Accepts]: Start accepts. Automaton has 1862 states and 2789 transitions. Word has length 42 [2024-12-02 14:37:41,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:37:41,165 INFO L471 AbstractCegarLoop]: Abstraction has 1862 states and 2789 transitions. [2024-12-02 14:37:41,165 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:37:41,165 INFO L276 IsEmpty]: Start isEmpty. Operand 1862 states and 2789 transitions. [2024-12-02 14:37:41,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-12-02 14:37:41,166 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:37:41,166 INFO L218 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, 1, 1, 1, 1] [2024-12-02 14:37:41,166 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-12-02 14:37:41,166 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 14:37:41,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:37:41,167 INFO L85 PathProgramCache]: Analyzing trace with hash -776365166, now seen corresponding path program 1 times [2024-12-02 14:37:41,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:37:41,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665895585] [2024-12-02 14:37:41,167 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:37:41,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:37:41,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:37:41,238 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:37:41,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:37:41,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665895585] [2024-12-02 14:37:41,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1665895585] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 14:37:41,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 14:37:41,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-02 14:37:41,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850972705] [2024-12-02 14:37:41,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 14:37:41,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 14:37:41,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:37:41,239 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 14:37:41,239 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 14:37:41,239 INFO L87 Difference]: Start difference. First operand 1862 states and 2789 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:37:41,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:37:41,284 INFO L93 Difference]: Finished difference Result 4962 states and 7385 transitions. [2024-12-02 14:37:41,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 14:37:41,284 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2024-12-02 14:37:41,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:37:41,296 INFO L225 Difference]: With dead ends: 4962 [2024-12-02 14:37:41,296 INFO L226 Difference]: Without dead ends: 3120 [2024-12-02 14:37:41,298 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 14:37:41,299 INFO L435 NwaCegarLoop]: 113 mSDtfsCounter, 61 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 14:37:41,300 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 201 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 14:37:41,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3120 states. [2024-12-02 14:37:41,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3120 to 3078. [2024-12-02 14:37:41,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3078 states, 3077 states have (on average 1.460838479038024) internal successors, (4495), 3077 states have internal predecessors, (4495), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:37:41,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3078 states to 3078 states and 4495 transitions. [2024-12-02 14:37:41,374 INFO L78 Accepts]: Start accepts. Automaton has 3078 states and 4495 transitions. Word has length 43 [2024-12-02 14:37:41,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:37:41,374 INFO L471 AbstractCegarLoop]: Abstraction has 3078 states and 4495 transitions. [2024-12-02 14:37:41,374 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:37:41,374 INFO L276 IsEmpty]: Start isEmpty. Operand 3078 states and 4495 transitions. [2024-12-02 14:37:41,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-12-02 14:37:41,375 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:37:41,375 INFO L218 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, 1, 1, 1, 1] [2024-12-02 14:37:41,375 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-12-02 14:37:41,375 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 14:37:41,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:37:41,376 INFO L85 PathProgramCache]: Analyzing trace with hash 1884301642, now seen corresponding path program 1 times [2024-12-02 14:37:41,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:37:41,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409377513] [2024-12-02 14:37:41,376 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:37:41,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:37:41,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:37:41,428 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:37:41,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:37:41,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409377513] [2024-12-02 14:37:41,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1409377513] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 14:37:41,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 14:37:41,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-02 14:37:41,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714094824] [2024-12-02 14:37:41,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 14:37:41,429 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 14:37:41,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:37:41,430 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 14:37:41,430 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 14:37:41,430 INFO L87 Difference]: Start difference. First operand 3078 states and 4495 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:37:41,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:37:41,474 INFO L93 Difference]: Finished difference Result 6141 states and 9029 transitions. [2024-12-02 14:37:41,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 14:37:41,474 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2024-12-02 14:37:41,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:37:41,489 INFO L225 Difference]: With dead ends: 6141 [2024-12-02 14:37:41,489 INFO L226 Difference]: Without dead ends: 4298 [2024-12-02 14:37:41,491 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 14:37:41,492 INFO L435 NwaCegarLoop]: 178 mSDtfsCounter, 78 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 14:37:41,492 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 264 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 14:37:41,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4298 states. [2024-12-02 14:37:41,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4298 to 4296. [2024-12-02 14:37:41,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4296 states, 4295 states have (on average 1.4456344586728755) internal successors, (6209), 4295 states have internal predecessors, (6209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:37:41,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4296 states to 4296 states and 6209 transitions. [2024-12-02 14:37:41,597 INFO L78 Accepts]: Start accepts. Automaton has 4296 states and 6209 transitions. Word has length 43 [2024-12-02 14:37:41,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:37:41,597 INFO L471 AbstractCegarLoop]: Abstraction has 4296 states and 6209 transitions. [2024-12-02 14:37:41,597 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:37:41,598 INFO L276 IsEmpty]: Start isEmpty. Operand 4296 states and 6209 transitions. [2024-12-02 14:37:41,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-12-02 14:37:41,600 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:37:41,600 INFO L218 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] [2024-12-02 14:37:41,600 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-12-02 14:37:41,600 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 14:37:41,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:37:41,601 INFO L85 PathProgramCache]: Analyzing trace with hash -1507478329, now seen corresponding path program 1 times [2024-12-02 14:37:41,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:37:41,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341399722] [2024-12-02 14:37:41,601 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:37:41,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:37:41,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:37:41,739 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-12-02 14:37:41,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:37:41,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341399722] [2024-12-02 14:37:41,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [341399722] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 14:37:41,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 14:37:41,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-12-02 14:37:41,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161933006] [2024-12-02 14:37:41,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 14:37:41,741 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-02 14:37:41,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:37:41,741 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-02 14:37:41,742 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-12-02 14:37:41,742 INFO L87 Difference]: Start difference. First operand 4296 states and 6209 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:37:41,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:37:41,823 INFO L93 Difference]: Finished difference Result 7676 states and 11195 transitions. [2024-12-02 14:37:41,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-02 14:37:41,824 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2024-12-02 14:37:41,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:37:41,845 INFO L225 Difference]: With dead ends: 7676 [2024-12-02 14:37:41,845 INFO L226 Difference]: Without dead ends: 6122 [2024-12-02 14:37:41,848 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-12-02 14:37:41,849 INFO L435 NwaCegarLoop]: 201 mSDtfsCounter, 325 mSDsluCounter, 327 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 325 SdHoareTripleChecker+Valid, 528 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 14:37:41,849 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [325 Valid, 528 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 14:37:41,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6122 states. [2024-12-02 14:37:41,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6122 to 5572. [2024-12-02 14:37:41,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5572 states, 5571 states have (on average 1.4448034464189552) internal successors, (8049), 5571 states have internal predecessors, (8049), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:37:41,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5572 states to 5572 states and 8049 transitions. [2024-12-02 14:37:41,999 INFO L78 Accepts]: Start accepts. Automaton has 5572 states and 8049 transitions. Word has length 61 [2024-12-02 14:37:41,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:37:41,999 INFO L471 AbstractCegarLoop]: Abstraction has 5572 states and 8049 transitions. [2024-12-02 14:37:41,999 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:37:41,999 INFO L276 IsEmpty]: Start isEmpty. Operand 5572 states and 8049 transitions. [2024-12-02 14:37:42,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-12-02 14:37:42,001 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:37:42,002 INFO L218 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] [2024-12-02 14:37:42,002 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-12-02 14:37:42,002 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 14:37:42,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:37:42,003 INFO L85 PathProgramCache]: Analyzing trace with hash 910806190, now seen corresponding path program 1 times [2024-12-02 14:37:42,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:37:42,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351954209] [2024-12-02 14:37:42,003 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:37:42,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:37:42,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:37:42,071 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:37:42,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:37:42,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351954209] [2024-12-02 14:37:42,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [351954209] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 14:37:42,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 14:37:42,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-02 14:37:42,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524371776] [2024-12-02 14:37:42,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 14:37:42,072 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 14:37:42,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:37:42,073 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 14:37:42,073 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 14:37:42,073 INFO L87 Difference]: Start difference. First operand 5572 states and 8049 transitions. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:37:42,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:37:42,129 INFO L93 Difference]: Finished difference Result 9015 states and 12955 transitions. [2024-12-02 14:37:42,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 14:37:42,129 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2024-12-02 14:37:42,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:37:42,147 INFO L225 Difference]: With dead ends: 9015 [2024-12-02 14:37:42,147 INFO L226 Difference]: Without dead ends: 5862 [2024-12-02 14:37:42,151 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 14:37:42,152 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 62 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 14:37:42,152 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 243 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 14:37:42,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5862 states. [2024-12-02 14:37:42,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5862 to 5636. [2024-12-02 14:37:42,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5636 states, 5635 states have (on average 1.4175687666370895) internal successors, (7988), 5635 states have internal predecessors, (7988), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:37:42,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5636 states to 5636 states and 7988 transitions. [2024-12-02 14:37:42,278 INFO L78 Accepts]: Start accepts. Automaton has 5636 states and 7988 transitions. Word has length 61 [2024-12-02 14:37:42,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:37:42,278 INFO L471 AbstractCegarLoop]: Abstraction has 5636 states and 7988 transitions. [2024-12-02 14:37:42,278 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:37:42,278 INFO L276 IsEmpty]: Start isEmpty. Operand 5636 states and 7988 transitions. [2024-12-02 14:37:42,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-12-02 14:37:42,280 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:37:42,280 INFO L218 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] [2024-12-02 14:37:42,280 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-12-02 14:37:42,280 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 14:37:42,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:37:42,281 INFO L85 PathProgramCache]: Analyzing trace with hash -632426569, now seen corresponding path program 1 times [2024-12-02 14:37:42,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:37:42,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883374005] [2024-12-02 14:37:42,281 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:37:42,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:37:42,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:37:42,404 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-12-02 14:37:42,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:37:42,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883374005] [2024-12-02 14:37:42,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1883374005] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 14:37:42,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 14:37:42,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-12-02 14:37:42,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602385051] [2024-12-02 14:37:42,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 14:37:42,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-02 14:37:42,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:37:42,405 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-02 14:37:42,405 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-12-02 14:37:42,406 INFO L87 Difference]: Start difference. First operand 5636 states and 7988 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:37:42,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:37:42,496 INFO L93 Difference]: Finished difference Result 7819 states and 11179 transitions. [2024-12-02 14:37:42,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-02 14:37:42,497 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2024-12-02 14:37:42,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:37:42,513 INFO L225 Difference]: With dead ends: 7819 [2024-12-02 14:37:42,513 INFO L226 Difference]: Without dead ends: 7005 [2024-12-02 14:37:42,516 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-12-02 14:37:42,517 INFO L435 NwaCegarLoop]: 190 mSDtfsCounter, 330 mSDsluCounter, 317 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 330 SdHoareTripleChecker+Valid, 507 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 14:37:42,517 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [330 Valid, 507 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 14:37:42,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7005 states. [2024-12-02 14:37:42,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7005 to 6432. [2024-12-02 14:37:42,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6432 states, 6431 states have (on average 1.4193749028144924) internal successors, (9128), 6431 states have internal predecessors, (9128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:37:42,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6432 states to 6432 states and 9128 transitions. [2024-12-02 14:37:42,638 INFO L78 Accepts]: Start accepts. Automaton has 6432 states and 9128 transitions. Word has length 61 [2024-12-02 14:37:42,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:37:42,639 INFO L471 AbstractCegarLoop]: Abstraction has 6432 states and 9128 transitions. [2024-12-02 14:37:42,639 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:37:42,639 INFO L276 IsEmpty]: Start isEmpty. Operand 6432 states and 9128 transitions. [2024-12-02 14:37:42,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-12-02 14:37:42,641 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:37:42,641 INFO L218 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] [2024-12-02 14:37:42,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-12-02 14:37:42,641 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 14:37:42,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:37:42,642 INFO L85 PathProgramCache]: Analyzing trace with hash -1466148538, now seen corresponding path program 1 times [2024-12-02 14:37:42,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:37:42,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511177460] [2024-12-02 14:37:42,642 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:37:42,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:37:42,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:37:43,013 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:37:43,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:37:43,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511177460] [2024-12-02 14:37:43,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [511177460] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 14:37:43,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [859347681] [2024-12-02 14:37:43,013 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:37:43,013 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 14:37:43,013 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64dfb5de-24a6-477f-bc41-806157af07bc/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 14:37:43,015 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64dfb5de-24a6-477f-bc41-806157af07bc/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 14:37:43,017 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64dfb5de-24a6-477f-bc41-806157af07bc/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-12-02 14:37:43,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:37:43,145 INFO L256 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-12-02 14:37:43,151 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 14:37:43,802 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:37:43,802 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 14:37:44,292 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:37:44,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [859347681] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 14:37:44,292 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 14:37:44,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 8] total 23 [2024-12-02 14:37:44,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675758555] [2024-12-02 14:37:44,292 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 14:37:44,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-12-02 14:37:44,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:37:44,293 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-12-02 14:37:44,293 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=406, Unknown=0, NotChecked=0, Total=506 [2024-12-02 14:37:44,294 INFO L87 Difference]: Start difference. First operand 6432 states and 9128 transitions. Second operand has 23 states, 23 states have (on average 7.695652173913044) internal successors, (177), 23 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:37:52,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:37:52,157 INFO L93 Difference]: Finished difference Result 43375 states and 60937 transitions. [2024-12-02 14:37:52,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 137 states. [2024-12-02 14:37:52,157 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 7.695652173913044) internal successors, (177), 23 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2024-12-02 14:37:52,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:37:52,214 INFO L225 Difference]: With dead ends: 43375 [2024-12-02 14:37:52,214 INFO L226 Difference]: Without dead ends: 36671 [2024-12-02 14:37:52,227 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9681 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=4083, Invalid=20723, Unknown=0, NotChecked=0, Total=24806 [2024-12-02 14:37:52,228 INFO L435 NwaCegarLoop]: 121 mSDtfsCounter, 8480 mSDsluCounter, 1756 mSDsCounter, 0 mSdLazyCounter, 2583 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8480 SdHoareTripleChecker+Valid, 1877 SdHoareTripleChecker+Invalid, 2707 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 2583 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-12-02 14:37:52,228 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8480 Valid, 1877 Invalid, 2707 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 2583 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-12-02 14:37:52,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36671 states. [2024-12-02 14:37:52,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36671 to 24680. [2024-12-02 14:37:52,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24680 states, 24679 states have (on average 1.399165282223753) internal successors, (34530), 24679 states have internal predecessors, (34530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:37:52,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24680 states to 24680 states and 34530 transitions. [2024-12-02 14:37:52,599 INFO L78 Accepts]: Start accepts. Automaton has 24680 states and 34530 transitions. Word has length 62 [2024-12-02 14:37:52,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:37:52,600 INFO L471 AbstractCegarLoop]: Abstraction has 24680 states and 34530 transitions. [2024-12-02 14:37:52,600 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 7.695652173913044) internal successors, (177), 23 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:37:52,600 INFO L276 IsEmpty]: Start isEmpty. Operand 24680 states and 34530 transitions. [2024-12-02 14:37:52,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-12-02 14:37:52,602 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:37:52,602 INFO L218 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] [2024-12-02 14:37:52,609 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64dfb5de-24a6-477f-bc41-806157af07bc/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-12-02 14:37:52,802 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64dfb5de-24a6-477f-bc41-806157af07bc/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 14:37:52,803 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 14:37:52,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:37:52,803 INFO L85 PathProgramCache]: Analyzing trace with hash 1241645965, now seen corresponding path program 1 times [2024-12-02 14:37:52,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:37:52,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569744486] [2024-12-02 14:37:52,803 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:37:52,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:37:52,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:37:52,868 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:37:52,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:37:52,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569744486] [2024-12-02 14:37:52,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [569744486] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 14:37:52,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 14:37:52,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-02 14:37:52,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176155840] [2024-12-02 14:37:52,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 14:37:52,869 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 14:37:52,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:37:52,869 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 14:37:52,870 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 14:37:52,870 INFO L87 Difference]: Start difference. First operand 24680 states and 34530 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:37:53,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:37:53,104 INFO L93 Difference]: Finished difference Result 65477 states and 91277 transitions. [2024-12-02 14:37:53,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 14:37:53,105 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2024-12-02 14:37:53,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:37:53,158 INFO L225 Difference]: With dead ends: 65477 [2024-12-02 14:37:53,159 INFO L226 Difference]: Without dead ends: 43740 [2024-12-02 14:37:53,178 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 14:37:53,178 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 57 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 14:37:53,179 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 223 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 14:37:53,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43740 states. [2024-12-02 14:37:53,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43740 to 43689. [2024-12-02 14:37:53,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43689 states, 43688 states have (on average 1.374816883354697) internal successors, (60063), 43688 states have internal predecessors, (60063), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:37:53,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43689 states to 43689 states and 60063 transitions. [2024-12-02 14:37:53,882 INFO L78 Accepts]: Start accepts. Automaton has 43689 states and 60063 transitions. Word has length 63 [2024-12-02 14:37:53,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:37:53,882 INFO L471 AbstractCegarLoop]: Abstraction has 43689 states and 60063 transitions. [2024-12-02 14:37:53,882 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:37:53,883 INFO L276 IsEmpty]: Start isEmpty. Operand 43689 states and 60063 transitions. [2024-12-02 14:37:53,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-12-02 14:37:53,885 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:37:53,885 INFO L218 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] [2024-12-02 14:37:53,886 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-12-02 14:37:53,886 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 14:37:53,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:37:53,886 INFO L85 PathProgramCache]: Analyzing trace with hash 1327129075, now seen corresponding path program 1 times [2024-12-02 14:37:53,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:37:53,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365525844] [2024-12-02 14:37:53,886 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:37:53,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:37:53,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:37:53,987 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-12-02 14:37:53,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:37:53,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365525844] [2024-12-02 14:37:53,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1365525844] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 14:37:53,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 14:37:53,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-12-02 14:37:53,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105418405] [2024-12-02 14:37:53,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 14:37:53,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-02 14:37:53,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:37:53,989 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-02 14:37:53,989 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-12-02 14:37:53,989 INFO L87 Difference]: Start difference. First operand 43689 states and 60063 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:37:54,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:37:54,462 INFO L93 Difference]: Finished difference Result 74095 states and 102726 transitions. [2024-12-02 14:37:54,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-02 14:37:54,463 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2024-12-02 14:37:54,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:37:54,553 INFO L225 Difference]: With dead ends: 74095 [2024-12-02 14:37:54,553 INFO L226 Difference]: Without dead ends: 61194 [2024-12-02 14:37:54,572 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-12-02 14:37:54,572 INFO L435 NwaCegarLoop]: 205 mSDtfsCounter, 316 mSDsluCounter, 363 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 316 SdHoareTripleChecker+Valid, 568 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 14:37:54,573 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [316 Valid, 568 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 14:37:54,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61194 states. [2024-12-02 14:37:55,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61194 to 54770. [2024-12-02 14:37:55,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54770 states, 54769 states have (on average 1.3714144862969928) internal successors, (75111), 54769 states have internal predecessors, (75111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:37:55,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54770 states to 54770 states and 75111 transitions. [2024-12-02 14:37:55,248 INFO L78 Accepts]: Start accepts. Automaton has 54770 states and 75111 transitions. Word has length 64 [2024-12-02 14:37:55,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:37:55,248 INFO L471 AbstractCegarLoop]: Abstraction has 54770 states and 75111 transitions. [2024-12-02 14:37:55,248 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:37:55,248 INFO L276 IsEmpty]: Start isEmpty. Operand 54770 states and 75111 transitions. [2024-12-02 14:37:55,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-12-02 14:37:55,251 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:37:55,251 INFO L218 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] [2024-12-02 14:37:55,251 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-12-02 14:37:55,251 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 14:37:55,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:37:55,252 INFO L85 PathProgramCache]: Analyzing trace with hash -142036332, now seen corresponding path program 1 times [2024-12-02 14:37:55,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:37:55,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733467760] [2024-12-02 14:37:55,252 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:37:55,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:37:55,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:37:55,291 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:37:55,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:37:55,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733467760] [2024-12-02 14:37:55,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1733467760] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 14:37:55,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 14:37:55,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-02 14:37:55,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489837504] [2024-12-02 14:37:55,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 14:37:55,292 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 14:37:55,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:37:55,292 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 14:37:55,293 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 14:37:55,293 INFO L87 Difference]: Start difference. First operand 54770 states and 75111 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:37:55,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:37:55,769 INFO L93 Difference]: Finished difference Result 111909 states and 153235 transitions. [2024-12-02 14:37:55,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 14:37:55,770 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2024-12-02 14:37:55,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:37:55,838 INFO L225 Difference]: With dead ends: 111909 [2024-12-02 14:37:55,838 INFO L226 Difference]: Without dead ends: 59840 [2024-12-02 14:37:55,868 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 14:37:55,869 INFO L435 NwaCegarLoop]: 156 mSDtfsCounter, 57 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 14:37:55,869 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 253 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 14:37:56,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59840 states. [2024-12-02 14:37:56,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59840 to 49639. [2024-12-02 14:37:56,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49639 states, 49638 states have (on average 1.3589588621620532) internal successors, (67456), 49638 states have internal predecessors, (67456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:37:56,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49639 states to 49639 states and 67456 transitions. [2024-12-02 14:37:56,591 INFO L78 Accepts]: Start accepts. Automaton has 49639 states and 67456 transitions. Word has length 66 [2024-12-02 14:37:56,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:37:56,592 INFO L471 AbstractCegarLoop]: Abstraction has 49639 states and 67456 transitions. [2024-12-02 14:37:56,592 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:37:56,592 INFO L276 IsEmpty]: Start isEmpty. Operand 49639 states and 67456 transitions. [2024-12-02 14:37:56,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-12-02 14:37:56,595 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:37:56,595 INFO L218 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] [2024-12-02 14:37:56,595 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-12-02 14:37:56,595 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 14:37:56,596 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:37:56,596 INFO L85 PathProgramCache]: Analyzing trace with hash -246297914, now seen corresponding path program 1 times [2024-12-02 14:37:56,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:37:56,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100026148] [2024-12-02 14:37:56,596 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:37:56,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:37:56,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:37:56,688 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-12-02 14:37:56,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:37:56,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100026148] [2024-12-02 14:37:56,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1100026148] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 14:37:56,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 14:37:56,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-12-02 14:37:56,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448079540] [2024-12-02 14:37:56,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 14:37:56,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-02 14:37:56,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:37:56,689 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-02 14:37:56,690 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-12-02 14:37:56,690 INFO L87 Difference]: Start difference. First operand 49639 states and 67456 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:37:57,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:37:57,151 INFO L93 Difference]: Finished difference Result 115884 states and 157230 transitions. [2024-12-02 14:37:57,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-02 14:37:57,151 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2024-12-02 14:37:57,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:37:57,248 INFO L225 Difference]: With dead ends: 115884 [2024-12-02 14:37:57,248 INFO L226 Difference]: Without dead ends: 66351 [2024-12-02 14:37:57,288 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-12-02 14:37:57,288 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 428 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 428 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-12-02 14:37:57,289 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [428 Valid, 141 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-12-02 14:37:57,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66351 states. [2024-12-02 14:37:58,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66351 to 65793. [2024-12-02 14:37:58,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65793 states, 65792 states have (on average 1.3446315661478598) internal successors, (88466), 65792 states have internal predecessors, (88466), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:37:58,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65793 states to 65793 states and 88466 transitions. [2024-12-02 14:37:58,360 INFO L78 Accepts]: Start accepts. Automaton has 65793 states and 88466 transitions. Word has length 68 [2024-12-02 14:37:58,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:37:58,360 INFO L471 AbstractCegarLoop]: Abstraction has 65793 states and 88466 transitions. [2024-12-02 14:37:58,360 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:37:58,360 INFO L276 IsEmpty]: Start isEmpty. Operand 65793 states and 88466 transitions. [2024-12-02 14:37:58,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-12-02 14:37:58,363 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:37:58,363 INFO L218 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] [2024-12-02 14:37:58,363 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-12-02 14:37:58,363 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 14:37:58,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:37:58,364 INFO L85 PathProgramCache]: Analyzing trace with hash -403245781, now seen corresponding path program 1 times [2024-12-02 14:37:58,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:37:58,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474981769] [2024-12-02 14:37:58,364 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:37:58,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:37:58,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:37:58,506 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:37:58,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:37:58,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474981769] [2024-12-02 14:37:58,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [474981769] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 14:37:58,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [849613308] [2024-12-02 14:37:58,507 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:37:58,507 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 14:37:58,507 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64dfb5de-24a6-477f-bc41-806157af07bc/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 14:37:58,509 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64dfb5de-24a6-477f-bc41-806157af07bc/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 14:37:58,511 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64dfb5de-24a6-477f-bc41-806157af07bc/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-12-02 14:37:58,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:37:58,627 INFO L256 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-12-02 14:37:58,630 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 14:37:58,837 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:37:58,837 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 14:37:58,928 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:37:58,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [849613308] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 14:37:58,928 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 14:37:58,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2024-12-02 14:37:58,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046372349] [2024-12-02 14:37:58,929 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 14:37:58,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-12-02 14:37:58,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:37:58,930 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-12-02 14:37:58,930 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-12-02 14:37:58,930 INFO L87 Difference]: Start difference. First operand 65793 states and 88466 transitions. Second operand has 11 states, 11 states have (on average 10.454545454545455) internal successors, (115), 10 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:37:59,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:37:59,411 INFO L93 Difference]: Finished difference Result 124507 states and 167857 transitions. [2024-12-02 14:37:59,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-12-02 14:37:59,412 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 10.454545454545455) internal successors, (115), 10 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2024-12-02 14:37:59,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:37:59,495 INFO L225 Difference]: With dead ends: 124507 [2024-12-02 14:37:59,495 INFO L226 Difference]: Without dead ends: 80362 [2024-12-02 14:37:59,525 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 126 SyntacticMatches, 5 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2024-12-02 14:37:59,526 INFO L435 NwaCegarLoop]: 68 mSDtfsCounter, 1409 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1409 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-12-02 14:37:59,526 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1409 Valid, 309 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-12-02 14:37:59,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80362 states. [2024-12-02 14:38:00,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80362 to 63294. [2024-12-02 14:38:00,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63294 states, 63293 states have (on average 1.344761664007078) internal successors, (85114), 63293 states have internal predecessors, (85114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:38:00,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63294 states to 63294 states and 85114 transitions. [2024-12-02 14:38:00,464 INFO L78 Accepts]: Start accepts. Automaton has 63294 states and 85114 transitions. Word has length 68 [2024-12-02 14:38:00,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:38:00,464 INFO L471 AbstractCegarLoop]: Abstraction has 63294 states and 85114 transitions. [2024-12-02 14:38:00,464 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.454545454545455) internal successors, (115), 10 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:38:00,465 INFO L276 IsEmpty]: Start isEmpty. Operand 63294 states and 85114 transitions. [2024-12-02 14:38:00,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-12-02 14:38:00,466 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:38:00,467 INFO L218 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] [2024-12-02 14:38:00,473 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64dfb5de-24a6-477f-bc41-806157af07bc/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-12-02 14:38:00,667 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64dfb5de-24a6-477f-bc41-806157af07bc/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-12-02 14:38:00,667 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 14:38:00,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:38:00,668 INFO L85 PathProgramCache]: Analyzing trace with hash 2102242617, now seen corresponding path program 1 times [2024-12-02 14:38:00,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:38:00,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282441826] [2024-12-02 14:38:00,668 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:38:00,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:38:00,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:38:00,740 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-12-02 14:38:00,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:38:00,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282441826] [2024-12-02 14:38:00,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1282441826] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 14:38:00,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 14:38:00,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-12-02 14:38:00,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628933760] [2024-12-02 14:38:00,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 14:38:00,740 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-02 14:38:00,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:38:00,741 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-02 14:38:00,741 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-12-02 14:38:00,741 INFO L87 Difference]: Start difference. First operand 63294 states and 85114 transitions. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:38:01,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:38:01,150 INFO L93 Difference]: Finished difference Result 148492 states and 198468 transitions. [2024-12-02 14:38:01,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-02 14:38:01,150 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2024-12-02 14:38:01,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:38:01,221 INFO L225 Difference]: With dead ends: 148492 [2024-12-02 14:38:01,222 INFO L226 Difference]: Without dead ends: 85359 [2024-12-02 14:38:01,252 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-12-02 14:38:01,252 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 453 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 453 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-12-02 14:38:01,253 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [453 Valid, 129 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-12-02 14:38:01,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85359 states. [2024-12-02 14:38:02,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85359 to 63294. [2024-12-02 14:38:02,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63294 states, 63293 states have (on average 1.3303682871723572) internal successors, (84203), 63293 states have internal predecessors, (84203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:38:02,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63294 states to 63294 states and 84203 transitions. [2024-12-02 14:38:02,297 INFO L78 Accepts]: Start accepts. Automaton has 63294 states and 84203 transitions. Word has length 69 [2024-12-02 14:38:02,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:38:02,297 INFO L471 AbstractCegarLoop]: Abstraction has 63294 states and 84203 transitions. [2024-12-02 14:38:02,297 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:38:02,297 INFO L276 IsEmpty]: Start isEmpty. Operand 63294 states and 84203 transitions. [2024-12-02 14:38:02,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-12-02 14:38:02,301 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:38:02,301 INFO L218 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] [2024-12-02 14:38:02,301 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-12-02 14:38:02,301 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 14:38:02,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:38:02,301 INFO L85 PathProgramCache]: Analyzing trace with hash 1026910238, now seen corresponding path program 1 times [2024-12-02 14:38:02,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:38:02,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730868050] [2024-12-02 14:38:02,302 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:38:02,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:38:02,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:38:02,444 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:38:02,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:38:02,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730868050] [2024-12-02 14:38:02,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [730868050] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 14:38:02,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [942070987] [2024-12-02 14:38:02,445 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:38:02,445 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 14:38:02,445 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64dfb5de-24a6-477f-bc41-806157af07bc/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 14:38:02,447 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64dfb5de-24a6-477f-bc41-806157af07bc/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 14:38:02,448 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64dfb5de-24a6-477f-bc41-806157af07bc/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-12-02 14:38:02,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:38:02,570 INFO L256 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-12-02 14:38:02,573 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 14:38:02,798 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:38:02,798 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 14:38:02,912 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:38:02,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [942070987] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 14:38:02,912 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 14:38:02,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2024-12-02 14:38:02,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334746171] [2024-12-02 14:38:02,912 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 14:38:02,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-12-02 14:38:02,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:38:02,913 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-12-02 14:38:02,913 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-12-02 14:38:02,914 INFO L87 Difference]: Start difference. First operand 63294 states and 84203 transitions. Second operand has 11 states, 11 states have (on average 10.909090909090908) internal successors, (120), 10 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:38:03,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:38:03,603 INFO L93 Difference]: Finished difference Result 115984 states and 154027 transitions. [2024-12-02 14:38:03,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-12-02 14:38:03,603 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 10.909090909090908) internal successors, (120), 10 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2024-12-02 14:38:03,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:38:03,669 INFO L225 Difference]: With dead ends: 115984 [2024-12-02 14:38:03,670 INFO L226 Difference]: Without dead ends: 85561 [2024-12-02 14:38:03,685 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 128 SyntacticMatches, 5 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2024-12-02 14:38:03,685 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 589 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 253 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 589 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-12-02 14:38:03,685 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [589 Valid, 344 Invalid, 263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 253 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-12-02 14:38:03,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85561 states. [2024-12-02 14:38:04,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85561 to 69133. [2024-12-02 14:38:04,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69133 states, 69132 states have (on average 1.3289793438639126) internal successors, (91875), 69132 states have internal predecessors, (91875), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:38:04,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69133 states to 69133 states and 91875 transitions. [2024-12-02 14:38:04,450 INFO L78 Accepts]: Start accepts. Automaton has 69133 states and 91875 transitions. Word has length 69 [2024-12-02 14:38:04,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:38:04,450 INFO L471 AbstractCegarLoop]: Abstraction has 69133 states and 91875 transitions. [2024-12-02 14:38:04,450 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.909090909090908) internal successors, (120), 10 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:38:04,450 INFO L276 IsEmpty]: Start isEmpty. Operand 69133 states and 91875 transitions. [2024-12-02 14:38:04,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-12-02 14:38:04,452 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:38:04,452 INFO L218 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] [2024-12-02 14:38:04,460 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64dfb5de-24a6-477f-bc41-806157af07bc/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-12-02 14:38:04,653 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64dfb5de-24a6-477f-bc41-806157af07bc/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 14:38:04,653 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 14:38:04,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:38:04,653 INFO L85 PathProgramCache]: Analyzing trace with hash 605235336, now seen corresponding path program 1 times [2024-12-02 14:38:04,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:38:04,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206455699] [2024-12-02 14:38:04,654 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:38:04,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:38:04,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:38:04,737 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:38:04,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:38:04,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206455699] [2024-12-02 14:38:04,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [206455699] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 14:38:04,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [132793708] [2024-12-02 14:38:04,737 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:38:04,738 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 14:38:04,738 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64dfb5de-24a6-477f-bc41-806157af07bc/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 14:38:04,739 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64dfb5de-24a6-477f-bc41-806157af07bc/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 14:38:04,741 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64dfb5de-24a6-477f-bc41-806157af07bc/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-12-02 14:38:04,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:38:04,852 INFO L256 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-12-02 14:38:04,854 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 14:38:05,031 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:38:05,031 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 14:38:05,122 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:38:05,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [132793708] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 14:38:05,122 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 14:38:05,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2024-12-02 14:38:05,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181845680] [2024-12-02 14:38:05,122 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 14:38:05,123 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-12-02 14:38:05,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:38:05,123 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-12-02 14:38:05,123 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-12-02 14:38:05,123 INFO L87 Difference]: Start difference. First operand 69133 states and 91875 transitions. Second operand has 11 states, 11 states have (on average 10.727272727272727) internal successors, (118), 10 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:38:05,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:38:05,669 INFO L93 Difference]: Finished difference Result 149591 states and 198156 transitions. [2024-12-02 14:38:05,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-12-02 14:38:05,670 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 10.727272727272727) internal successors, (118), 10 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2024-12-02 14:38:05,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:38:05,736 INFO L225 Difference]: With dead ends: 149591 [2024-12-02 14:38:05,736 INFO L226 Difference]: Without dead ends: 82263 [2024-12-02 14:38:05,756 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 130 SyntacticMatches, 5 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2024-12-02 14:38:05,757 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 804 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 804 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-12-02 14:38:05,757 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [804 Valid, 218 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-12-02 14:38:05,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82263 states. [2024-12-02 14:38:06,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82263 to 70527. [2024-12-02 14:38:06,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70527 states, 70526 states have (on average 1.3234551796500582) internal successors, (93338), 70526 states have internal predecessors, (93338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:38:06,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70527 states to 70527 states and 93338 transitions. [2024-12-02 14:38:06,656 INFO L78 Accepts]: Start accepts. Automaton has 70527 states and 93338 transitions. Word has length 70 [2024-12-02 14:38:06,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:38:06,656 INFO L471 AbstractCegarLoop]: Abstraction has 70527 states and 93338 transitions. [2024-12-02 14:38:06,656 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.727272727272727) internal successors, (118), 10 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:38:06,656 INFO L276 IsEmpty]: Start isEmpty. Operand 70527 states and 93338 transitions. [2024-12-02 14:38:06,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-12-02 14:38:06,660 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:38:06,660 INFO L218 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] [2024-12-02 14:38:06,667 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64dfb5de-24a6-477f-bc41-806157af07bc/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-12-02 14:38:06,860 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64dfb5de-24a6-477f-bc41-806157af07bc/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable19 [2024-12-02 14:38:06,861 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 14:38:06,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:38:06,861 INFO L85 PathProgramCache]: Analyzing trace with hash -223457712, now seen corresponding path program 1 times [2024-12-02 14:38:06,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:38:06,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535796827] [2024-12-02 14:38:06,862 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:38:06,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:38:06,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:38:07,088 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:38:07,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:38:07,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535796827] [2024-12-02 14:38:07,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1535796827] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 14:38:07,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1855708458] [2024-12-02 14:38:07,088 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:38:07,089 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 14:38:07,089 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64dfb5de-24a6-477f-bc41-806157af07bc/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 14:38:07,090 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64dfb5de-24a6-477f-bc41-806157af07bc/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 14:38:07,091 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64dfb5de-24a6-477f-bc41-806157af07bc/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-12-02 14:38:07,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:38:07,215 INFO L256 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-12-02 14:38:07,217 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 14:38:07,642 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:38:07,643 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 14:38:08,162 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:38:08,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1855708458] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 14:38:08,162 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 14:38:08,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 22 [2024-12-02 14:38:08,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792589938] [2024-12-02 14:38:08,162 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 14:38:08,163 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-12-02 14:38:08,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:38:08,164 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-12-02 14:38:08,164 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=412, Unknown=0, NotChecked=0, Total=506 [2024-12-02 14:38:08,164 INFO L87 Difference]: Start difference. First operand 70527 states and 93338 transitions. Second operand has 23 states, 23 states have (on average 6.739130434782608) internal successors, (155), 22 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:38:09,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:38:09,610 INFO L93 Difference]: Finished difference Result 277049 states and 367164 transitions. [2024-12-02 14:38:09,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-12-02 14:38:09,611 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 6.739130434782608) internal successors, (155), 22 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2024-12-02 14:38:09,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:38:09,825 INFO L225 Difference]: With dead ends: 277049 [2024-12-02 14:38:09,825 INFO L226 Difference]: Without dead ends: 208587 [2024-12-02 14:38:09,880 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 303 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=420, Invalid=1220, Unknown=0, NotChecked=0, Total=1640 [2024-12-02 14:38:09,881 INFO L435 NwaCegarLoop]: 171 mSDtfsCounter, 1105 mSDsluCounter, 1104 mSDsCounter, 0 mSdLazyCounter, 1035 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1105 SdHoareTripleChecker+Valid, 1275 SdHoareTripleChecker+Invalid, 1046 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1035 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-12-02 14:38:09,881 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1105 Valid, 1275 Invalid, 1046 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1035 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-12-02 14:38:09,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208587 states. [2024-12-02 14:38:11,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208587 to 136027. [2024-12-02 14:38:11,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136027 states, 136026 states have (on average 1.32018143590196) internal successors, (179579), 136026 states have internal predecessors, (179579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:38:11,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136027 states to 136027 states and 179579 transitions. [2024-12-02 14:38:11,890 INFO L78 Accepts]: Start accepts. Automaton has 136027 states and 179579 transitions. Word has length 71 [2024-12-02 14:38:11,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:38:11,890 INFO L471 AbstractCegarLoop]: Abstraction has 136027 states and 179579 transitions. [2024-12-02 14:38:11,890 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 6.739130434782608) internal successors, (155), 22 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:38:11,890 INFO L276 IsEmpty]: Start isEmpty. Operand 136027 states and 179579 transitions. [2024-12-02 14:38:11,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-12-02 14:38:11,893 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:38:11,893 INFO L218 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] [2024-12-02 14:38:11,900 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64dfb5de-24a6-477f-bc41-806157af07bc/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-12-02 14:38:12,093 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64dfb5de-24a6-477f-bc41-806157af07bc/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2024-12-02 14:38:12,094 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 14:38:12,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:38:12,094 INFO L85 PathProgramCache]: Analyzing trace with hash -597600141, now seen corresponding path program 1 times [2024-12-02 14:38:12,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:38:12,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248540276] [2024-12-02 14:38:12,095 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:38:12,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:38:12,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:38:12,325 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:38:12,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:38:12,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248540276] [2024-12-02 14:38:12,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1248540276] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 14:38:12,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1970605281] [2024-12-02 14:38:12,326 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:38:12,326 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 14:38:12,326 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64dfb5de-24a6-477f-bc41-806157af07bc/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 14:38:12,328 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64dfb5de-24a6-477f-bc41-806157af07bc/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 14:38:12,329 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64dfb5de-24a6-477f-bc41-806157af07bc/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-12-02 14:38:12,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:38:12,447 INFO L256 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-12-02 14:38:12,449 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 14:38:13,505 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:38:13,505 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 14:38:14,203 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:38:14,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1970605281] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 14:38:14,203 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 14:38:14,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 13, 13] total 32 [2024-12-02 14:38:14,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766962318] [2024-12-02 14:38:14,203 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 14:38:14,204 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-12-02 14:38:14,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:38:14,204 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-12-02 14:38:14,204 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=892, Unknown=0, NotChecked=0, Total=992 [2024-12-02 14:38:14,205 INFO L87 Difference]: Start difference. First operand 136027 states and 179579 transitions. Second operand has 32 states, 32 states have (on average 5.8125) internal successors, (186), 32 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:39:10,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:39:10,026 INFO L93 Difference]: Finished difference Result 1239045 states and 1614765 transitions. [2024-12-02 14:39:10,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 700 states. [2024-12-02 14:39:10,027 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 5.8125) internal successors, (186), 32 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2024-12-02 14:39:10,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:39:12,376 INFO L225 Difference]: With dead ends: 1239045 [2024-12-02 14:39:12,377 INFO L226 Difference]: Without dead ends: 1141182 [2024-12-02 14:39:12,555 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 848 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 728 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 256777 ImplicationChecksByTransitivity, 45.3s TimeCoverageRelationStatistics Valid=46805, Invalid=485365, Unknown=0, NotChecked=0, Total=532170 [2024-12-02 14:39:12,556 INFO L435 NwaCegarLoop]: 223 mSDtfsCounter, 16674 mSDsluCounter, 5095 mSDsCounter, 0 mSdLazyCounter, 6933 mSolverCounterSat, 203 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16674 SdHoareTripleChecker+Valid, 5318 SdHoareTripleChecker+Invalid, 7136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 203 IncrementalHoareTripleChecker+Valid, 6933 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.0s IncrementalHoareTripleChecker+Time [2024-12-02 14:39:12,557 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16674 Valid, 5318 Invalid, 7136 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [203 Valid, 6933 Invalid, 0 Unknown, 0 Unchecked, 6.0s Time] [2024-12-02 14:39:13,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1141182 states. [2024-12-02 14:39:21,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1141182 to 215869. [2024-12-02 14:39:21,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215869 states, 215868 states have (on average 1.3241795912316787) internal successors, (285848), 215868 states have internal predecessors, (285848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:39:21,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215869 states to 215869 states and 285848 transitions. [2024-12-02 14:39:21,577 INFO L78 Accepts]: Start accepts. Automaton has 215869 states and 285848 transitions. Word has length 71 [2024-12-02 14:39:21,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:39:21,577 INFO L471 AbstractCegarLoop]: Abstraction has 215869 states and 285848 transitions. [2024-12-02 14:39:21,577 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 5.8125) internal successors, (186), 32 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:39:21,577 INFO L276 IsEmpty]: Start isEmpty. Operand 215869 states and 285848 transitions. [2024-12-02 14:39:21,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-12-02 14:39:21,583 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:39:21,583 INFO L218 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] [2024-12-02 14:39:21,590 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64dfb5de-24a6-477f-bc41-806157af07bc/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-12-02 14:39:21,783 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64dfb5de-24a6-477f-bc41-806157af07bc/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2024-12-02 14:39:21,783 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 14:39:21,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:39:21,784 INFO L85 PathProgramCache]: Analyzing trace with hash -1601087637, now seen corresponding path program 1 times [2024-12-02 14:39:21,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:39:21,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904230928] [2024-12-02 14:39:21,784 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:39:21,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:39:21,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:39:21,859 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:39:21,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:39:21,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904230928] [2024-12-02 14:39:21,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1904230928] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 14:39:21,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 14:39:21,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-02 14:39:21,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415769478] [2024-12-02 14:39:21,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 14:39:21,860 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 14:39:21,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:39:21,861 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 14:39:21,861 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 14:39:21,861 INFO L87 Difference]: Start difference. First operand 215869 states and 285848 transitions. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:39:22,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:39:22,784 INFO L93 Difference]: Finished difference Result 260456 states and 343915 transitions. [2024-12-02 14:39:22,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 14:39:22,785 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2024-12-02 14:39:22,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:39:22,969 INFO L225 Difference]: With dead ends: 260456 [2024-12-02 14:39:22,969 INFO L226 Difference]: Without dead ends: 190169 [2024-12-02 14:39:23,023 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 14:39:23,024 INFO L435 NwaCegarLoop]: 140 mSDtfsCounter, 51 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 234 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 [2024-12-02 14:39:23,024 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 234 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 14:39:23,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190169 states. [2024-12-02 14:39:24,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190169 to 185599. [2024-12-02 14:39:24,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185599 states, 185598 states have (on average 1.3021045485403937) internal successors, (241668), 185598 states have internal predecessors, (241668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:39:25,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185599 states to 185599 states and 241668 transitions. [2024-12-02 14:39:25,218 INFO L78 Accepts]: Start accepts. Automaton has 185599 states and 241668 transitions. Word has length 72 [2024-12-02 14:39:25,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:39:25,219 INFO L471 AbstractCegarLoop]: Abstraction has 185599 states and 241668 transitions. [2024-12-02 14:39:25,219 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:39:25,219 INFO L276 IsEmpty]: Start isEmpty. Operand 185599 states and 241668 transitions. [2024-12-02 14:39:25,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-12-02 14:39:25,222 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:39:25,222 INFO L218 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] [2024-12-02 14:39:25,223 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-12-02 14:39:25,223 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 14:39:25,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:39:25,223 INFO L85 PathProgramCache]: Analyzing trace with hash 1087206807, now seen corresponding path program 1 times [2024-12-02 14:39:25,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:39:25,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213607308] [2024-12-02 14:39:25,223 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:39:25,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:39:25,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:39:25,532 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-12-02 14:39:25,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:39:25,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213607308] [2024-12-02 14:39:25,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1213607308] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 14:39:25,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 14:39:25,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-02 14:39:25,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511555953] [2024-12-02 14:39:25,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 14:39:25,533 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 14:39:25,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:39:25,534 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 14:39:25,534 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 14:39:25,534 INFO L87 Difference]: Start difference. First operand 185599 states and 241668 transitions. Second operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:39:26,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:39:26,139 INFO L93 Difference]: Finished difference Result 324075 states and 422239 transitions. [2024-12-02 14:39:26,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 14:39:26,139 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2024-12-02 14:39:26,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:39:26,282 INFO L225 Difference]: With dead ends: 324075 [2024-12-02 14:39:26,282 INFO L226 Difference]: Without dead ends: 139107 [2024-12-02 14:39:26,353 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 14:39:26,353 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 82 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 14:39:26,354 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 132 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 14:39:26,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139107 states. [2024-12-02 14:39:28,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139107 to 139107. [2024-12-02 14:39:28,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139107 states, 139106 states have (on average 1.2892398602504564) internal successors, (179341), 139106 states have internal predecessors, (179341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:39:28,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139107 states to 139107 states and 179341 transitions. [2024-12-02 14:39:28,472 INFO L78 Accepts]: Start accepts. Automaton has 139107 states and 179341 transitions. Word has length 72 [2024-12-02 14:39:28,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:39:28,473 INFO L471 AbstractCegarLoop]: Abstraction has 139107 states and 179341 transitions. [2024-12-02 14:39:28,473 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:39:28,473 INFO L276 IsEmpty]: Start isEmpty. Operand 139107 states and 179341 transitions. [2024-12-02 14:39:28,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-12-02 14:39:28,476 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:39:28,476 INFO L218 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] [2024-12-02 14:39:28,476 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-12-02 14:39:28,476 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 14:39:28,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:39:28,476 INFO L85 PathProgramCache]: Analyzing trace with hash -360511201, now seen corresponding path program 1 times [2024-12-02 14:39:28,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:39:28,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635047626] [2024-12-02 14:39:28,477 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:39:28,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:39:28,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:39:29,108 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:39:29,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:39:29,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635047626] [2024-12-02 14:39:29,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1635047626] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 14:39:29,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1059575382] [2024-12-02 14:39:29,109 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:39:29,109 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 14:39:29,109 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64dfb5de-24a6-477f-bc41-806157af07bc/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 14:39:29,110 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64dfb5de-24a6-477f-bc41-806157af07bc/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 14:39:29,112 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64dfb5de-24a6-477f-bc41-806157af07bc/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-12-02 14:39:29,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:39:29,249 INFO L256 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-12-02 14:39:29,251 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 14:39:30,532 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:39:30,532 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 14:39:31,263 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:39:31,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1059575382] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 14:39:31,263 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 14:39:31,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15, 15] total 36 [2024-12-02 14:39:31,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619975078] [2024-12-02 14:39:31,263 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 14:39:31,263 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2024-12-02 14:39:31,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:39:31,264 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2024-12-02 14:39:31,264 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=197, Invalid=1063, Unknown=0, NotChecked=0, Total=1260 [2024-12-02 14:39:31,264 INFO L87 Difference]: Start difference. First operand 139107 states and 179341 transitions. Second operand has 36 states, 36 states have (on average 5.5) internal successors, (198), 36 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:39:33,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:39:33,366 INFO L93 Difference]: Finished difference Result 259427 states and 333155 transitions. [2024-12-02 14:39:33,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-12-02 14:39:33,367 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 5.5) internal successors, (198), 36 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 73 [2024-12-02 14:39:33,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:39:33,542 INFO L225 Difference]: With dead ends: 259427 [2024-12-02 14:39:33,543 INFO L226 Difference]: Without dead ends: 186501 [2024-12-02 14:39:33,574 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 536 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=662, Invalid=2308, Unknown=0, NotChecked=0, Total=2970 [2024-12-02 14:39:33,575 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 2011 mSDsluCounter, 1886 mSDsCounter, 0 mSdLazyCounter, 777 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2011 SdHoareTripleChecker+Valid, 2036 SdHoareTripleChecker+Invalid, 794 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 777 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-12-02 14:39:33,575 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2011 Valid, 2036 Invalid, 794 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 777 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-12-02 14:39:33,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186501 states. [2024-12-02 14:39:34,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186501 to 146422. [2024-12-02 14:39:34,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146422 states, 146421 states have (on average 1.2879436692824118) internal successors, (188582), 146421 states have internal predecessors, (188582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:39:35,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146422 states to 146422 states and 188582 transitions. [2024-12-02 14:39:35,454 INFO L78 Accepts]: Start accepts. Automaton has 146422 states and 188582 transitions. Word has length 73 [2024-12-02 14:39:35,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:39:35,454 INFO L471 AbstractCegarLoop]: Abstraction has 146422 states and 188582 transitions. [2024-12-02 14:39:35,454 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 5.5) internal successors, (198), 36 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:39:35,454 INFO L276 IsEmpty]: Start isEmpty. Operand 146422 states and 188582 transitions. [2024-12-02 14:39:35,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-12-02 14:39:35,458 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:39:35,458 INFO L218 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] [2024-12-02 14:39:35,465 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64dfb5de-24a6-477f-bc41-806157af07bc/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-12-02 14:39:35,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64dfb5de-24a6-477f-bc41-806157af07bc/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2024-12-02 14:39:35,659 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 14:39:35,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:39:35,660 INFO L85 PathProgramCache]: Analyzing trace with hash -1891211123, now seen corresponding path program 1 times [2024-12-02 14:39:35,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:39:35,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552475364] [2024-12-02 14:39:35,660 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:39:35,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:39:35,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:39:35,705 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-12-02 14:39:35,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:39:35,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552475364] [2024-12-02 14:39:35,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1552475364] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 14:39:35,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 14:39:35,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-02 14:39:35,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353668058] [2024-12-02 14:39:35,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 14:39:35,706 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 14:39:35,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:39:35,706 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 14:39:35,706 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 14:39:35,707 INFO L87 Difference]: Start difference. First operand 146422 states and 188582 transitions. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:39:36,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:39:36,423 INFO L93 Difference]: Finished difference Result 258982 states and 334258 transitions. [2024-12-02 14:39:36,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 14:39:36,423 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2024-12-02 14:39:36,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:39:36,580 INFO L225 Difference]: With dead ends: 258982 [2024-12-02 14:39:36,580 INFO L226 Difference]: Without dead ends: 120980 [2024-12-02 14:39:36,645 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 14:39:36,645 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 71 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 14:39:36,645 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 124 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 14:39:36,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120980 states. [2024-12-02 14:39:37,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120980 to 119133. [2024-12-02 14:39:37,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119133 states, 119132 states have (on average 1.2704898767753416) internal successors, (151356), 119132 states have internal predecessors, (151356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:39:38,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119133 states to 119133 states and 151356 transitions. [2024-12-02 14:39:38,133 INFO L78 Accepts]: Start accepts. Automaton has 119133 states and 151356 transitions. Word has length 74 [2024-12-02 14:39:38,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:39:38,134 INFO L471 AbstractCegarLoop]: Abstraction has 119133 states and 151356 transitions. [2024-12-02 14:39:38,134 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:39:38,134 INFO L276 IsEmpty]: Start isEmpty. Operand 119133 states and 151356 transitions. [2024-12-02 14:39:38,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-12-02 14:39:38,149 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:39:38,149 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 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] [2024-12-02 14:39:38,149 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-12-02 14:39:38,149 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 14:39:38,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:39:38,150 INFO L85 PathProgramCache]: Analyzing trace with hash -1799725750, now seen corresponding path program 1 times [2024-12-02 14:39:38,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:39:38,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664820713] [2024-12-02 14:39:38,150 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:39:38,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:39:38,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:39:38,406 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-12-02 14:39:38,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:39:38,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664820713] [2024-12-02 14:39:38,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1664820713] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 14:39:38,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 14:39:38,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-02 14:39:38,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778867824] [2024-12-02 14:39:38,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 14:39:38,407 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 14:39:38,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:39:38,407 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 14:39:38,408 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 14:39:38,408 INFO L87 Difference]: Start difference. First operand 119133 states and 151356 transitions. Second operand has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:39:38,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:39:38,645 INFO L93 Difference]: Finished difference Result 128323 states and 162687 transitions. [2024-12-02 14:39:38,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 14:39:38,645 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 111 [2024-12-02 14:39:38,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:39:38,723 INFO L225 Difference]: With dead ends: 128323 [2024-12-02 14:39:38,724 INFO L226 Difference]: Without dead ends: 91762 [2024-12-02 14:39:38,750 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 14:39:38,751 INFO L435 NwaCegarLoop]: 171 mSDtfsCounter, 44 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 259 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 [2024-12-02 14:39:38,751 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 259 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 14:39:38,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91762 states. [2024-12-02 14:39:39,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91762 to 91760. [2024-12-02 14:39:39,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91760 states, 91759 states have (on average 1.2393661657167145) internal successors, (113723), 91759 states have internal predecessors, (113723), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:39:39,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91760 states to 91760 states and 113723 transitions. [2024-12-02 14:39:39,715 INFO L78 Accepts]: Start accepts. Automaton has 91760 states and 113723 transitions. Word has length 111 [2024-12-02 14:39:39,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:39:39,715 INFO L471 AbstractCegarLoop]: Abstraction has 91760 states and 113723 transitions. [2024-12-02 14:39:39,715 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:39:39,715 INFO L276 IsEmpty]: Start isEmpty. Operand 91760 states and 113723 transitions. [2024-12-02 14:39:39,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-12-02 14:39:39,729 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:39:39,729 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 14:39:39,729 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-12-02 14:39:39,729 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 14:39:39,729 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:39:39,729 INFO L85 PathProgramCache]: Analyzing trace with hash -1880708762, now seen corresponding path program 1 times [2024-12-02 14:39:39,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:39:39,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423666081] [2024-12-02 14:39:39,729 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:39:39,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:39:39,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:39:39,782 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2024-12-02 14:39:39,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:39:39,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423666081] [2024-12-02 14:39:39,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1423666081] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 14:39:39,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 14:39:39,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-02 14:39:39,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637111238] [2024-12-02 14:39:39,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 14:39:39,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 14:39:39,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:39:39,783 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 14:39:39,783 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 14:39:39,783 INFO L87 Difference]: Start difference. First operand 91760 states and 113723 transitions. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:39:40,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:39:40,076 INFO L93 Difference]: Finished difference Result 178771 states and 221686 transitions. [2024-12-02 14:39:40,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 14:39:40,076 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 118 [2024-12-02 14:39:40,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:39:40,154 INFO L225 Difference]: With dead ends: 178771 [2024-12-02 14:39:40,154 INFO L226 Difference]: Without dead ends: 87162 [2024-12-02 14:39:40,193 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 14:39:40,194 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 63 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 14:39:40,194 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 95 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 14:39:40,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87162 states. [2024-12-02 14:39:41,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87162 to 86926. [2024-12-02 14:39:41,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86926 states, 86925 states have (on average 1.2245959160195572) internal successors, (106448), 86925 states have internal predecessors, (106448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:39:41,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86926 states to 86926 states and 106448 transitions. [2024-12-02 14:39:41,418 INFO L78 Accepts]: Start accepts. Automaton has 86926 states and 106448 transitions. Word has length 118 [2024-12-02 14:39:41,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:39:41,418 INFO L471 AbstractCegarLoop]: Abstraction has 86926 states and 106448 transitions. [2024-12-02 14:39:41,418 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:39:41,418 INFO L276 IsEmpty]: Start isEmpty. Operand 86926 states and 106448 transitions. [2024-12-02 14:39:41,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-12-02 14:39:41,438 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:39:41,438 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 14:39:41,438 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-12-02 14:39:41,438 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 14:39:41,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:39:41,438 INFO L85 PathProgramCache]: Analyzing trace with hash -1621382645, now seen corresponding path program 1 times [2024-12-02 14:39:41,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:39:41,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579944505] [2024-12-02 14:39:41,439 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:39:41,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:39:41,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:39:41,556 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-12-02 14:39:41,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:39:41,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579944505] [2024-12-02 14:39:41,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1579944505] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 14:39:41,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 14:39:41,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-02 14:39:41,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184844997] [2024-12-02 14:39:41,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 14:39:41,557 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 14:39:41,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:39:41,558 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 14:39:41,558 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 14:39:41,558 INFO L87 Difference]: Start difference. First operand 86926 states and 106448 transitions. Second operand has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:39:42,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:39:42,098 INFO L93 Difference]: Finished difference Result 146508 states and 179453 transitions. [2024-12-02 14:39:42,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 14:39:42,098 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 118 [2024-12-02 14:39:42,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:39:42,146 INFO L225 Difference]: With dead ends: 146508 [2024-12-02 14:39:42,146 INFO L226 Difference]: Without dead ends: 61578 [2024-12-02 14:39:42,165 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 14:39:42,166 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 51 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 14:39:42,166 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 210 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 14:39:42,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61578 states. [2024-12-02 14:39:42,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61578 to 61576. [2024-12-02 14:39:42,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61576 states, 61575 states have (on average 1.1999187982135606) internal successors, (73885), 61575 states have internal predecessors, (73885), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:39:42,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61576 states to 61576 states and 73885 transitions. [2024-12-02 14:39:42,697 INFO L78 Accepts]: Start accepts. Automaton has 61576 states and 73885 transitions. Word has length 118 [2024-12-02 14:39:42,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:39:42,697 INFO L471 AbstractCegarLoop]: Abstraction has 61576 states and 73885 transitions. [2024-12-02 14:39:42,697 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:39:42,697 INFO L276 IsEmpty]: Start isEmpty. Operand 61576 states and 73885 transitions. [2024-12-02 14:39:42,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-12-02 14:39:42,707 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:39:42,707 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 14:39:42,707 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-12-02 14:39:42,707 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 14:39:42,707 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:39:42,707 INFO L85 PathProgramCache]: Analyzing trace with hash 43526760, now seen corresponding path program 1 times [2024-12-02 14:39:42,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:39:42,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964609332] [2024-12-02 14:39:42,707 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:39:42,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:39:42,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:39:43,332 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 21 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:39:43,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:39:43,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964609332] [2024-12-02 14:39:43,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1964609332] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 14:39:43,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [725380235] [2024-12-02 14:39:43,332 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:39:43,332 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 14:39:43,333 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64dfb5de-24a6-477f-bc41-806157af07bc/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 14:39:43,334 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64dfb5de-24a6-477f-bc41-806157af07bc/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 14:39:43,335 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64dfb5de-24a6-477f-bc41-806157af07bc/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-12-02 14:39:43,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:39:43,458 INFO L256 TraceCheckSpWp]: Trace formula consists of 450 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-12-02 14:39:43,461 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 14:39:44,083 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 54 proven. 28 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-12-02 14:39:44,083 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 14:39:44,700 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 61 proven. 21 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-12-02 14:39:44,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [725380235] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 14:39:44,700 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 14:39:44,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13, 11] total 32 [2024-12-02 14:39:44,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753755834] [2024-12-02 14:39:44,700 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 14:39:44,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-12-02 14:39:44,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:39:44,701 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-12-02 14:39:44,701 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=892, Unknown=0, NotChecked=0, Total=992 [2024-12-02 14:39:44,702 INFO L87 Difference]: Start difference. First operand 61576 states and 73885 transitions. Second operand has 32 states, 32 states have (on average 9.9375) internal successors, (318), 32 states have internal predecessors, (318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:39:52,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:39:52,966 INFO L93 Difference]: Finished difference Result 117288 states and 139669 transitions. [2024-12-02 14:39:52,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2024-12-02 14:39:52,966 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 9.9375) internal successors, (318), 32 states have internal predecessors, (318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 118 [2024-12-02 14:39:52,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:39:53,030 INFO L225 Difference]: With dead ends: 117288 [2024-12-02 14:39:53,030 INFO L226 Difference]: Without dead ends: 90346 [2024-12-02 14:39:53,052 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 358 GetRequests, 238 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3918 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=2651, Invalid=12111, Unknown=0, NotChecked=0, Total=14762 [2024-12-02 14:39:53,053 INFO L435 NwaCegarLoop]: 248 mSDtfsCounter, 1718 mSDsluCounter, 4028 mSDsCounter, 0 mSdLazyCounter, 3886 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1718 SdHoareTripleChecker+Valid, 4276 SdHoareTripleChecker+Invalid, 3917 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 3886 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-12-02 14:39:53,053 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1718 Valid, 4276 Invalid, 3917 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 3886 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-12-02 14:39:53,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90346 states. [2024-12-02 14:39:53,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90346 to 51307. [2024-12-02 14:39:53,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51307 states, 51306 states have (on average 1.1930183604256812) internal successors, (61209), 51306 states have internal predecessors, (61209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:39:53,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51307 states to 51307 states and 61209 transitions. [2024-12-02 14:39:53,808 INFO L78 Accepts]: Start accepts. Automaton has 51307 states and 61209 transitions. Word has length 118 [2024-12-02 14:39:53,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:39:53,808 INFO L471 AbstractCegarLoop]: Abstraction has 51307 states and 61209 transitions. [2024-12-02 14:39:53,809 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 9.9375) internal successors, (318), 32 states have internal predecessors, (318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:39:53,809 INFO L276 IsEmpty]: Start isEmpty. Operand 51307 states and 61209 transitions. [2024-12-02 14:39:53,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-12-02 14:39:53,819 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:39:53,819 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 14:39:53,833 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64dfb5de-24a6-477f-bc41-806157af07bc/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-12-02 14:39:54,019 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64dfb5de-24a6-477f-bc41-806157af07bc/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 14:39:54,020 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 14:39:54,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:39:54,022 INFO L85 PathProgramCache]: Analyzing trace with hash -966506893, now seen corresponding path program 1 times [2024-12-02 14:39:54,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:39:54,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700169761] [2024-12-02 14:39:54,022 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:39:54,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:39:54,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:39:54,773 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 51 proven. 32 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-12-02 14:39:54,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:39:54,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700169761] [2024-12-02 14:39:54,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [700169761] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 14:39:54,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1468324278] [2024-12-02 14:39:54,773 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:39:54,773 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 14:39:54,773 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64dfb5de-24a6-477f-bc41-806157af07bc/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 14:39:54,775 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64dfb5de-24a6-477f-bc41-806157af07bc/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 14:39:54,776 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64dfb5de-24a6-477f-bc41-806157af07bc/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-12-02 14:39:54,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:39:54,944 INFO L256 TraceCheckSpWp]: Trace formula consists of 453 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-12-02 14:39:54,946 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 14:39:55,984 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 53 proven. 30 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-12-02 14:39:55,985 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 14:39:56,911 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 49 proven. 34 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-12-02 14:39:56,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1468324278] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 14:39:56,911 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 14:39:56,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14, 15] total 40 [2024-12-02 14:39:56,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810314750] [2024-12-02 14:39:56,911 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 14:39:56,912 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2024-12-02 14:39:56,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:39:56,913 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2024-12-02 14:39:56,913 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=1406, Unknown=0, NotChecked=0, Total=1560 [2024-12-02 14:39:56,913 INFO L87 Difference]: Start difference. First operand 51307 states and 61209 transitions. Second operand has 40 states, 40 states have (on average 8.025) internal successors, (321), 40 states have internal predecessors, (321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:40:00,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:40:00,153 INFO L93 Difference]: Finished difference Result 97151 states and 115713 transitions. [2024-12-02 14:40:00,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2024-12-02 14:40:00,153 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 8.025) internal successors, (321), 40 states have internal predecessors, (321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 119 [2024-12-02 14:40:00,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:40:00,208 INFO L225 Difference]: With dead ends: 97151 [2024-12-02 14:40:00,209 INFO L226 Difference]: Without dead ends: 59113 [2024-12-02 14:40:00,232 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 306 GetRequests, 225 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1510 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=1163, Invalid=5643, Unknown=0, NotChecked=0, Total=6806 [2024-12-02 14:40:00,233 INFO L435 NwaCegarLoop]: 243 mSDtfsCounter, 1411 mSDsluCounter, 5093 mSDsCounter, 0 mSdLazyCounter, 1486 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1411 SdHoareTripleChecker+Valid, 5336 SdHoareTripleChecker+Invalid, 1525 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 1486 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-12-02 14:40:00,233 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1411 Valid, 5336 Invalid, 1525 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 1486 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-12-02 14:40:00,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59113 states. [2024-12-02 14:40:00,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59113 to 51744. [2024-12-02 14:40:00,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51744 states, 51743 states have (on average 1.1922772162418105) internal successors, (61692), 51743 states have internal predecessors, (61692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:40:00,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51744 states to 51744 states and 61692 transitions. [2024-12-02 14:40:00,871 INFO L78 Accepts]: Start accepts. Automaton has 51744 states and 61692 transitions. Word has length 119 [2024-12-02 14:40:00,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:40:00,871 INFO L471 AbstractCegarLoop]: Abstraction has 51744 states and 61692 transitions. [2024-12-02 14:40:00,871 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 8.025) internal successors, (321), 40 states have internal predecessors, (321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:40:00,871 INFO L276 IsEmpty]: Start isEmpty. Operand 51744 states and 61692 transitions. [2024-12-02 14:40:00,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-12-02 14:40:00,878 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:40:00,878 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 14:40:00,886 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64dfb5de-24a6-477f-bc41-806157af07bc/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-12-02 14:40:01,078 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64dfb5de-24a6-477f-bc41-806157af07bc/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 14:40:01,079 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 14:40:01,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:40:01,080 INFO L85 PathProgramCache]: Analyzing trace with hash -1624672499, now seen corresponding path program 2 times [2024-12-02 14:40:01,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:40:01,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849503976] [2024-12-02 14:40:01,080 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-12-02 14:40:01,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:40:01,123 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-12-02 14:40:01,124 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-12-02 14:40:01,762 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 30 proven. 24 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-12-02 14:40:01,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:40:01,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849503976] [2024-12-02 14:40:01,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [849503976] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 14:40:01,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1781065059] [2024-12-02 14:40:01,763 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-12-02 14:40:01,763 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 14:40:01,763 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64dfb5de-24a6-477f-bc41-806157af07bc/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 14:40:01,765 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64dfb5de-24a6-477f-bc41-806157af07bc/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 14:40:01,766 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64dfb5de-24a6-477f-bc41-806157af07bc/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-12-02 14:40:01,924 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-12-02 14:40:01,924 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-12-02 14:40:01,926 INFO L256 TraceCheckSpWp]: Trace formula consists of 455 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-12-02 14:40:01,929 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 14:40:02,587 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 53 proven. 2 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2024-12-02 14:40:02,588 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 14:40:03,410 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 53 proven. 2 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2024-12-02 14:40:03,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1781065059] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 14:40:03,410 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 14:40:03,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 32 [2024-12-02 14:40:03,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215369436] [2024-12-02 14:40:03,410 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 14:40:03,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-12-02 14:40:03,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:40:03,412 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-12-02 14:40:03,412 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=870, Unknown=0, NotChecked=0, Total=992 [2024-12-02 14:40:03,412 INFO L87 Difference]: Start difference. First operand 51744 states and 61692 transitions. Second operand has 32 states, 32 states have (on average 7.15625) internal successors, (229), 32 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:40:05,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:40:05,529 INFO L93 Difference]: Finished difference Result 90846 states and 108630 transitions. [2024-12-02 14:40:05,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-12-02 14:40:05,530 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 7.15625) internal successors, (229), 32 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 120 [2024-12-02 14:40:05,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:40:05,602 INFO L225 Difference]: With dead ends: 90846 [2024-12-02 14:40:05,602 INFO L226 Difference]: Without dead ends: 73646 [2024-12-02 14:40:05,625 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 222 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 445 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=595, Invalid=2161, Unknown=0, NotChecked=0, Total=2756 [2024-12-02 14:40:05,626 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 1243 mSDsluCounter, 1568 mSDsCounter, 0 mSdLazyCounter, 508 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1243 SdHoareTripleChecker+Valid, 1706 SdHoareTripleChecker+Invalid, 517 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 508 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-12-02 14:40:05,626 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1243 Valid, 1706 Invalid, 517 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 508 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-12-02 14:40:05,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73646 states. [2024-12-02 14:40:06,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73646 to 47143. [2024-12-02 14:40:06,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47143 states, 47142 states have (on average 1.1923974375291673) internal successors, (56212), 47142 states have internal predecessors, (56212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:40:06,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47143 states to 47143 states and 56212 transitions. [2024-12-02 14:40:06,231 INFO L78 Accepts]: Start accepts. Automaton has 47143 states and 56212 transitions. Word has length 120 [2024-12-02 14:40:06,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:40:06,232 INFO L471 AbstractCegarLoop]: Abstraction has 47143 states and 56212 transitions. [2024-12-02 14:40:06,232 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 7.15625) internal successors, (229), 32 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:40:06,232 INFO L276 IsEmpty]: Start isEmpty. Operand 47143 states and 56212 transitions. [2024-12-02 14:40:06,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-12-02 14:40:06,237 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:40:06,238 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 14:40:06,245 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64dfb5de-24a6-477f-bc41-806157af07bc/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-12-02 14:40:06,438 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64dfb5de-24a6-477f-bc41-806157af07bc/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 14:40:06,438 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 14:40:06,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:40:06,439 INFO L85 PathProgramCache]: Analyzing trace with hash 776729967, now seen corresponding path program 1 times [2024-12-02 14:40:06,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:40:06,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117908975] [2024-12-02 14:40:06,439 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:40:06,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:40:06,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:40:07,025 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 31 proven. 59 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:40:07,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:40:07,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117908975] [2024-12-02 14:40:07,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1117908975] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 14:40:07,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1188569866] [2024-12-02 14:40:07,025 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:40:07,025 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 14:40:07,025 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64dfb5de-24a6-477f-bc41-806157af07bc/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 14:40:07,027 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64dfb5de-24a6-477f-bc41-806157af07bc/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 14:40:07,028 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64dfb5de-24a6-477f-bc41-806157af07bc/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-12-02 14:40:07,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:40:07,178 INFO L256 TraceCheckSpWp]: Trace formula consists of 455 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-12-02 14:40:07,180 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 14:40:08,502 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 31 proven. 59 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:40:08,502 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 14:40:10,530 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 31 proven. 59 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:40:10,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1188569866] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 14:40:10,530 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 14:40:10,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 17] total 46 [2024-12-02 14:40:10,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534063268] [2024-12-02 14:40:10,530 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 14:40:10,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2024-12-02 14:40:10,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:40:10,531 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2024-12-02 14:40:10,532 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=204, Invalid=1866, Unknown=0, NotChecked=0, Total=2070 [2024-12-02 14:40:10,532 INFO L87 Difference]: Start difference. First operand 47143 states and 56212 transitions. Second operand has 46 states, 46 states have (on average 6.804347826086956) internal successors, (313), 46 states have internal predecessors, (313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:40:21,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:40:21,845 INFO L93 Difference]: Finished difference Result 106281 states and 126159 transitions. [2024-12-02 14:40:21,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 159 states. [2024-12-02 14:40:21,846 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 6.804347826086956) internal successors, (313), 46 states have internal predecessors, (313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 122 [2024-12-02 14:40:21,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:40:21,911 INFO L225 Difference]: With dead ends: 106281 [2024-12-02 14:40:21,911 INFO L226 Difference]: Without dead ends: 88654 [2024-12-02 14:40:21,931 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 412 GetRequests, 215 SyntacticMatches, 1 SemanticMatches, 196 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14300 ImplicationChecksByTransitivity, 10.0s TimeCoverageRelationStatistics Valid=4188, Invalid=34818, Unknown=0, NotChecked=0, Total=39006 [2024-12-02 14:40:21,931 INFO L435 NwaCegarLoop]: 499 mSDtfsCounter, 2061 mSDsluCounter, 8928 mSDsCounter, 0 mSdLazyCounter, 3693 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2061 SdHoareTripleChecker+Valid, 9427 SdHoareTripleChecker+Invalid, 3741 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 3693 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-12-02 14:40:21,931 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2061 Valid, 9427 Invalid, 3741 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 3693 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-12-02 14:40:21,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88654 states. [2024-12-02 14:40:22,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88654 to 72164. [2024-12-02 14:40:22,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72164 states, 72163 states have (on average 1.1946011113728643) internal successors, (86206), 72163 states have internal predecessors, (86206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:40:22,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72164 states to 72164 states and 86206 transitions. [2024-12-02 14:40:22,585 INFO L78 Accepts]: Start accepts. Automaton has 72164 states and 86206 transitions. Word has length 122 [2024-12-02 14:40:22,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:40:22,586 INFO L471 AbstractCegarLoop]: Abstraction has 72164 states and 86206 transitions. [2024-12-02 14:40:22,586 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 6.804347826086956) internal successors, (313), 46 states have internal predecessors, (313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:40:22,586 INFO L276 IsEmpty]: Start isEmpty. Operand 72164 states and 86206 transitions. [2024-12-02 14:40:22,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-12-02 14:40:22,591 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:40:22,591 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 14:40:22,599 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64dfb5de-24a6-477f-bc41-806157af07bc/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-12-02 14:40:22,791 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64dfb5de-24a6-477f-bc41-806157af07bc/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 14:40:22,791 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 14:40:22,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:40:22,792 INFO L85 PathProgramCache]: Analyzing trace with hash -1474095239, now seen corresponding path program 1 times [2024-12-02 14:40:22,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:40:22,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172926654] [2024-12-02 14:40:22,792 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:40:22,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:40:22,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:40:23,639 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 64 proven. 6 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-12-02 14:40:23,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:40:23,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172926654] [2024-12-02 14:40:23,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [172926654] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 14:40:23,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [861293469] [2024-12-02 14:40:23,640 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:40:23,640 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 14:40:23,640 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64dfb5de-24a6-477f-bc41-806157af07bc/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 14:40:23,642 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64dfb5de-24a6-477f-bc41-806157af07bc/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 14:40:23,642 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64dfb5de-24a6-477f-bc41-806157af07bc/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-12-02 14:40:23,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:40:23,780 INFO L256 TraceCheckSpWp]: Trace formula consists of 455 conjuncts, 55 conjuncts are in the unsatisfiable core [2024-12-02 14:40:23,782 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 14:40:27,682 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 23 proven. 67 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:40:27,682 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 14:40:32,984 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 13 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:40:32,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [861293469] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 14:40:32,984 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 14:40:32,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 28, 26] total 70 [2024-12-02 14:40:32,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885016423] [2024-12-02 14:40:32,984 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 14:40:32,985 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 70 states [2024-12-02 14:40:32,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:40:32,986 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2024-12-02 14:40:32,986 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=366, Invalid=4464, Unknown=0, NotChecked=0, Total=4830 [2024-12-02 14:40:32,987 INFO L87 Difference]: Start difference. First operand 72164 states and 86206 transitions. Second operand has 70 states, 70 states have (on average 4.714285714285714) internal successors, (330), 70 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:41:45,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:41:45,617 INFO L93 Difference]: Finished difference Result 172648 states and 206743 transitions. [2024-12-02 14:41:45,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 274 states. [2024-12-02 14:41:45,617 INFO L78 Accepts]: Start accepts. Automaton has has 70 states, 70 states have (on average 4.714285714285714) internal successors, (330), 70 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 122 [2024-12-02 14:41:45,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:41:45,731 INFO L225 Difference]: With dead ends: 172648 [2024-12-02 14:41:45,731 INFO L226 Difference]: Without dead ends: 146638 [2024-12-02 14:41:45,755 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 534 GetRequests, 196 SyntacticMatches, 0 SemanticMatches, 338 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41784 ImplicationChecksByTransitivity, 66.6s TimeCoverageRelationStatistics Valid=13729, Invalid=101531, Unknown=0, NotChecked=0, Total=115260 [2024-12-02 14:41:45,756 INFO L435 NwaCegarLoop]: 368 mSDtfsCounter, 9507 mSDsluCounter, 14371 mSDsCounter, 0 mSdLazyCounter, 8865 mSolverCounterSat, 184 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9507 SdHoareTripleChecker+Valid, 14739 SdHoareTripleChecker+Invalid, 9049 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 184 IncrementalHoareTripleChecker+Valid, 8865 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.6s IncrementalHoareTripleChecker+Time [2024-12-02 14:41:45,756 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9507 Valid, 14739 Invalid, 9049 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [184 Valid, 8865 Invalid, 0 Unknown, 0 Unchecked, 8.6s Time] [2024-12-02 14:41:45,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146638 states. [2024-12-02 14:41:47,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146638 to 101039. [2024-12-02 14:41:47,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101039 states, 101038 states have (on average 1.1976286149765434) internal successors, (121006), 101038 states have internal predecessors, (121006), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:41:47,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101039 states to 101039 states and 121006 transitions. [2024-12-02 14:41:47,435 INFO L78 Accepts]: Start accepts. Automaton has 101039 states and 121006 transitions. Word has length 122 [2024-12-02 14:41:47,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:41:47,435 INFO L471 AbstractCegarLoop]: Abstraction has 101039 states and 121006 transitions. [2024-12-02 14:41:47,435 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 70 states, 70 states have (on average 4.714285714285714) internal successors, (330), 70 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:41:47,435 INFO L276 IsEmpty]: Start isEmpty. Operand 101039 states and 121006 transitions. [2024-12-02 14:41:47,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-12-02 14:41:47,454 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:41:47,454 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 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] [2024-12-02 14:41:47,464 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64dfb5de-24a6-477f-bc41-806157af07bc/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2024-12-02 14:41:47,655 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64dfb5de-24a6-477f-bc41-806157af07bc/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2024-12-02 14:41:47,655 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 14:41:47,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:41:47,656 INFO L85 PathProgramCache]: Analyzing trace with hash 1495340301, now seen corresponding path program 1 times [2024-12-02 14:41:47,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:41:47,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379323862] [2024-12-02 14:41:47,656 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:41:47,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:41:47,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:41:49,071 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 13 proven. 80 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:41:49,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:41:49,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379323862] [2024-12-02 14:41:49,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1379323862] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 14:41:49,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [587133707] [2024-12-02 14:41:49,072 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:41:49,072 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 14:41:49,072 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64dfb5de-24a6-477f-bc41-806157af07bc/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 14:41:49,074 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64dfb5de-24a6-477f-bc41-806157af07bc/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 14:41:49,076 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64dfb5de-24a6-477f-bc41-806157af07bc/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-12-02 14:41:49,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:41:49,273 INFO L256 TraceCheckSpWp]: Trace formula consists of 457 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-12-02 14:41:49,279 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 14:41:53,321 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 13 proven. 80 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:41:53,322 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 14:41:55,448 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 13 proven. 80 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:41:55,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [587133707] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 14:41:55,448 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 14:41:55,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 48 [2024-12-02 14:41:55,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300001091] [2024-12-02 14:41:55,448 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 14:41:55,449 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2024-12-02 14:41:55,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:41:55,450 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2024-12-02 14:41:55,450 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=2061, Unknown=0, NotChecked=0, Total=2256 [2024-12-02 14:41:55,450 INFO L87 Difference]: Start difference. First operand 101039 states and 121006 transitions. Second operand has 48 states, 48 states have (on average 7.166666666666667) internal successors, (344), 48 states have internal predecessors, (344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:42:00,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:42:00,502 INFO L93 Difference]: Finished difference Result 176438 states and 210554 transitions. [2024-12-02 14:42:00,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2024-12-02 14:42:00,503 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 48 states have (on average 7.166666666666667) internal successors, (344), 48 states have internal predecessors, (344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 125 [2024-12-02 14:42:00,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:42:00,594 INFO L225 Difference]: With dead ends: 176438 [2024-12-02 14:42:00,594 INFO L226 Difference]: Without dead ends: 122670 [2024-12-02 14:42:00,624 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 321 GetRequests, 219 SyntacticMatches, 1 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2714 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=1313, Invalid=9193, Unknown=0, NotChecked=0, Total=10506 [2024-12-02 14:42:00,624 INFO L435 NwaCegarLoop]: 471 mSDtfsCounter, 1192 mSDsluCounter, 8107 mSDsCounter, 0 mSdLazyCounter, 3216 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1192 SdHoareTripleChecker+Valid, 8578 SdHoareTripleChecker+Invalid, 3244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 3216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-12-02 14:42:00,625 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1192 Valid, 8578 Invalid, 3244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 3216 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-12-02 14:42:00,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122670 states. [2024-12-02 14:42:01,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122670 to 87999. [2024-12-02 14:42:01,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87999 states, 87998 states have (on average 1.1906293324848292) internal successors, (104773), 87998 states have internal predecessors, (104773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:42:01,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87999 states to 87999 states and 104773 transitions. [2024-12-02 14:42:01,573 INFO L78 Accepts]: Start accepts. Automaton has 87999 states and 104773 transitions. Word has length 125 [2024-12-02 14:42:01,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:42:01,573 INFO L471 AbstractCegarLoop]: Abstraction has 87999 states and 104773 transitions. [2024-12-02 14:42:01,573 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 48 states have (on average 7.166666666666667) internal successors, (344), 48 states have internal predecessors, (344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:42:01,573 INFO L276 IsEmpty]: Start isEmpty. Operand 87999 states and 104773 transitions. [2024-12-02 14:42:01,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-12-02 14:42:01,590 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:42:01,591 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 14:42:01,596 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64dfb5de-24a6-477f-bc41-806157af07bc/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2024-12-02 14:42:01,791 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64dfb5de-24a6-477f-bc41-806157af07bc/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 14:42:01,791 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 14:42:01,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:42:01,792 INFO L85 PathProgramCache]: Analyzing trace with hash -1599531191, now seen corresponding path program 2 times [2024-12-02 14:42:01,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:42:01,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222265156] [2024-12-02 14:42:01,792 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-12-02 14:42:01,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:42:01,855 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-12-02 14:42:01,855 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-12-02 14:42:01,972 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 114 proven. 0 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2024-12-02 14:42:01,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:42:01,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222265156] [2024-12-02 14:42:01,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [222265156] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 14:42:01,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 14:42:01,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-02 14:42:01,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380634976] [2024-12-02 14:42:01,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 14:42:01,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 14:42:01,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:42:01,973 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 14:42:01,973 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 14:42:01,974 INFO L87 Difference]: Start difference. First operand 87999 states and 104773 transitions. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:42:02,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:42:02,336 INFO L93 Difference]: Finished difference Result 127675 states and 151569 transitions. [2024-12-02 14:42:02,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 14:42:02,337 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 143 [2024-12-02 14:42:02,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:42:02,392 INFO L225 Difference]: With dead ends: 127675 [2024-12-02 14:42:02,392 INFO L226 Difference]: Without dead ends: 41843 [2024-12-02 14:42:02,428 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 14:42:02,429 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 44 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 14:42:02,429 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 196 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 14:42:02,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41843 states. [2024-12-02 14:42:02,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41843 to 41633. [2024-12-02 14:42:02,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41633 states, 41632 states have (on average 1.158075518831668) internal successors, (48213), 41632 states have internal predecessors, (48213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:42:02,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41633 states to 41633 states and 48213 transitions. [2024-12-02 14:42:02,891 INFO L78 Accepts]: Start accepts. Automaton has 41633 states and 48213 transitions. Word has length 143 [2024-12-02 14:42:02,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:42:02,891 INFO L471 AbstractCegarLoop]: Abstraction has 41633 states and 48213 transitions. [2024-12-02 14:42:02,891 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:42:02,891 INFO L276 IsEmpty]: Start isEmpty. Operand 41633 states and 48213 transitions. [2024-12-02 14:42:02,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-12-02 14:42:02,903 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:42:02,903 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 14:42:02,903 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-12-02 14:42:02,903 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 14:42:02,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:42:02,904 INFO L85 PathProgramCache]: Analyzing trace with hash -1486818883, now seen corresponding path program 1 times [2024-12-02 14:42:02,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:42:02,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273127087] [2024-12-02 14:42:02,904 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:42:02,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:42:02,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:42:03,542 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 132 proven. 32 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2024-12-02 14:42:03,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:42:03,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273127087] [2024-12-02 14:42:03,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [273127087] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 14:42:03,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [710350122] [2024-12-02 14:42:03,543 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:42:03,543 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 14:42:03,543 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64dfb5de-24a6-477f-bc41-806157af07bc/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 14:42:03,546 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64dfb5de-24a6-477f-bc41-806157af07bc/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 14:42:03,548 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64dfb5de-24a6-477f-bc41-806157af07bc/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-12-02 14:42:03,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:42:03,751 INFO L256 TraceCheckSpWp]: Trace formula consists of 545 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-12-02 14:42:03,755 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 14:42:04,787 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 151 proven. 13 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2024-12-02 14:42:04,787 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 14:42:06,343 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 131 proven. 86 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-12-02 14:42:06,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [710350122] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 14:42:06,344 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 14:42:06,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 17, 21] total 42 [2024-12-02 14:42:06,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607526670] [2024-12-02 14:42:06,344 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 14:42:06,345 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2024-12-02 14:42:06,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:42:06,345 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2024-12-02 14:42:06,345 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=348, Invalid=1374, Unknown=0, NotChecked=0, Total=1722 [2024-12-02 14:42:06,345 INFO L87 Difference]: Start difference. First operand 41633 states and 48213 transitions. Second operand has 42 states, 42 states have (on average 6.261904761904762) internal successors, (263), 42 states have internal predecessors, (263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:42:08,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:42:08,022 INFO L93 Difference]: Finished difference Result 52423 states and 60634 transitions. [2024-12-02 14:42:08,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2024-12-02 14:42:08,022 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 6.261904761904762) internal successors, (263), 42 states have internal predecessors, (263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 145 [2024-12-02 14:42:08,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:42:08,050 INFO L225 Difference]: With dead ends: 52423 [2024-12-02 14:42:08,050 INFO L226 Difference]: Without dead ends: 46712 [2024-12-02 14:42:08,059 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 335 GetRequests, 260 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1241 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1562, Invalid=4290, Unknown=0, NotChecked=0, Total=5852 [2024-12-02 14:42:08,059 INFO L435 NwaCegarLoop]: 197 mSDtfsCounter, 1842 mSDsluCounter, 2680 mSDsCounter, 0 mSdLazyCounter, 1353 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1842 SdHoareTripleChecker+Valid, 2877 SdHoareTripleChecker+Invalid, 1379 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 1353 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-12-02 14:42:08,059 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1842 Valid, 2877 Invalid, 1379 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 1353 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-12-02 14:42:08,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46712 states. [2024-12-02 14:42:08,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46712 to 42897. [2024-12-02 14:42:08,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42897 states, 42896 states have (on average 1.1564248414770608) internal successors, (49606), 42896 states have internal predecessors, (49606), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:42:08,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42897 states to 42897 states and 49606 transitions. [2024-12-02 14:42:08,468 INFO L78 Accepts]: Start accepts. Automaton has 42897 states and 49606 transitions. Word has length 145 [2024-12-02 14:42:08,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:42:08,468 INFO L471 AbstractCegarLoop]: Abstraction has 42897 states and 49606 transitions. [2024-12-02 14:42:08,468 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 6.261904761904762) internal successors, (263), 42 states have internal predecessors, (263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:42:08,468 INFO L276 IsEmpty]: Start isEmpty. Operand 42897 states and 49606 transitions. [2024-12-02 14:42:08,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-12-02 14:42:08,472 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:42:08,472 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 14:42:08,481 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64dfb5de-24a6-477f-bc41-806157af07bc/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2024-12-02 14:42:08,672 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36,15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64dfb5de-24a6-477f-bc41-806157af07bc/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 14:42:08,673 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 14:42:08,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:42:08,674 INFO L85 PathProgramCache]: Analyzing trace with hash 1823064679, now seen corresponding path program 1 times [2024-12-02 14:42:08,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:42:08,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991669877] [2024-12-02 14:42:08,674 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:42:08,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:42:08,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-02 14:42:08,715 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-12-02 14:42:08,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-02 14:42:08,819 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-12-02 14:42:08,819 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-12-02 14:42:08,821 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-12-02 14:42:08,824 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-12-02 14:42:08,830 INFO L422 BasicCegarLoop]: Path program histogram: [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] [2024-12-02 14:42:08,989 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-12-02 14:42:08,993 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 02:42:08 BoogieIcfgContainer [2024-12-02 14:42:08,993 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-12-02 14:42:08,994 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-12-02 14:42:08,994 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-12-02 14:42:08,995 INFO L274 PluginConnector]: Witness Printer initialized [2024-12-02 14:42:08,996 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 02:37:39" (3/4) ... [2024-12-02 14:42:08,997 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2024-12-02 14:42:09,164 INFO L129 tionWitnessGenerator]: Generated YAML witness of length 89. [2024-12-02 14:42:09,254 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64dfb5de-24a6-477f-bc41-806157af07bc/bin/uautomizer-verify-84ZbGMXZE1/witness.graphml [2024-12-02 14:42:09,254 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64dfb5de-24a6-477f-bc41-806157af07bc/bin/uautomizer-verify-84ZbGMXZE1/witness.yml [2024-12-02 14:42:09,255 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-12-02 14:42:09,255 INFO L158 Benchmark]: Toolchain (without parser) took 271046.67ms. Allocated memory was 117.4MB in the beginning and 2.0GB in the end (delta: 1.9GB). Free memory was 92.6MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 805.7MB. Max. memory is 16.1GB. [2024-12-02 14:42:09,256 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 117.4MB. Free memory was 72.9MB in the beginning and 72.8MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-12-02 14:42:09,256 INFO L158 Benchmark]: CACSL2BoogieTranslator took 318.31ms. Allocated memory is still 117.4MB. Free memory was 92.6MB in the beginning and 77.7MB in the end (delta: 14.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-12-02 14:42:09,256 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.25ms. Allocated memory is still 117.4MB. Free memory was 77.7MB in the beginning and 75.5MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-12-02 14:42:09,256 INFO L158 Benchmark]: Boogie Preprocessor took 46.14ms. Allocated memory is still 117.4MB. Free memory was 75.5MB in the beginning and 73.2MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. [2024-12-02 14:42:09,257 INFO L158 Benchmark]: RCFGBuilder took 493.33ms. Allocated memory is still 117.4MB. Free memory was 73.2MB in the beginning and 48.6MB in the end (delta: 24.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-12-02 14:42:09,257 INFO L158 Benchmark]: TraceAbstraction took 269881.08ms. Allocated memory was 117.4MB in the beginning and 2.0GB in the end (delta: 1.9GB). Free memory was 48.0MB in the beginning and 1.2GB in the end (delta: -1.2GB). Peak memory consumption was 730.2MB. Max. memory is 16.1GB. [2024-12-02 14:42:09,257 INFO L158 Benchmark]: Witness Printer took 260.33ms. Allocated memory is still 2.0GB. Free memory was 1.2GB in the beginning and 1.2GB in the end (delta: 33.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2024-12-02 14:42:09,259 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.31ms. Allocated memory is still 117.4MB. Free memory was 72.9MB in the beginning and 72.8MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 318.31ms. Allocated memory is still 117.4MB. Free memory was 92.6MB in the beginning and 77.7MB in the end (delta: 14.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 40.25ms. Allocated memory is still 117.4MB. Free memory was 77.7MB in the beginning and 75.5MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 46.14ms. Allocated memory is still 117.4MB. Free memory was 75.5MB in the beginning and 73.2MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 493.33ms. Allocated memory is still 117.4MB. Free memory was 73.2MB in the beginning and 48.6MB in the end (delta: 24.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 269881.08ms. Allocated memory was 117.4MB in the beginning and 2.0GB in the end (delta: 1.9GB). Free memory was 48.0MB in the beginning and 1.2GB in the end (delta: -1.2GB). Peak memory consumption was 730.2MB. Max. memory is 16.1GB. * Witness Printer took 260.33ms. Allocated memory is still 2.0GB. Free memory was 1.2GB in the beginning and 1.2GB in the end (delta: 33.6MB). Peak memory consumption was 33.6MB. 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: 214]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L10] int __return_main; [L26] msg_t nomsg = (msg_t )-1; [L27] unsigned char r1 = '\x0'; [L28] port_t p1 = 0; [L29] char p1_old = '\x0'; [L30] char p1_new = '\x0'; [L31] char id1 = '\x0'; [L32] char st1 = '\x0'; [L33] msg_t send1 = '\x0'; [L34] _Bool mode1 = 0; [L35] _Bool alive1 = 0; [L36] port_t p2 = 0; [L37] char p2_old = '\x0'; [L38] char p2_new = '\x0'; [L39] char id2 = '\x0'; [L40] char st2 = '\x0'; [L41] msg_t send2 = '\x0'; [L42] _Bool mode2 = 0; [L43] _Bool alive2 = 0; [L44] port_t p3 = 0; [L45] char p3_old = '\x0'; [L46] char p3_new = '\x0'; [L47] char id3 = '\x0'; [L48] char st3 = '\x0'; [L49] msg_t send3 = '\x0'; [L50] _Bool mode3 = 0; [L51] _Bool alive3 = 0; [L55] void (*nodes[3])() = { &node1, &node2, &node3 }; [L59] int __return_5979; [L60] int __return_6075; VAL [__return_5979=0, __return_6075=0, __return_main=0, alive1=0, alive2=0, alive3=0, id1=0, id2=0, id3=0, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=0, send2=0, send3=0, st1=0, st2=0, st3=0] [L63] int main__c1; [L64] int main__i2; [L65] main__c1 = 0 [L66] r1 = __VERIFIER_nondet_uchar() [L67] id1 = __VERIFIER_nondet_char() [L68] st1 = __VERIFIER_nondet_char() [L69] send1 = __VERIFIER_nondet_char() [L70] mode1 = __VERIFIER_nondet_bool() [L71] alive1 = __VERIFIER_nondet_bool() [L72] id2 = __VERIFIER_nondet_char() [L73] st2 = __VERIFIER_nondet_char() [L74] send2 = __VERIFIER_nondet_char() [L75] mode2 = __VERIFIER_nondet_bool() [L76] alive2 = __VERIFIER_nondet_bool() [L77] id3 = __VERIFIER_nondet_char() [L78] st3 = __VERIFIER_nondet_char() [L79] send3 = __VERIFIER_nondet_char() [L80] mode3 = __VERIFIER_nondet_bool() [L81] alive3 = __VERIFIER_nondet_bool() [L83] int init__tmp; VAL [__return_5979=0, __return_6075=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L84] COND TRUE ((int)r1) == 0 VAL [__return_5979=0, __return_6075=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L86] COND TRUE ((((int)alive1) + ((int)alive2)) + ((int)alive3)) >= 1 VAL [__return_5979=0, __return_6075=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L88] COND TRUE ((int)id1) >= 0 VAL [__return_5979=0, __return_6075=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L90] COND TRUE ((int)st1) == 0 VAL [__return_5979=0, __return_6075=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L92] COND TRUE ((int)send1) == ((int)id1) VAL [__return_5979=0, __return_6075=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L94] COND TRUE ((int)mode1) == 0 VAL [__return_5979=0, __return_6075=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L96] COND TRUE ((int)id2) >= 0 VAL [__return_5979=0, __return_6075=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L98] COND TRUE ((int)st2) == 0 VAL [__return_5979=0, __return_6075=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L100] COND TRUE ((int)send2) == ((int)id2) VAL [__return_5979=0, __return_6075=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L102] COND TRUE ((int)mode2) == 0 VAL [__return_5979=0, __return_6075=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L104] COND TRUE ((int)id3) >= 0 VAL [__return_5979=0, __return_6075=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L106] COND TRUE ((int)st3) == 0 VAL [__return_5979=0, __return_6075=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L108] COND TRUE ((int)send3) == ((int)id3) VAL [__return_5979=0, __return_6075=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L110] COND TRUE ((int)mode3) == 0 VAL [__return_5979=0, __return_6075=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L112] COND TRUE ((int)id1) != ((int)id2) VAL [__return_5979=0, __return_6075=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L114] COND TRUE ((int)id1) != ((int)id3) VAL [__return_5979=0, __return_6075=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L116] COND TRUE ((int)id2) != ((int)id3) [L118] init__tmp = 1 [L119] __return_5979 = init__tmp [L120] main__i2 = __return_5979 VAL [__return_5979=1, __return_6075=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, main__i2=1, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L121] COND TRUE main__i2 != 0 [L123] p1_old = nomsg [L124] p1_new = nomsg [L125] p2_old = nomsg [L126] p2_new = nomsg [L127] p3_old = nomsg [L128] p3_new = nomsg [L129] main__i2 = 0 VAL [__return_5979=1, __return_6075=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L132] msg_t node1__m1; [L133] node1__m1 = nomsg VAL [__return_5979=1, __return_6075=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L134] COND FALSE !(!(mode1 == 0)) VAL [__return_5979=1, __return_6075=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L447] COND FALSE !(!(alive1 == 0)) VAL [__return_5979=1, __return_6075=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L458] mode1 = 1 VAL [__return_5979=1, __return_6075=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L155] msg_t node2__m2; [L156] node2__m2 = nomsg VAL [__return_5979=1, __return_6075=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L157] COND FALSE !(!(mode2 == 0)) VAL [__return_5979=1, __return_6075=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L356] COND FALSE !(!(alive2 == 0)) VAL [__return_5979=1, __return_6075=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L384] COND FALSE !(((int)send2) != ((int)id2)) VAL [__return_5979=1, __return_6075=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L367] mode2 = 1 VAL [__return_5979=1, __return_6075=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L173] msg_t node3__m3; [L174] node3__m3 = nomsg VAL [__return_5979=1, __return_6075=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L175] COND FALSE !(!(mode3 == 0)) VAL [__return_5979=1, __return_6075=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L270] COND TRUE !(alive3 == 0) [L272] int node3____CPAchecker_TMP_0; VAL [__return_5979=1, __return_6075=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L273] COND TRUE send3 != nomsg VAL [__return_5979=1, __return_6075=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L275] COND TRUE p3_new == nomsg [L277] node3____CPAchecker_TMP_0 = send3 VAL [__return_5979=1, __return_6075=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=0, node3____CPAchecker_TMP_0=127, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L279] p3_new = node3____CPAchecker_TMP_0 VAL [__return_5979=1, __return_6075=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=127, p3_old=-1, r1=0, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L281] mode3 = 1 VAL [__return_5979=1, __return_6075=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=127, p3_old=-1, r1=0, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L190] p1_old = p1_new [L191] p1_new = nomsg [L192] p2_old = p2_new [L193] p2_new = nomsg [L194] p3_old = p3_new [L195] p3_new = nomsg [L197] int check__tmp; VAL [__return_5979=1, __return_6075=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=127, r1=0, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L198] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) <= 1 VAL [__return_5979=1, __return_6075=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=127, r1=0, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L200] COND TRUE ((int)r1) < 3 [L202] check__tmp = 1 VAL [__return_5979=1, __return_6075=0, __return_main=0, alive1=0, alive2=0, alive3=1, check__tmp=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=127, r1=0, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L205] __return_6075 = check__tmp [L206] main__c1 = __return_6075 [L208] _Bool __tmp_1; [L209] __tmp_1 = main__c1 [L210] _Bool assert__arg; [L211] assert__arg = __tmp_1 VAL [__return_5979=1, __return_6075=1, __return_main=0, alive1=0, alive2=0, alive3=1, assert__arg=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=127, r1=0, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L212] COND FALSE !(assert__arg == 0) VAL [__return_5979=1, __return_6075=1, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=127, r1=0, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L132] msg_t node1__m1; [L133] node1__m1 = nomsg VAL [__return_5979=1, __return_6075=1, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=127, r1=0, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L134] COND TRUE !(mode1 == 0) VAL [__return_5979=1, __return_6075=1, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=127, r1=0, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L136] COND FALSE !(r1 == 255) VAL [__return_5979=1, __return_6075=1, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=127, r1=0, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L140] r1 = r1 + 1 [L141] node1__m1 = p3_old [L142] p3_old = nomsg VAL [__return_5979=1, __return_6075=1, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=1, node1__m1=127, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L143] COND TRUE ((int)node1__m1) != ((int)nomsg) VAL [__return_5979=1, __return_6075=1, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=1, node1__m1=127, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L145] COND FALSE !(!(alive1 == 0)) [L431] send1 = node1__m1 VAL [__return_5979=1, __return_6075=1, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L152] mode1 = 0 VAL [__return_5979=1, __return_6075=1, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L155] msg_t node2__m2; [L156] node2__m2 = nomsg VAL [__return_5979=1, __return_6075=1, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L157] COND TRUE !(mode2 == 0) [L159] node2__m2 = p1_old [L160] p1_old = nomsg VAL [__return_5979=1, __return_6075=1, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=1, mode3=1, node2__m2=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L161] COND FALSE !(((int)node2__m2) != ((int)nomsg)) VAL [__return_5979=1, __return_6075=1, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L170] mode2 = 0 VAL [__return_5979=1, __return_6075=1, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L173] msg_t node3__m3; [L174] node3__m3 = nomsg VAL [__return_5979=1, __return_6075=1, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L175] COND TRUE !(mode3 == 0) [L177] node3__m3 = p2_old [L178] p2_old = nomsg VAL [__return_5979=1, __return_6075=1, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L179] COND FALSE !(((int)node3__m3) != ((int)nomsg)) VAL [__return_5979=1, __return_6075=1, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L188] mode3 = 0 VAL [__return_5979=1, __return_6075=1, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L190] p1_old = p1_new [L191] p1_new = nomsg [L192] p2_old = p2_new [L193] p2_new = nomsg [L194] p3_old = p3_new [L195] p3_new = nomsg [L197] int check__tmp; VAL [__return_5979=1, __return_6075=1, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L198] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) <= 1 VAL [__return_5979=1, __return_6075=1, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L200] COND TRUE ((int)r1) < 3 [L202] check__tmp = 1 VAL [__return_5979=1, __return_6075=1, __return_main=0, alive1=0, alive2=0, alive3=1, check__tmp=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L205] __return_6075 = check__tmp [L206] main__c1 = __return_6075 [L208] _Bool __tmp_1; [L209] __tmp_1 = main__c1 [L210] _Bool assert__arg; [L211] assert__arg = __tmp_1 VAL [__return_5979=1, __return_6075=1, __return_main=0, alive1=0, alive2=0, alive3=1, assert__arg=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L212] COND FALSE !(assert__arg == 0) VAL [__return_5979=1, __return_6075=1, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L132] msg_t node1__m1; [L133] node1__m1 = nomsg VAL [__return_5979=1, __return_6075=1, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L134] COND FALSE !(!(mode1 == 0)) VAL [__return_5979=1, __return_6075=1, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L447] COND FALSE !(!(alive1 == 0)) VAL [__return_5979=1, __return_6075=1, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L458] mode1 = 1 VAL [__return_5979=1, __return_6075=1, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L155] msg_t node2__m2; [L156] node2__m2 = nomsg VAL [__return_5979=1, __return_6075=1, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L157] COND FALSE !(!(mode2 == 0)) VAL [__return_5979=1, __return_6075=1, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L356] COND FALSE !(!(alive2 == 0)) VAL [__return_5979=1, __return_6075=1, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L384] COND FALSE !(((int)send2) != ((int)id2)) VAL [__return_5979=1, __return_6075=1, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L367] mode2 = 1 VAL [__return_5979=1, __return_6075=1, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L173] msg_t node3__m3; [L174] node3__m3 = nomsg VAL [__return_5979=1, __return_6075=1, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L175] COND FALSE !(!(mode3 == 0)) VAL [__return_5979=1, __return_6075=1, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L270] COND TRUE !(alive3 == 0) [L272] int node3____CPAchecker_TMP_0; VAL [__return_5979=1, __return_6075=1, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L273] COND TRUE send3 != nomsg VAL [__return_5979=1, __return_6075=1, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L275] COND TRUE p3_new == nomsg [L277] node3____CPAchecker_TMP_0 = send3 VAL [__return_5979=1, __return_6075=1, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=0, node3____CPAchecker_TMP_0=127, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L279] p3_new = node3____CPAchecker_TMP_0 VAL [__return_5979=1, __return_6075=1, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=127, p3_old=-1, r1=1, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L281] mode3 = 1 VAL [__return_5979=1, __return_6075=1, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=127, p3_old=-1, r1=1, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L190] p1_old = p1_new [L191] p1_new = nomsg [L192] p2_old = p2_new [L193] p2_new = nomsg [L194] p3_old = p3_new [L195] p3_new = nomsg [L197] int check__tmp; VAL [__return_5979=1, __return_6075=1, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=127, r1=1, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L198] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) <= 1 VAL [__return_5979=1, __return_6075=1, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=127, r1=1, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L200] COND TRUE ((int)r1) < 3 [L202] check__tmp = 1 VAL [__return_5979=1, __return_6075=1, __return_main=0, alive1=0, alive2=0, alive3=1, check__tmp=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=127, r1=1, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L205] __return_6075 = check__tmp [L206] main__c1 = __return_6075 [L208] _Bool __tmp_1; [L209] __tmp_1 = main__c1 [L210] _Bool assert__arg; [L211] assert__arg = __tmp_1 VAL [__return_5979=1, __return_6075=1, __return_main=0, alive1=0, alive2=0, alive3=1, assert__arg=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=127, r1=1, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L212] COND FALSE !(assert__arg == 0) VAL [__return_5979=1, __return_6075=1, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=127, r1=1, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L132] msg_t node1__m1; [L133] node1__m1 = nomsg VAL [__return_5979=1, __return_6075=1, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=127, r1=1, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L134] COND TRUE !(mode1 == 0) VAL [__return_5979=1, __return_6075=1, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=127, r1=1, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L136] COND FALSE !(r1 == 255) VAL [__return_5979=1, __return_6075=1, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=127, r1=1, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L140] r1 = r1 + 1 [L141] node1__m1 = p3_old [L142] p3_old = nomsg VAL [__return_5979=1, __return_6075=1, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=1, node1__m1=127, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L143] COND TRUE ((int)node1__m1) != ((int)nomsg) VAL [__return_5979=1, __return_6075=1, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=1, node1__m1=127, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L145] COND FALSE !(!(alive1 == 0)) [L431] send1 = node1__m1 VAL [__return_5979=1, __return_6075=1, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L152] mode1 = 0 VAL [__return_5979=1, __return_6075=1, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L155] msg_t node2__m2; [L156] node2__m2 = nomsg VAL [__return_5979=1, __return_6075=1, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L157] COND TRUE !(mode2 == 0) [L159] node2__m2 = p1_old [L160] p1_old = nomsg VAL [__return_5979=1, __return_6075=1, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=1, mode3=1, node2__m2=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L161] COND FALSE !(((int)node2__m2) != ((int)nomsg)) VAL [__return_5979=1, __return_6075=1, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L170] mode2 = 0 VAL [__return_5979=1, __return_6075=1, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L173] msg_t node3__m3; [L174] node3__m3 = nomsg VAL [__return_5979=1, __return_6075=1, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L175] COND TRUE !(mode3 == 0) [L177] node3__m3 = p2_old [L178] p2_old = nomsg VAL [__return_5979=1, __return_6075=1, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L179] COND FALSE !(((int)node3__m3) != ((int)nomsg)) VAL [__return_5979=1, __return_6075=1, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L188] mode3 = 0 VAL [__return_5979=1, __return_6075=1, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L190] p1_old = p1_new [L191] p1_new = nomsg [L192] p2_old = p2_new [L193] p2_new = nomsg [L194] p3_old = p3_new [L195] p3_new = nomsg [L197] int check__tmp; VAL [__return_5979=1, __return_6075=1, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L198] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) <= 1 VAL [__return_5979=1, __return_6075=1, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L200] COND TRUE ((int)r1) < 3 [L202] check__tmp = 1 VAL [__return_5979=1, __return_6075=1, __return_main=0, alive1=0, alive2=0, alive3=1, check__tmp=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L205] __return_6075 = check__tmp [L206] main__c1 = __return_6075 [L208] _Bool __tmp_1; [L209] __tmp_1 = main__c1 [L210] _Bool assert__arg; [L211] assert__arg = __tmp_1 VAL [__return_5979=1, __return_6075=1, __return_main=0, alive1=0, alive2=0, alive3=1, assert__arg=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L212] COND FALSE !(assert__arg == 0) VAL [__return_5979=1, __return_6075=1, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L132] msg_t node1__m1; [L133] node1__m1 = nomsg VAL [__return_5979=1, __return_6075=1, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L134] COND FALSE !(!(mode1 == 0)) VAL [__return_5979=1, __return_6075=1, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L447] COND FALSE !(!(alive1 == 0)) VAL [__return_5979=1, __return_6075=1, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L458] mode1 = 1 VAL [__return_5979=1, __return_6075=1, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L155] msg_t node2__m2; [L156] node2__m2 = nomsg VAL [__return_5979=1, __return_6075=1, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L157] COND FALSE !(!(mode2 == 0)) VAL [__return_5979=1, __return_6075=1, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L356] COND FALSE !(!(alive2 == 0)) VAL [__return_5979=1, __return_6075=1, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L384] COND FALSE !(((int)send2) != ((int)id2)) VAL [__return_5979=1, __return_6075=1, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L367] mode2 = 1 VAL [__return_5979=1, __return_6075=1, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L173] msg_t node3__m3; [L174] node3__m3 = nomsg VAL [__return_5979=1, __return_6075=1, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L175] COND FALSE !(!(mode3 == 0)) VAL [__return_5979=1, __return_6075=1, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L270] COND TRUE !(alive3 == 0) [L272] int node3____CPAchecker_TMP_0; VAL [__return_5979=1, __return_6075=1, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L273] COND TRUE send3 != nomsg VAL [__return_5979=1, __return_6075=1, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L275] COND TRUE p3_new == nomsg [L277] node3____CPAchecker_TMP_0 = send3 VAL [__return_5979=1, __return_6075=1, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=0, node3____CPAchecker_TMP_0=127, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L279] p3_new = node3____CPAchecker_TMP_0 VAL [__return_5979=1, __return_6075=1, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=127, p3_old=-1, r1=2, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L281] mode3 = 1 VAL [__return_5979=1, __return_6075=1, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=127, p3_old=-1, r1=2, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L190] p1_old = p1_new [L191] p1_new = nomsg [L192] p2_old = p2_new [L193] p2_new = nomsg [L194] p3_old = p3_new [L195] p3_new = nomsg [L197] int check__tmp; VAL [__return_5979=1, __return_6075=1, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=127, r1=2, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L198] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) <= 1 VAL [__return_5979=1, __return_6075=1, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=127, r1=2, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L200] COND TRUE ((int)r1) < 3 [L202] check__tmp = 1 VAL [__return_5979=1, __return_6075=1, __return_main=0, alive1=0, alive2=0, alive3=1, check__tmp=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=127, r1=2, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L205] __return_6075 = check__tmp [L206] main__c1 = __return_6075 [L208] _Bool __tmp_1; [L209] __tmp_1 = main__c1 [L210] _Bool assert__arg; [L211] assert__arg = __tmp_1 VAL [__return_5979=1, __return_6075=1, __return_main=0, alive1=0, alive2=0, alive3=1, assert__arg=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=127, r1=2, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L212] COND FALSE !(assert__arg == 0) VAL [__return_5979=1, __return_6075=1, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=127, r1=2, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L132] msg_t node1__m1; [L133] node1__m1 = nomsg VAL [__return_5979=1, __return_6075=1, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=127, r1=2, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L134] COND TRUE !(mode1 == 0) VAL [__return_5979=1, __return_6075=1, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=127, r1=2, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L136] COND FALSE !(r1 == 255) VAL [__return_5979=1, __return_6075=1, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=127, r1=2, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L140] r1 = r1 + 1 [L141] node1__m1 = p3_old [L142] p3_old = nomsg VAL [__return_5979=1, __return_6075=1, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=1, node1__m1=127, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L143] COND TRUE ((int)node1__m1) != ((int)nomsg) VAL [__return_5979=1, __return_6075=1, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=1, node1__m1=127, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L145] COND FALSE !(!(alive1 == 0)) [L431] send1 = node1__m1 VAL [__return_5979=1, __return_6075=1, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L152] mode1 = 0 VAL [__return_5979=1, __return_6075=1, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L155] msg_t node2__m2; [L156] node2__m2 = nomsg VAL [__return_5979=1, __return_6075=1, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L157] COND TRUE !(mode2 == 0) [L159] node2__m2 = p1_old [L160] p1_old = nomsg VAL [__return_5979=1, __return_6075=1, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=1, mode3=1, node2__m2=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L161] COND FALSE !(((int)node2__m2) != ((int)nomsg)) VAL [__return_5979=1, __return_6075=1, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L170] mode2 = 0 VAL [__return_5979=1, __return_6075=1, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L173] msg_t node3__m3; [L174] node3__m3 = nomsg VAL [__return_5979=1, __return_6075=1, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L175] COND TRUE !(mode3 == 0) [L177] node3__m3 = p2_old [L178] p2_old = nomsg VAL [__return_5979=1, __return_6075=1, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L179] COND FALSE !(((int)node3__m3) != ((int)nomsg)) VAL [__return_5979=1, __return_6075=1, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L188] mode3 = 0 VAL [__return_5979=1, __return_6075=1, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L190] p1_old = p1_new [L191] p1_new = nomsg [L192] p2_old = p2_new [L193] p2_new = nomsg [L194] p3_old = p3_new [L195] p3_new = nomsg [L197] int check__tmp; VAL [__return_5979=1, __return_6075=1, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L198] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) <= 1 VAL [__return_5979=1, __return_6075=1, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L200] COND FALSE !(((int)r1) < 3) VAL [__return_5979=1, __return_6075=1, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L225] COND FALSE !(((((int)st1) + ((int)st2)) + ((int)st3)) == 1) [L232] check__tmp = 0 VAL [__return_5979=1, __return_6075=1, __return_main=0, alive1=0, alive2=0, alive3=1, check__tmp=0, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L205] __return_6075 = check__tmp [L206] main__c1 = __return_6075 [L208] _Bool __tmp_1; [L209] __tmp_1 = main__c1 [L210] _Bool assert__arg; [L211] assert__arg = __tmp_1 VAL [__return_5979=1, __return_6075=0, __return_main=0, alive1=0, alive2=0, alive3=1, assert__arg=0, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L212] COND TRUE assert__arg == 0 VAL [__return_5979=1, __return_6075=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L214] reach_error() VAL [__return_5979=1, __return_6075=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 82 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 269.7s, OverallIterations: 38, TraceHistogramMax: 6, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.2s, AutomataDifference: 185.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 53988 SdHoareTripleChecker+Valid, 27.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 53988 mSDsluCounter, 64672 SdHoareTripleChecker+Invalid, 24.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 58589 mSDsCounter, 830 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 35552 IncrementalHoareTripleChecker+Invalid, 36382 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 830 mSolverCounterUnsat, 6083 mSDtfsCounter, 35552 mSolverCounterSat, 0.3s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 4540 GetRequests, 2489 SyntacticMatches, 17 SemanticMatches, 2034 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 333305 ImplicationChecksByTransitivity, 148.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=215869occurred in iteration=22, InterpolantAutomatonStates: 1694, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 35.5s AutomataMinimizationTime, 37 MinimizatonAttempts, 1316564 StatesRemovedByMinimization, 35 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.5s SatisfiabilityAnalysisTime, 41.6s InterpolantComputationTime, 4400 NumberOfCodeBlocks, 4400 NumberOfCodeBlocksAsserted, 55 NumberOfCheckSat, 5545 ConstructedInterpolants, 58 QuantifiedInterpolants, 61503 SizeOfPredicates, 60 NumberOfNonLiveVariables, 5470 ConjunctsInSsa, 298 ConjunctsInUnsatCore, 65 InterpolantComputations, 23 PerfectInterpolantSequences, 2042/3078 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, ConComCheckerStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-12-02 14:42:09,304 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64dfb5de-24a6-477f-bc41-806157af07bc/bin/uautomizer-verify-84ZbGMXZE1/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE