./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.BOUNDED-6.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_a8e72d21-4776-47fd-9959-19aa7adb9977/bin/uautomizer-verify-84ZbGMXZE1/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8e72d21-4776-47fd-9959-19aa7adb9977/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_a8e72d21-4776-47fd-9959-19aa7adb9977/bin/uautomizer-verify-84ZbGMXZE1/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8e72d21-4776-47fd-9959-19aa7adb9977/bin/uautomizer-verify-84ZbGMXZE1/config/AutomizerReach.xml -i ../../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8e72d21-4776-47fd-9959-19aa7adb9977/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_a8e72d21-4776-47fd-9959-19aa7adb9977/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 4d2ad25966f5b06d930031b35708c7035a644982dad73f08910281a8c7df501a --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-12-02 14:52:57,306 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-12-02 14:52:57,359 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8e72d21-4776-47fd-9959-19aa7adb9977/bin/uautomizer-verify-84ZbGMXZE1/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-12-02 14:52:57,364 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-12-02 14:52:57,364 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-12-02 14:52:57,384 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-12-02 14:52:57,385 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-12-02 14:52:57,385 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-12-02 14:52:57,386 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-12-02 14:52:57,386 INFO L153 SettingsManager]: * Use memory slicer=true [2024-12-02 14:52:57,386 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-12-02 14:52:57,386 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-12-02 14:52:57,386 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-12-02 14:52:57,386 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-12-02 14:52:57,386 INFO L153 SettingsManager]: * Use SBE=true [2024-12-02 14:52:57,387 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-12-02 14:52:57,387 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-12-02 14:52:57,387 INFO L153 SettingsManager]: * sizeof long=4 [2024-12-02 14:52:57,387 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-12-02 14:52:57,387 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-12-02 14:52:57,387 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-12-02 14:52:57,387 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-12-02 14:52:57,387 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-12-02 14:52:57,387 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-12-02 14:52:57,388 INFO L153 SettingsManager]: * sizeof long double=12 [2024-12-02 14:52:57,388 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-12-02 14:52:57,388 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-12-02 14:52:57,388 INFO L153 SettingsManager]: * Use constant arrays=true [2024-12-02 14:52:57,388 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-12-02 14:52:57,388 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-12-02 14:52:57,388 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-12-02 14:52:57,388 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-12-02 14:52:57,388 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-12-02 14:52:57,388 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-12-02 14:52:57,388 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-12-02 14:52:57,388 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-12-02 14:52:57,389 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-12-02 14:52:57,389 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-12-02 14:52:57,389 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-12-02 14:52:57,389 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-12-02 14:52:57,389 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-12-02 14:52:57,389 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-12-02 14:52:57,389 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-12-02 14:52:57,389 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-12-02 14:52:57,389 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-12-02 14:52:57,389 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-12-02 14:52:57,390 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-12-02 14:52:57,390 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-12-02 14:52:57,390 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_a8e72d21-4776-47fd-9959-19aa7adb9977/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 -> 4d2ad25966f5b06d930031b35708c7035a644982dad73f08910281a8c7df501a [2024-12-02 14:52:57,597 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-12-02 14:52:57,604 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-12-02 14:52:57,606 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-12-02 14:52:57,607 INFO L270 PluginConnector]: Initializing CDTParser... [2024-12-02 14:52:57,607 INFO L274 PluginConnector]: CDTParser initialized [2024-12-02 14:52:57,608 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8e72d21-4776-47fd-9959-19aa7adb9977/bin/uautomizer-verify-84ZbGMXZE1/../../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c [2024-12-02 14:53:00,248 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8e72d21-4776-47fd-9959-19aa7adb9977/bin/uautomizer-verify-84ZbGMXZE1/data/3a893ebd4/e70e1b5821f143b3a21be0174570d52a/FLAG119464be2 [2024-12-02 14:53:00,468 INFO L384 CDTParser]: Found 1 translation units. [2024-12-02 14:53:00,468 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8e72d21-4776-47fd-9959-19aa7adb9977/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c [2024-12-02 14:53:00,476 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8e72d21-4776-47fd-9959-19aa7adb9977/bin/uautomizer-verify-84ZbGMXZE1/data/3a893ebd4/e70e1b5821f143b3a21be0174570d52a/FLAG119464be2 [2024-12-02 14:53:00,822 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8e72d21-4776-47fd-9959-19aa7adb9977/bin/uautomizer-verify-84ZbGMXZE1/data/3a893ebd4/e70e1b5821f143b3a21be0174570d52a [2024-12-02 14:53:00,824 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-12-02 14:53:00,825 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-12-02 14:53:00,825 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-12-02 14:53:00,826 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-12-02 14:53:00,828 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-12-02 14:53:00,829 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 02:53:00" (1/1) ... [2024-12-02 14:53:00,830 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13c3e06b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:53:00, skipping insertion in model container [2024-12-02 14:53:00,830 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 02:53:00" (1/1) ... [2024-12-02 14:53:00,844 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-12-02 14:53:00,978 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_a8e72d21-4776-47fd-9959-19aa7adb9977/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c[4373,4386] [2024-12-02 14:53:00,998 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-02 14:53:01,009 INFO L200 MainTranslator]: Completed pre-run [2024-12-02 14:53:01,038 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_a8e72d21-4776-47fd-9959-19aa7adb9977/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c[4373,4386] [2024-12-02 14:53:01,052 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-02 14:53:01,064 INFO L204 MainTranslator]: Completed translation [2024-12-02 14:53:01,064 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:53:01 WrapperNode [2024-12-02 14:53:01,065 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-12-02 14:53:01,065 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-12-02 14:53:01,065 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-12-02 14:53:01,065 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-12-02 14:53:01,070 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:53:01" (1/1) ... [2024-12-02 14:53:01,076 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:53:01" (1/1) ... [2024-12-02 14:53:01,097 INFO L138 Inliner]: procedures = 22, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 353 [2024-12-02 14:53:01,097 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-12-02 14:53:01,098 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-12-02 14:53:01,098 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-12-02 14:53:01,098 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-12-02 14:53:01,108 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:53:01" (1/1) ... [2024-12-02 14:53:01,108 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:53:01" (1/1) ... [2024-12-02 14:53:01,110 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:53:01" (1/1) ... [2024-12-02 14:53:01,124 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:53:01,125 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:53:01" (1/1) ... [2024-12-02 14:53:01,125 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:53:01" (1/1) ... [2024-12-02 14:53:01,131 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:53:01" (1/1) ... [2024-12-02 14:53:01,132 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:53:01" (1/1) ... [2024-12-02 14:53:01,136 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:53:01" (1/1) ... [2024-12-02 14:53:01,137 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:53:01" (1/1) ... [2024-12-02 14:53:01,138 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:53:01" (1/1) ... [2024-12-02 14:53:01,141 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-12-02 14:53:01,142 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-12-02 14:53:01,142 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-12-02 14:53:01,142 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-12-02 14:53:01,143 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:53:01" (1/1) ... [2024-12-02 14:53:01,148 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-12-02 14:53:01,160 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8e72d21-4776-47fd-9959-19aa7adb9977/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 14:53:01,171 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8e72d21-4776-47fd-9959-19aa7adb9977/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:53:01,174 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8e72d21-4776-47fd-9959-19aa7adb9977/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:53:01,199 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-12-02 14:53:01,199 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-12-02 14:53:01,199 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-12-02 14:53:01,199 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-12-02 14:53:01,298 INFO L234 CfgBuilder]: Building ICFG [2024-12-02 14:53:01,300 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-12-02 14:53:01,649 INFO L? ?]: Removed 35 outVars from TransFormulas that were not future-live. [2024-12-02 14:53:01,649 INFO L283 CfgBuilder]: Performing block encoding [2024-12-02 14:53:01,660 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-12-02 14:53:01,661 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2024-12-02 14:53:01,661 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 02:53:01 BoogieIcfgContainer [2024-12-02 14:53:01,661 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-12-02 14:53:01,662 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-12-02 14:53:01,662 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-12-02 14:53:01,667 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-12-02 14:53:01,667 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 02:53:00" (1/3) ... [2024-12-02 14:53:01,667 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@373e94a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 02:53:01, skipping insertion in model container [2024-12-02 14:53:01,668 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:53:01" (2/3) ... [2024-12-02 14:53:01,668 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@373e94a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 02:53:01, skipping insertion in model container [2024-12-02 14:53:01,668 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 02:53:01" (3/3) ... [2024-12-02 14:53:01,669 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c [2024-12-02 14:53:01,684 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-12-02 14:53:01,685 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c that has 1 procedures, 80 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2024-12-02 14:53:01,736 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-12-02 14:53:01,748 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;@1e870d34, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-02 14:53:01,749 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-12-02 14:53:01,753 INFO L276 IsEmpty]: Start isEmpty. Operand has 80 states, 78 states have (on average 1.6923076923076923) internal successors, (132), 79 states have internal predecessors, (132), 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:53:01,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-12-02 14:53:01,759 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:53:01,759 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:53:01,760 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 14:53:01,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:53:01,763 INFO L85 PathProgramCache]: Analyzing trace with hash -1485847759, now seen corresponding path program 1 times [2024-12-02 14:53:01,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:53:01,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917687048] [2024-12-02 14:53:01,769 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:53:01,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:53:01,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:53:02,045 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:53:02,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:53:02,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917687048] [2024-12-02 14:53:02,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [917687048] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 14:53:02,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 14:53:02,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-02 14:53:02,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402999916] [2024-12-02 14:53:02,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 14:53:02,049 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 14:53:02,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:53:02,062 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 14:53:02,063 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 14:53:02,064 INFO L87 Difference]: Start difference. First operand has 80 states, 78 states have (on average 1.6923076923076923) internal successors, (132), 79 states have internal predecessors, (132), 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:53:02,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:53:02,112 INFO L93 Difference]: Finished difference Result 184 states and 294 transitions. [2024-12-02 14:53:02,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 14:53:02,113 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:53:02,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:53:02,119 INFO L225 Difference]: With dead ends: 184 [2024-12-02 14:53:02,119 INFO L226 Difference]: Without dead ends: 118 [2024-12-02 14:53:02,121 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:53:02,123 INFO L435 NwaCegarLoop]: 172 mSDtfsCounter, 85 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 263 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:53:02,124 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 263 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 14:53:02,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2024-12-02 14:53:02,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 116. [2024-12-02 14:53:02,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 115 states have (on average 1.4956521739130435) internal successors, (172), 115 states have internal predecessors, (172), 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:53:02,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 172 transitions. [2024-12-02 14:53:02,152 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 172 transitions. Word has length 37 [2024-12-02 14:53:02,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:53:02,152 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 172 transitions. [2024-12-02 14:53:02,153 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:53:02,153 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 172 transitions. [2024-12-02 14:53:02,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-12-02 14:53:02,154 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:53:02,154 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:53:02,154 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-12-02 14:53:02,154 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 14:53:02,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:53:02,155 INFO L85 PathProgramCache]: Analyzing trace with hash -498229074, now seen corresponding path program 1 times [2024-12-02 14:53:02,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:53:02,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081794579] [2024-12-02 14:53:02,155 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:53:02,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:53:02,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:53:02,270 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:53:02,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:53:02,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081794579] [2024-12-02 14:53:02,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1081794579] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 14:53:02,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 14:53:02,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-02 14:53:02,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594830379] [2024-12-02 14:53:02,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 14:53:02,272 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 14:53:02,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:53:02,272 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 14:53:02,272 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 14:53:02,273 INFO L87 Difference]: Start difference. First operand 116 states and 172 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:53:02,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:53:02,306 INFO L93 Difference]: Finished difference Result 276 states and 424 transitions. [2024-12-02 14:53:02,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 14:53:02,307 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:53:02,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:53:02,308 INFO L225 Difference]: With dead ends: 276 [2024-12-02 14:53:02,308 INFO L226 Difference]: Without dead ends: 180 [2024-12-02 14:53:02,309 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:53:02,310 INFO L435 NwaCegarLoop]: 130 mSDtfsCounter, 69 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 213 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:53:02,311 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 213 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 14:53:02,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2024-12-02 14:53:02,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 178. [2024-12-02 14:53:02,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 177 states have (on average 1.5197740112994351) internal successors, (269), 177 states have internal predecessors, (269), 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:53:02,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 269 transitions. [2024-12-02 14:53:02,324 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 269 transitions. Word has length 38 [2024-12-02 14:53:02,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:53:02,324 INFO L471 AbstractCegarLoop]: Abstraction has 178 states and 269 transitions. [2024-12-02 14:53:02,324 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:53:02,324 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 269 transitions. [2024-12-02 14:53:02,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-12-02 14:53:02,325 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:53:02,325 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:53:02,325 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-12-02 14:53:02,326 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 14:53:02,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:53:02,326 INFO L85 PathProgramCache]: Analyzing trace with hash 1494403672, now seen corresponding path program 1 times [2024-12-02 14:53:02,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:53:02,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158337778] [2024-12-02 14:53:02,326 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:53:02,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:53:02,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:53:02,471 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:53:02,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:53:02,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158337778] [2024-12-02 14:53:02,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158337778] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 14:53:02,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 14:53:02,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-12-02 14:53:02,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633736192] [2024-12-02 14:53:02,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 14:53:02,473 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-02 14:53:02,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:53:02,473 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-02 14:53:02,473 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-12-02 14:53:02,474 INFO L87 Difference]: Start difference. First operand 178 states and 269 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:53:02,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:53:02,566 INFO L93 Difference]: Finished difference Result 810 states and 1265 transitions. [2024-12-02 14:53:02,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-02 14:53:02,567 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:53:02,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:53:02,571 INFO L225 Difference]: With dead ends: 810 [2024-12-02 14:53:02,571 INFO L226 Difference]: Without dead ends: 652 [2024-12-02 14:53:02,572 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:53:02,573 INFO L435 NwaCegarLoop]: 108 mSDtfsCounter, 447 mSDsluCounter, 512 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 447 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:53:02,574 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [447 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:53:02,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 652 states. [2024-12-02 14:53:02,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 652 to 334. [2024-12-02 14:53:02,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 334 states, 333 states have (on average 1.5285285285285286) internal successors, (509), 333 states have internal predecessors, (509), 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:53:02,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 509 transitions. [2024-12-02 14:53:02,598 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 509 transitions. Word has length 39 [2024-12-02 14:53:02,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:53:02,598 INFO L471 AbstractCegarLoop]: Abstraction has 334 states and 509 transitions. [2024-12-02 14:53:02,598 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:53:02,599 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 509 transitions. [2024-12-02 14:53:02,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-12-02 14:53:02,600 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:53:02,600 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:53:02,600 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-12-02 14:53:02,600 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 14:53:02,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:53:02,601 INFO L85 PathProgramCache]: Analyzing trace with hash -937582741, now seen corresponding path program 1 times [2024-12-02 14:53:02,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:53:02,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474635780] [2024-12-02 14:53:02,601 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:53:02,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:53:02,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:53:02,731 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:53:02,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:53:02,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474635780] [2024-12-02 14:53:02,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1474635780] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 14:53:02,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 14:53:02,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-12-02 14:53:02,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963001753] [2024-12-02 14:53:02,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 14:53:02,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-02 14:53:02,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:53:02,733 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-02 14:53:02,733 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-12-02 14:53:02,733 INFO L87 Difference]: Start difference. First operand 334 states and 509 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:53:02,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:53:02,803 INFO L93 Difference]: Finished difference Result 1164 states and 1792 transitions. [2024-12-02 14:53:02,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-02 14:53:02,804 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:53:02,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:53:02,808 INFO L225 Difference]: With dead ends: 1164 [2024-12-02 14:53:02,808 INFO L226 Difference]: Without dead ends: 850 [2024-12-02 14:53:02,809 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:53:02,810 INFO L435 NwaCegarLoop]: 195 mSDtfsCounter, 264 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-12-02 14:53:02,810 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [264 Valid, 334 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-12-02 14:53:02,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 850 states. [2024-12-02 14:53:02,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 850 to 846. [2024-12-02 14:53:02,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 846 states, 845 states have (on average 1.5301775147928993) internal successors, (1293), 845 states have internal predecessors, (1293), 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:53:02,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 846 states to 846 states and 1293 transitions. [2024-12-02 14:53:02,838 INFO L78 Accepts]: Start accepts. Automaton has 846 states and 1293 transitions. Word has length 40 [2024-12-02 14:53:02,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:53:02,839 INFO L471 AbstractCegarLoop]: Abstraction has 846 states and 1293 transitions. [2024-12-02 14:53:02,839 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:53:02,839 INFO L276 IsEmpty]: Start isEmpty. Operand 846 states and 1293 transitions. [2024-12-02 14:53:02,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-12-02 14:53:02,840 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:53:02,841 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:53:02,841 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-12-02 14:53:02,841 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 14:53:02,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:53:02,842 INFO L85 PathProgramCache]: Analyzing trace with hash 936362024, now seen corresponding path program 1 times [2024-12-02 14:53:02,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:53:02,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386795122] [2024-12-02 14:53:02,842 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:53:02,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:53:02,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:53:02,903 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:53:02,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:53:02,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386795122] [2024-12-02 14:53:02,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1386795122] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 14:53:02,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 14:53:02,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-02 14:53:02,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824521879] [2024-12-02 14:53:02,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 14:53:02,904 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 14:53:02,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:53:02,905 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 14:53:02,905 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 14:53:02,905 INFO L87 Difference]: Start difference. First operand 846 states and 1293 transitions. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 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:53:02,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:53:02,930 INFO L93 Difference]: Finished difference Result 2234 states and 3407 transitions. [2024-12-02 14:53:02,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 14:53:02,930 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 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:53:02,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:53:02,935 INFO L225 Difference]: With dead ends: 2234 [2024-12-02 14:53:02,935 INFO L226 Difference]: Without dead ends: 1408 [2024-12-02 14:53:02,936 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:53:02,937 INFO L435 NwaCegarLoop]: 178 mSDtfsCounter, 78 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 261 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:53:02,937 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 261 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 14:53:02,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1408 states. [2024-12-02 14:53:02,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1408 to 1406. [2024-12-02 14:53:02,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1406 states, 1405 states have (on average 1.5010676156583629) internal successors, (2109), 1405 states have internal predecessors, (2109), 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:53:02,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1406 states to 1406 states and 2109 transitions. [2024-12-02 14:53:02,970 INFO L78 Accepts]: Start accepts. Automaton has 1406 states and 2109 transitions. Word has length 40 [2024-12-02 14:53:02,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:53:02,971 INFO L471 AbstractCegarLoop]: Abstraction has 1406 states and 2109 transitions. [2024-12-02 14:53:02,971 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 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:53:02,971 INFO L276 IsEmpty]: Start isEmpty. Operand 1406 states and 2109 transitions. [2024-12-02 14:53:02,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-12-02 14:53:02,972 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:53:02,972 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:53:02,973 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-12-02 14:53:02,973 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 14:53:02,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:53:02,973 INFO L85 PathProgramCache]: Analyzing trace with hash -669019710, now seen corresponding path program 1 times [2024-12-02 14:53:02,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:53:02,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602045096] [2024-12-02 14:53:02,974 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:53:02,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:53:02,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:53:03,066 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:53:03,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:53:03,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602045096] [2024-12-02 14:53:03,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1602045096] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 14:53:03,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 14:53:03,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-12-02 14:53:03,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143001255] [2024-12-02 14:53:03,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 14:53:03,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-02 14:53:03,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:53:03,067 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-02 14:53:03,067 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-12-02 14:53:03,068 INFO L87 Difference]: Start difference. First operand 1406 states and 2109 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:53:03,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:53:03,227 INFO L93 Difference]: Finished difference Result 4178 states and 6287 transitions. [2024-12-02 14:53:03,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-02 14:53:03,228 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:53:03,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:53:03,234 INFO L225 Difference]: With dead ends: 4178 [2024-12-02 14:53:03,234 INFO L226 Difference]: Without dead ends: 2792 [2024-12-02 14:53:03,248 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:53:03,249 INFO L435 NwaCegarLoop]: 67 mSDtfsCounter, 457 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 457 SdHoareTripleChecker+Valid, 131 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:53:03,249 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [457 Valid, 131 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-12-02 14:53:03,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2792 states. [2024-12-02 14:53:03,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2792 to 2790. [2024-12-02 14:53:03,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2790 states, 2789 states have (on average 1.4933667981355325) internal successors, (4165), 2789 states have internal predecessors, (4165), 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:53:03,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2790 states to 2790 states and 4165 transitions. [2024-12-02 14:53:03,293 INFO L78 Accepts]: Start accepts. Automaton has 2790 states and 4165 transitions. Word has length 42 [2024-12-02 14:53:03,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:53:03,294 INFO L471 AbstractCegarLoop]: Abstraction has 2790 states and 4165 transitions. [2024-12-02 14:53:03,294 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:53:03,294 INFO L276 IsEmpty]: Start isEmpty. Operand 2790 states and 4165 transitions. [2024-12-02 14:53:03,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-12-02 14:53:03,295 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:53:03,295 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:53:03,295 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-12-02 14:53:03,295 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 14:53:03,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:53:03,296 INFO L85 PathProgramCache]: Analyzing trace with hash 957144957, now seen corresponding path program 1 times [2024-12-02 14:53:03,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:53:03,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004310972] [2024-12-02 14:53:03,296 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:53:03,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:53:03,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:53:03,531 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:53:03,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:53:03,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004310972] [2024-12-02 14:53:03,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2004310972] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 14:53:03,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 14:53:03,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-12-02 14:53:03,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691303303] [2024-12-02 14:53:03,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 14:53:03,532 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-02 14:53:03,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:53:03,533 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-02 14:53:03,533 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-12-02 14:53:03,533 INFO L87 Difference]: Start difference. First operand 2790 states and 4165 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:53:03,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:53:03,576 INFO L93 Difference]: Finished difference Result 2984 states and 4454 transitions. [2024-12-02 14:53:03,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-02 14:53:03,578 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:53:03,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:53:03,589 INFO L225 Difference]: With dead ends: 2984 [2024-12-02 14:53:03,589 INFO L226 Difference]: Without dead ends: 2982 [2024-12-02 14:53:03,590 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:53:03,591 INFO L435 NwaCegarLoop]: 107 mSDtfsCounter, 0 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 417 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 14:53:03,592 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 417 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 14:53:03,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2982 states. [2024-12-02 14:53:03,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2982 to 2982. [2024-12-02 14:53:03,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2982 states, 2981 states have (on average 1.461590070446159) internal successors, (4357), 2981 states have internal predecessors, (4357), 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:53:03,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2982 states to 2982 states and 4357 transitions. [2024-12-02 14:53:03,670 INFO L78 Accepts]: Start accepts. Automaton has 2982 states and 4357 transitions. Word has length 42 [2024-12-02 14:53:03,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:53:03,671 INFO L471 AbstractCegarLoop]: Abstraction has 2982 states and 4357 transitions. [2024-12-02 14:53:03,671 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:53:03,671 INFO L276 IsEmpty]: Start isEmpty. Operand 2982 states and 4357 transitions. [2024-12-02 14:53:03,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-12-02 14:53:03,672 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:53:03,672 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:53:03,672 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-12-02 14:53:03,672 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 14:53:03,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:53:03,673 INFO L85 PathProgramCache]: Analyzing trace with hash -382704394, now seen corresponding path program 1 times [2024-12-02 14:53:03,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:53:03,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885418138] [2024-12-02 14:53:03,673 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:53:03,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:53:03,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:53:03,742 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:53:03,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:53:03,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885418138] [2024-12-02 14:53:03,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1885418138] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 14:53:03,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 14:53:03,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-02 14:53:03,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923514159] [2024-12-02 14:53:03,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 14:53:03,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 14:53:03,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:53:03,743 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 14:53:03,743 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 14:53:03,743 INFO L87 Difference]: Start difference. First operand 2982 states and 4357 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:53:03,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:53:03,788 INFO L93 Difference]: Finished difference Result 7124 states and 10403 transitions. [2024-12-02 14:53:03,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 14:53:03,789 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:53:03,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:53:03,802 INFO L225 Difference]: With dead ends: 7124 [2024-12-02 14:53:03,802 INFO L226 Difference]: Without dead ends: 4162 [2024-12-02 14:53:03,805 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:53:03,806 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 59 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 14:53:03,806 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 197 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 14:53:03,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4162 states. [2024-12-02 14:53:03,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4162 to 4160. [2024-12-02 14:53:03,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4160 states, 4159 states have (on average 1.4486655446020678) internal successors, (6025), 4159 states have internal predecessors, (6025), 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:53:03,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4160 states to 4160 states and 6025 transitions. [2024-12-02 14:53:03,926 INFO L78 Accepts]: Start accepts. Automaton has 4160 states and 6025 transitions. Word has length 43 [2024-12-02 14:53:03,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:53:03,926 INFO L471 AbstractCegarLoop]: Abstraction has 4160 states and 6025 transitions. [2024-12-02 14:53:03,926 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:53:03,926 INFO L276 IsEmpty]: Start isEmpty. Operand 4160 states and 6025 transitions. [2024-12-02 14:53:03,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-12-02 14:53:03,928 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:53:03,929 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] [2024-12-02 14:53:03,929 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-12-02 14:53:03,929 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 14:53:03,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:53:03,929 INFO L85 PathProgramCache]: Analyzing trace with hash -1624116797, now seen corresponding path program 1 times [2024-12-02 14:53:03,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:53:03,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701137327] [2024-12-02 14:53:03,929 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:53:03,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:53:03,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:53:04,154 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-12-02 14:53:04,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:53:04,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701137327] [2024-12-02 14:53:04,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [701137327] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 14:53:04,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1512308183] [2024-12-02 14:53:04,155 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:53:04,155 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 14:53:04,155 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8e72d21-4776-47fd-9959-19aa7adb9977/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 14:53:04,160 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8e72d21-4776-47fd-9959-19aa7adb9977/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 14:53:04,161 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8e72d21-4776-47fd-9959-19aa7adb9977/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-12-02 14:53:04,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:53:04,296 INFO L256 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-12-02 14:53:04,304 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 14:53:04,863 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:53:04,863 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 14:53:05,520 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:53:05,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1512308183] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 14:53:05,520 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 14:53:05,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 8, 7] total 15 [2024-12-02 14:53:05,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795985225] [2024-12-02 14:53:05,520 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 14:53:05,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-12-02 14:53:05,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:53:05,522 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-12-02 14:53:05,522 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2024-12-02 14:53:05,522 INFO L87 Difference]: Start difference. First operand 4160 states and 6025 transitions. Second operand has 15 states, 15 states have (on average 11.2) internal successors, (168), 15 states have internal predecessors, (168), 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:53:06,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:53:06,390 INFO L93 Difference]: Finished difference Result 16221 states and 23464 transitions. [2024-12-02 14:53:06,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-12-02 14:53:06,391 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 11.2) internal successors, (168), 15 states have internal predecessors, (168), 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 60 [2024-12-02 14:53:06,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:53:06,432 INFO L225 Difference]: With dead ends: 16221 [2024-12-02 14:53:06,432 INFO L226 Difference]: Without dead ends: 12083 [2024-12-02 14:53:06,438 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 259 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=268, Invalid=602, Unknown=0, NotChecked=0, Total=870 [2024-12-02 14:53:06,438 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 1962 mSDsluCounter, 992 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1962 SdHoareTripleChecker+Valid, 1142 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-12-02 14:53:06,439 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1962 Valid, 1142 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-12-02 14:53:06,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12083 states. [2024-12-02 14:53:06,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12083 to 11191. [2024-12-02 14:53:06,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11191 states, 11190 states have (on average 1.426988382484361) internal successors, (15968), 11190 states have internal predecessors, (15968), 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:53:06,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11191 states to 11191 states and 15968 transitions. [2024-12-02 14:53:06,731 INFO L78 Accepts]: Start accepts. Automaton has 11191 states and 15968 transitions. Word has length 60 [2024-12-02 14:53:06,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:53:06,732 INFO L471 AbstractCegarLoop]: Abstraction has 11191 states and 15968 transitions. [2024-12-02 14:53:06,732 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 11.2) internal successors, (168), 15 states have internal predecessors, (168), 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:53:06,732 INFO L276 IsEmpty]: Start isEmpty. Operand 11191 states and 15968 transitions. [2024-12-02 14:53:06,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-12-02 14:53:06,733 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:53:06,733 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] [2024-12-02 14:53:06,743 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8e72d21-4776-47fd-9959-19aa7adb9977/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-12-02 14:53:06,934 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8e72d21-4776-47fd-9959-19aa7adb9977/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 14:53:06,934 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 14:53:06,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:53:06,935 INFO L85 PathProgramCache]: Analyzing trace with hash 1922561508, now seen corresponding path program 1 times [2024-12-02 14:53:06,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:53:06,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18928766] [2024-12-02 14:53:06,935 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:53:06,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:53:06,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:53:06,993 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:53:06,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:53:06,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18928766] [2024-12-02 14:53:06,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18928766] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 14:53:06,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 14:53:06,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-02 14:53:06,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462558191] [2024-12-02 14:53:06,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 14:53:06,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 14:53:06,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:53:06,994 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 14:53:06,994 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 14:53:06,994 INFO L87 Difference]: Start difference. First operand 11191 states and 15968 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:53:07,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:53:07,057 INFO L93 Difference]: Finished difference Result 27096 states and 38531 transitions. [2024-12-02 14:53:07,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 14:53:07,058 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:53:07,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:53:07,096 INFO L225 Difference]: With dead ends: 27096 [2024-12-02 14:53:07,096 INFO L226 Difference]: Without dead ends: 18724 [2024-12-02 14:53:07,106 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:53:07,107 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 56 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 214 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:53:07,107 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 214 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 14:53:07,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18724 states. [2024-12-02 14:53:07,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18724 to 18722. [2024-12-02 14:53:07,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18722 states, 18721 states have (on average 1.4080978580204049) internal successors, (26361), 18721 states have internal predecessors, (26361), 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:53:07,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18722 states to 18722 states and 26361 transitions. [2024-12-02 14:53:07,453 INFO L78 Accepts]: Start accepts. Automaton has 18722 states and 26361 transitions. Word has length 61 [2024-12-02 14:53:07,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:53:07,454 INFO L471 AbstractCegarLoop]: Abstraction has 18722 states and 26361 transitions. [2024-12-02 14:53:07,455 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:53:07,455 INFO L276 IsEmpty]: Start isEmpty. Operand 18722 states and 26361 transitions. [2024-12-02 14:53:07,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-12-02 14:53:07,457 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:53:07,457 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] [2024-12-02 14:53:07,457 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-12-02 14:53:07,457 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 14:53:07,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:53:07,458 INFO L85 PathProgramCache]: Analyzing trace with hash -1420896607, now seen corresponding path program 1 times [2024-12-02 14:53:07,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:53:07,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808943445] [2024-12-02 14:53:07,458 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:53:07,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:53:07,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:53:07,638 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:53:07,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:53:07,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808943445] [2024-12-02 14:53:07,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [808943445] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 14:53:07,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 14:53:07,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-12-02 14:53:07,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185271423] [2024-12-02 14:53:07,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 14:53:07,640 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-02 14:53:07,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:53:07,640 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-02 14:53:07,641 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-12-02 14:53:07,641 INFO L87 Difference]: Start difference. First operand 18722 states and 26361 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 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:53:07,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:53:07,798 INFO L93 Difference]: Finished difference Result 38769 states and 54929 transitions. [2024-12-02 14:53:07,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-02 14:53:07,799 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 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:53:07,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:53:07,864 INFO L225 Difference]: With dead ends: 38769 [2024-12-02 14:53:07,864 INFO L226 Difference]: Without dead ends: 30803 [2024-12-02 14:53:07,877 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:53:07,877 INFO L435 NwaCegarLoop]: 195 mSDtfsCounter, 307 mSDsluCounter, 327 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 307 SdHoareTripleChecker+Valid, 522 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:53:07,878 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [307 Valid, 522 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 14:53:07,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30803 states. [2024-12-02 14:53:08,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30803 to 26375. [2024-12-02 14:53:08,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26375 states, 26374 states have (on average 1.401721392280276) internal successors, (36969), 26374 states have internal predecessors, (36969), 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:53:08,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26375 states to 26375 states and 36969 transitions. [2024-12-02 14:53:08,268 INFO L78 Accepts]: Start accepts. Automaton has 26375 states and 36969 transitions. Word has length 61 [2024-12-02 14:53:08,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:53:08,268 INFO L471 AbstractCegarLoop]: Abstraction has 26375 states and 36969 transitions. [2024-12-02 14:53:08,268 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 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:53:08,268 INFO L276 IsEmpty]: Start isEmpty. Operand 26375 states and 36969 transitions. [2024-12-02 14:53:08,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-12-02 14:53:08,339 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:53:08,339 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] [2024-12-02 14:53:08,339 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-12-02 14:53:08,339 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 14:53:08,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:53:08,340 INFO L85 PathProgramCache]: Analyzing trace with hash 997387912, now seen corresponding path program 1 times [2024-12-02 14:53:08,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:53:08,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162499319] [2024-12-02 14:53:08,340 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:53:08,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:53:08,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:53:08,398 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:53:08,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:53:08,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162499319] [2024-12-02 14:53:08,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [162499319] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 14:53:08,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 14:53:08,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-02 14:53:08,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692829283] [2024-12-02 14:53:08,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 14:53:08,398 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 14:53:08,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:53:08,399 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 14:53:08,399 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 14:53:08,399 INFO L87 Difference]: Start difference. First operand 26375 states and 36969 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:53:08,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:53:08,489 INFO L93 Difference]: Finished difference Result 43208 states and 60059 transitions. [2024-12-02 14:53:08,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 14:53:08,490 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:53:08,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:53:08,523 INFO L225 Difference]: With dead ends: 43208 [2024-12-02 14:53:08,523 INFO L226 Difference]: Without dead ends: 27138 [2024-12-02 14:53:08,537 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:53:08,538 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 59 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 240 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:53:08,538 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 240 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 14:53:08,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27138 states. [2024-12-02 14:53:08,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27138 to 26424. [2024-12-02 14:53:08,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26424 states, 26423 states have (on average 1.372705597396208) internal successors, (36271), 26423 states have internal predecessors, (36271), 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:53:08,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26424 states to 26424 states and 36271 transitions. [2024-12-02 14:53:08,927 INFO L78 Accepts]: Start accepts. Automaton has 26424 states and 36271 transitions. Word has length 61 [2024-12-02 14:53:08,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:53:08,927 INFO L471 AbstractCegarLoop]: Abstraction has 26424 states and 36271 transitions. [2024-12-02 14:53:08,927 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:53:08,927 INFO L276 IsEmpty]: Start isEmpty. Operand 26424 states and 36271 transitions. [2024-12-02 14:53:08,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-12-02 14:53:08,929 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:53:08,929 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] [2024-12-02 14:53:08,929 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-12-02 14:53:08,929 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 14:53:08,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:53:08,930 INFO L85 PathProgramCache]: Analyzing trace with hash -545844847, now seen corresponding path program 1 times [2024-12-02 14:53:08,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:53:08,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486896271] [2024-12-02 14:53:08,930 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:53:08,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:53:08,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:53:09,094 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:53:09,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:53:09,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486896271] [2024-12-02 14:53:09,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1486896271] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 14:53:09,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 14:53:09,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-12-02 14:53:09,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308228640] [2024-12-02 14:53:09,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 14:53:09,095 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-02 14:53:09,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:53:09,096 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-02 14:53:09,096 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-12-02 14:53:09,096 INFO L87 Difference]: Start difference. First operand 26424 states and 36271 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 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:53:09,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:53:09,243 INFO L93 Difference]: Finished difference Result 39509 states and 54746 transitions. [2024-12-02 14:53:09,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-02 14:53:09,243 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 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:53:09,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:53:09,277 INFO L225 Difference]: With dead ends: 39509 [2024-12-02 14:53:09,277 INFO L226 Difference]: Without dead ends: 35091 [2024-12-02 14:53:09,286 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:53:09,286 INFO L435 NwaCegarLoop]: 190 mSDtfsCounter, 314 mSDsluCounter, 316 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 314 SdHoareTripleChecker+Valid, 506 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 14:53:09,287 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [314 Valid, 506 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 14:53:09,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35091 states. [2024-12-02 14:53:09,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35091 to 30660. [2024-12-02 14:53:09,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30660 states, 30659 states have (on average 1.372093023255814) internal successors, (42067), 30659 states have internal predecessors, (42067), 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:53:09,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30660 states to 30660 states and 42067 transitions. [2024-12-02 14:53:09,749 INFO L78 Accepts]: Start accepts. Automaton has 30660 states and 42067 transitions. Word has length 61 [2024-12-02 14:53:09,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:53:09,749 INFO L471 AbstractCegarLoop]: Abstraction has 30660 states and 42067 transitions. [2024-12-02 14:53:09,750 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 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:53:09,750 INFO L276 IsEmpty]: Start isEmpty. Operand 30660 states and 42067 transitions. [2024-12-02 14:53:09,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-12-02 14:53:09,752 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:53:09,752 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] [2024-12-02 14:53:09,753 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-12-02 14:53:09,753 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 14:53:09,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:53:09,753 INFO L85 PathProgramCache]: Analyzing trace with hash -237073659, now seen corresponding path program 1 times [2024-12-02 14:53:09,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:53:09,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141550099] [2024-12-02 14:53:09,754 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:53:09,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:53:09,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:53:09,850 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:53:09,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:53:09,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141550099] [2024-12-02 14:53:09,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [141550099] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 14:53:09,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 14:53:09,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-12-02 14:53:09,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052338827] [2024-12-02 14:53:09,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 14:53:09,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-02 14:53:09,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:53:09,852 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-02 14:53:09,852 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-12-02 14:53:09,852 INFO L87 Difference]: Start difference. First operand 30660 states and 42067 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 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:53:09,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:53:09,999 INFO L93 Difference]: Finished difference Result 52050 states and 72142 transitions. [2024-12-02 14:53:09,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-02 14:53:09,999 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 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 62 [2024-12-02 14:53:10,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:53:10,038 INFO L225 Difference]: With dead ends: 52050 [2024-12-02 14:53:10,038 INFO L226 Difference]: Without dead ends: 42701 [2024-12-02 14:53:10,050 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:53:10,050 INFO L435 NwaCegarLoop]: 198 mSDtfsCounter, 307 mSDsluCounter, 338 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 307 SdHoareTripleChecker+Valid, 536 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 14:53:10,051 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [307 Valid, 536 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 14:53:10,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42701 states. [2024-12-02 14:53:10,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42701 to 38255. [2024-12-02 14:53:10,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38255 states, 38254 states have (on average 1.3673079939352748) internal successors, (52305), 38254 states have internal predecessors, (52305), 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:53:10,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38255 states to 38255 states and 52305 transitions. [2024-12-02 14:53:10,601 INFO L78 Accepts]: Start accepts. Automaton has 38255 states and 52305 transitions. Word has length 62 [2024-12-02 14:53:10,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:53:10,601 INFO L471 AbstractCegarLoop]: Abstraction has 38255 states and 52305 transitions. [2024-12-02 14:53:10,602 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 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:53:10,602 INFO L276 IsEmpty]: Start isEmpty. Operand 38255 states and 52305 transitions. [2024-12-02 14:53:10,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-12-02 14:53:10,603 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:53:10,603 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:53:10,603 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-12-02 14:53:10,603 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 14:53:10,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:53:10,603 INFO L85 PathProgramCache]: Analyzing trace with hash -1234823791, now seen corresponding path program 1 times [2024-12-02 14:53:10,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:53:10,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922680272] [2024-12-02 14:53:10,604 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:53:10,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:53:10,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:53:10,642 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:53:10,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:53:10,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922680272] [2024-12-02 14:53:10,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [922680272] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 14:53:10,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 14:53:10,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-02 14:53:10,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074873123] [2024-12-02 14:53:10,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 14:53:10,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 14:53:10,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:53:10,644 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 14:53:10,644 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 14:53:10,644 INFO L87 Difference]: Start difference. First operand 38255 states and 52305 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 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:53:10,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:53:10,790 INFO L93 Difference]: Finished difference Result 67694 states and 92314 transitions. [2024-12-02 14:53:10,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 14:53:10,791 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 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:53:10,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:53:10,830 INFO L225 Difference]: With dead ends: 67694 [2024-12-02 14:53:10,830 INFO L226 Difference]: Without dead ends: 31731 [2024-12-02 14:53:10,851 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:53:10,852 INFO L435 NwaCegarLoop]: 156 mSDtfsCounter, 56 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 250 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:53:10,852 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 250 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 14:53:10,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31731 states. [2024-12-02 14:53:11,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31731 to 28892. [2024-12-02 14:53:11,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28892 states, 28891 states have (on average 1.3502128690595687) internal successors, (39009), 28891 states have internal predecessors, (39009), 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:53:11,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28892 states to 28892 states and 39009 transitions. [2024-12-02 14:53:11,271 INFO L78 Accepts]: Start accepts. Automaton has 28892 states and 39009 transitions. Word has length 64 [2024-12-02 14:53:11,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:53:11,272 INFO L471 AbstractCegarLoop]: Abstraction has 28892 states and 39009 transitions. [2024-12-02 14:53:11,272 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 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:53:11,272 INFO L276 IsEmpty]: Start isEmpty. Operand 28892 states and 39009 transitions. [2024-12-02 14:53:11,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-12-02 14:53:11,274 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:53:11,274 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:53:11,275 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-12-02 14:53:11,275 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 14:53:11,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:53:11,276 INFO L85 PathProgramCache]: Analyzing trace with hash 1761263523, now seen corresponding path program 1 times [2024-12-02 14:53:11,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:53:11,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663911183] [2024-12-02 14:53:11,276 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:53:11,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:53:11,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:53:11,375 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:53:11,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:53:11,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663911183] [2024-12-02 14:53:11,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [663911183] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 14:53:11,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 14:53:11,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-12-02 14:53:11,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503658119] [2024-12-02 14:53:11,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 14:53:11,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-02 14:53:11,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:53:11,377 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-02 14:53:11,377 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-12-02 14:53:11,378 INFO L87 Difference]: Start difference. First operand 28892 states and 39009 transitions. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 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:53:11,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:53:11,720 INFO L93 Difference]: Finished difference Result 67116 states and 90488 transitions. [2024-12-02 14:53:11,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-02 14:53:11,720 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 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:53:11,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:53:11,762 INFO L225 Difference]: With dead ends: 67116 [2024-12-02 14:53:11,762 INFO L226 Difference]: Without dead ends: 38310 [2024-12-02 14:53:11,775 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:53:11,775 INFO L435 NwaCegarLoop]: 67 mSDtfsCounter, 413 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 413 SdHoareTripleChecker+Valid, 135 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:53:11,776 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [413 Valid, 135 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-12-02 14:53:11,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38310 states. [2024-12-02 14:53:12,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38310 to 37966. [2024-12-02 14:53:12,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37966 states, 37965 states have (on average 1.3334123534834716) internal successors, (50623), 37965 states have internal predecessors, (50623), 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:53:12,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37966 states to 37966 states and 50623 transitions. [2024-12-02 14:53:12,130 INFO L78 Accepts]: Start accepts. Automaton has 37966 states and 50623 transitions. Word has length 66 [2024-12-02 14:53:12,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:53:12,131 INFO L471 AbstractCegarLoop]: Abstraction has 37966 states and 50623 transitions. [2024-12-02 14:53:12,131 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 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:53:12,131 INFO L276 IsEmpty]: Start isEmpty. Operand 37966 states and 50623 transitions. [2024-12-02 14:53:12,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-12-02 14:53:12,134 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:53:12,134 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:53:12,134 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-12-02 14:53:12,134 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 14:53:12,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:53:12,135 INFO L85 PathProgramCache]: Analyzing trace with hash -683589816, now seen corresponding path program 1 times [2024-12-02 14:53:12,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:53:12,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730754900] [2024-12-02 14:53:12,135 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:53:12,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:53:12,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:53:12,220 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:53:12,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:53:12,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730754900] [2024-12-02 14:53:12,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [730754900] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 14:53:12,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1217915919] [2024-12-02 14:53:12,221 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:53:12,221 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 14:53:12,221 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8e72d21-4776-47fd-9959-19aa7adb9977/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 14:53:12,222 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8e72d21-4776-47fd-9959-19aa7adb9977/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 14:53:12,224 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8e72d21-4776-47fd-9959-19aa7adb9977/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-12-02 14:53:12,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:53:12,328 INFO L256 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-12-02 14:53:12,329 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 14:53:12,533 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:53:12,533 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 14:53:12,700 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:53:12,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1217915919] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 14:53:12,700 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 14:53:12,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2024-12-02 14:53:12,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378832072] [2024-12-02 14:53:12,701 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 14:53:12,701 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-12-02 14:53:12,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:53:12,701 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-12-02 14:53:12,702 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-12-02 14:53:12,702 INFO L87 Difference]: Start difference. First operand 37966 states and 50623 transitions. Second operand has 11 states, 11 states have (on average 10.090909090909092) internal successors, (111), 10 states have internal predecessors, (111), 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:53:13,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:53:13,148 INFO L93 Difference]: Finished difference Result 82254 states and 110188 transitions. [2024-12-02 14:53:13,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-12-02 14:53:13,149 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 10.090909090909092) internal successors, (111), 10 states have internal predecessors, (111), 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:53:13,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:53:13,196 INFO L225 Difference]: With dead ends: 82254 [2024-12-02 14:53:13,196 INFO L226 Difference]: Without dead ends: 50365 [2024-12-02 14:53:13,215 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 122 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:53:13,216 INFO L435 NwaCegarLoop]: 65 mSDtfsCounter, 957 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 957 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-12-02 14:53:13,216 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [957 Valid, 364 Invalid, 263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-12-02 14:53:13,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50365 states. [2024-12-02 14:53:13,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50365 to 37627. [2024-12-02 14:53:13,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37627 states, 37626 states have (on average 1.341412852814543) internal successors, (50472), 37626 states have internal predecessors, (50472), 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:53:13,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37627 states to 37627 states and 50472 transitions. [2024-12-02 14:53:13,747 INFO L78 Accepts]: Start accepts. Automaton has 37627 states and 50472 transitions. Word has length 66 [2024-12-02 14:53:13,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:53:13,747 INFO L471 AbstractCegarLoop]: Abstraction has 37627 states and 50472 transitions. [2024-12-02 14:53:13,747 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.090909090909092) internal successors, (111), 10 states have internal predecessors, (111), 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:53:13,747 INFO L276 IsEmpty]: Start isEmpty. Operand 37627 states and 50472 transitions. [2024-12-02 14:53:13,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-12-02 14:53:13,750 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:53:13,750 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] [2024-12-02 14:53:13,755 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8e72d21-4776-47fd-9959-19aa7adb9977/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-12-02 14:53:13,950 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8e72d21-4776-47fd-9959-19aa7adb9977/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 14:53:13,950 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 14:53:13,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:53:13,951 INFO L85 PathProgramCache]: Analyzing trace with hash -929496895, now seen corresponding path program 1 times [2024-12-02 14:53:13,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:53:13,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571301432] [2024-12-02 14:53:13,951 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:53:13,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:53:13,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:53:14,063 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:53:14,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:53:14,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571301432] [2024-12-02 14:53:14,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1571301432] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 14:53:14,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2092660363] [2024-12-02 14:53:14,063 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:53:14,063 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 14:53:14,063 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8e72d21-4776-47fd-9959-19aa7adb9977/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 14:53:14,065 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8e72d21-4776-47fd-9959-19aa7adb9977/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 14:53:14,067 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8e72d21-4776-47fd-9959-19aa7adb9977/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-12-02 14:53:14,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:53:14,250 INFO L256 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-12-02 14:53:14,252 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 14:53:14,431 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:53:14,431 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 14:53:14,531 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:53:14,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2092660363] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 14:53:14,531 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 14:53:14,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2024-12-02 14:53:14,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776730793] [2024-12-02 14:53:14,531 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 14:53:14,532 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-12-02 14:53:14,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:53:14,532 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-12-02 14:53:14,532 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-12-02 14:53:14,532 INFO L87 Difference]: Start difference. First operand 37627 states and 50472 transitions. Second operand has 11 states, 11 states have (on average 10.272727272727273) internal successors, (113), 10 states have internal predecessors, (113), 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:53:14,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:53:14,836 INFO L93 Difference]: Finished difference Result 77678 states and 103789 transitions. [2024-12-02 14:53:14,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-12-02 14:53:14,837 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 10.272727272727273) internal successors, (113), 10 states have internal predecessors, (113), 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 67 [2024-12-02 14:53:14,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:53:14,878 INFO L225 Difference]: With dead ends: 77678 [2024-12-02 14:53:14,878 INFO L226 Difference]: Without dead ends: 44851 [2024-12-02 14:53:14,894 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 124 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:53:14,895 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 965 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 965 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-12-02 14:53:14,895 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [965 Valid, 270 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-12-02 14:53:14,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44851 states. [2024-12-02 14:53:15,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44851 to 38511. [2024-12-02 14:53:15,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38511 states, 38510 states have (on average 1.333549727343547) internal successors, (51355), 38510 states have internal predecessors, (51355), 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:53:15,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38511 states to 38511 states and 51355 transitions. [2024-12-02 14:53:15,209 INFO L78 Accepts]: Start accepts. Automaton has 38511 states and 51355 transitions. Word has length 67 [2024-12-02 14:53:15,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:53:15,209 INFO L471 AbstractCegarLoop]: Abstraction has 38511 states and 51355 transitions. [2024-12-02 14:53:15,209 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.272727272727273) internal successors, (113), 10 states have internal predecessors, (113), 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:53:15,209 INFO L276 IsEmpty]: Start isEmpty. Operand 38511 states and 51355 transitions. [2024-12-02 14:53:15,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-12-02 14:53:15,211 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:53:15,211 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] [2024-12-02 14:53:15,220 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8e72d21-4776-47fd-9959-19aa7adb9977/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-12-02 14:53:15,412 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8e72d21-4776-47fd-9959-19aa7adb9977/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 14:53:15,412 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 14:53:15,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:53:15,412 INFO L85 PathProgramCache]: Analyzing trace with hash -2073252700, now seen corresponding path program 1 times [2024-12-02 14:53:15,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:53:15,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642617767] [2024-12-02 14:53:15,412 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:53:15,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:53:15,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:53:15,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:53:15,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:53:15,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642617767] [2024-12-02 14:53:15,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642617767] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 14:53:15,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1914214067] [2024-12-02 14:53:15,532 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:53:15,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 14:53:15,532 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8e72d21-4776-47fd-9959-19aa7adb9977/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 14:53:15,534 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8e72d21-4776-47fd-9959-19aa7adb9977/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 14:53:15,535 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8e72d21-4776-47fd-9959-19aa7adb9977/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-12-02 14:53:15,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:53:15,654 INFO L256 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-12-02 14:53:15,656 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 14:53:15,867 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:53:15,867 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 14:53:15,990 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:53:15,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1914214067] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 14:53:15,990 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 14:53:15,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2024-12-02 14:53:15,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764259671] [2024-12-02 14:53:15,991 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 14:53:15,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-12-02 14:53:15,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:53:15,992 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-12-02 14:53:15,992 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-12-02 14:53:15,992 INFO L87 Difference]: Start difference. First operand 38511 states and 51355 transitions. Second operand has 11 states, 11 states have (on average 10.545454545454545) internal successors, (116), 10 states have internal predecessors, (116), 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:53:16,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:53:16,335 INFO L93 Difference]: Finished difference Result 72575 states and 96578 transitions. [2024-12-02 14:53:16,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-12-02 14:53:16,336 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 10.545454545454545) internal successors, (116), 10 states have internal predecessors, (116), 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 67 [2024-12-02 14:53:16,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:53:16,377 INFO L225 Difference]: With dead ends: 72575 [2024-12-02 14:53:16,377 INFO L226 Difference]: Without dead ends: 54262 [2024-12-02 14:53:16,392 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 124 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:53:16,392 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 776 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 776 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-12-02 14:53:16,392 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [776 Valid, 252 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-12-02 14:53:16,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54262 states. [2024-12-02 14:53:16,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54262 to 42674. [2024-12-02 14:53:16,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42674 states, 42673 states have (on average 1.331357064185785) internal successors, (56813), 42673 states have internal predecessors, (56813), 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:53:16,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42674 states to 42674 states and 56813 transitions. [2024-12-02 14:53:16,896 INFO L78 Accepts]: Start accepts. Automaton has 42674 states and 56813 transitions. Word has length 67 [2024-12-02 14:53:16,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:53:16,896 INFO L471 AbstractCegarLoop]: Abstraction has 42674 states and 56813 transitions. [2024-12-02 14:53:16,896 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.545454545454545) internal successors, (116), 10 states have internal predecessors, (116), 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:53:16,896 INFO L276 IsEmpty]: Start isEmpty. Operand 42674 states and 56813 transitions. [2024-12-02 14:53:16,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-12-02 14:53:16,898 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:53:16,899 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:53:16,904 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8e72d21-4776-47fd-9959-19aa7adb9977/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-12-02 14:53:17,099 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8e72d21-4776-47fd-9959-19aa7adb9977/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 14:53:17,099 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 14:53:17,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:53:17,100 INFO L85 PathProgramCache]: Analyzing trace with hash 379264655, now seen corresponding path program 1 times [2024-12-02 14:53:17,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:53:17,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624159796] [2024-12-02 14:53:17,100 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:53:17,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:53:17,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:53:17,405 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:53:17,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:53:17,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624159796] [2024-12-02 14:53:17,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624159796] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 14:53:17,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [878246089] [2024-12-02 14:53:17,406 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:53:17,406 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 14:53:17,406 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8e72d21-4776-47fd-9959-19aa7adb9977/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 14:53:17,408 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8e72d21-4776-47fd-9959-19aa7adb9977/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 14:53:17,409 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8e72d21-4776-47fd-9959-19aa7adb9977/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-12-02 14:53:17,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:53:17,528 INFO L256 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-12-02 14:53:17,530 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 14:53:18,666 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:53:18,666 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 14:53:19,349 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:53:19,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [878246089] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 14:53:19,349 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 14:53:19,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 13, 13] total 32 [2024-12-02 14:53:19,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213785687] [2024-12-02 14:53:19,350 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 14:53:19,350 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-12-02 14:53:19,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:53:19,351 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-12-02 14:53:19,351 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=888, Unknown=0, NotChecked=0, Total=992 [2024-12-02 14:53:19,351 INFO L87 Difference]: Start difference. First operand 42674 states and 56813 transitions. Second operand has 32 states, 32 states have (on average 5.9375) internal successors, (190), 32 states have internal predecessors, (190), 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:53:47,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:53:47,899 INFO L93 Difference]: Finished difference Result 704053 states and 927350 transitions. [2024-12-02 14:53:47,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 487 states. [2024-12-02 14:53:47,899 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 5.9375) internal successors, (190), 32 states have internal predecessors, (190), 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:53:47,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:53:48,893 INFO L225 Difference]: With dead ends: 704053 [2024-12-02 14:53:48,893 INFO L226 Difference]: Without dead ends: 660704 [2024-12-02 14:53:49,222 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 630 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 514 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127745 ImplicationChecksByTransitivity, 22.0s TimeCoverageRelationStatistics Valid=26462, Invalid=239278, Unknown=0, NotChecked=0, Total=265740 [2024-12-02 14:53:49,223 INFO L435 NwaCegarLoop]: 289 mSDtfsCounter, 14322 mSDsluCounter, 3807 mSDsCounter, 0 mSdLazyCounter, 5415 mSolverCounterSat, 355 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14322 SdHoareTripleChecker+Valid, 4096 SdHoareTripleChecker+Invalid, 5770 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 355 IncrementalHoareTripleChecker+Valid, 5415 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2024-12-02 14:53:49,223 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14322 Valid, 4096 Invalid, 5770 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [355 Valid, 5415 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2024-12-02 14:53:49,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 660704 states. [2024-12-02 14:53:53,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 660704 to 152030. [2024-12-02 14:53:53,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152030 states, 152029 states have (on average 1.328391293766321) internal successors, (201954), 152029 states have internal predecessors, (201954), 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:53:53,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152030 states to 152030 states and 201954 transitions. [2024-12-02 14:53:53,524 INFO L78 Accepts]: Start accepts. Automaton has 152030 states and 201954 transitions. Word has length 69 [2024-12-02 14:53:53,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:53:53,524 INFO L471 AbstractCegarLoop]: Abstraction has 152030 states and 201954 transitions. [2024-12-02 14:53:53,524 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 5.9375) internal successors, (190), 32 states have internal predecessors, (190), 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:53:53,524 INFO L276 IsEmpty]: Start isEmpty. Operand 152030 states and 201954 transitions. [2024-12-02 14:53:53,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-12-02 14:53:53,529 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:53:53,529 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 14:53:53,536 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8e72d21-4776-47fd-9959-19aa7adb9977/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-12-02 14:53:53,730 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8e72d21-4776-47fd-9959-19aa7adb9977/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 14:53:53,730 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 14:53:53,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:53:53,731 INFO L85 PathProgramCache]: Analyzing trace with hash -303813183, now seen corresponding path program 1 times [2024-12-02 14:53:53,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:53:53,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608551760] [2024-12-02 14:53:53,731 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:53:53,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:53:53,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:53:53,776 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:53:53,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:53:53,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608551760] [2024-12-02 14:53:53,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [608551760] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 14:53:53,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 14:53:53,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-02 14:53:53,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566016379] [2024-12-02 14:53:53,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 14:53:53,777 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 14:53:53,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:53:53,777 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 14:53:53,777 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 14:53:53,777 INFO L87 Difference]: Start difference. First operand 152030 states and 201954 transitions. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 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:53:54,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:53:54,387 INFO L93 Difference]: Finished difference Result 172883 states and 229283 transitions. [2024-12-02 14:53:54,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 14:53:54,388 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 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:53:54,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:53:54,539 INFO L225 Difference]: With dead ends: 172883 [2024-12-02 14:53:54,539 INFO L226 Difference]: Without dead ends: 146219 [2024-12-02 14:53:54,559 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:53:54,559 INFO L435 NwaCegarLoop]: 142 mSDtfsCounter, 52 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 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:53:54,560 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 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:53:54,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146219 states. [2024-12-02 14:53:55,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146219 to 146217. [2024-12-02 14:53:55,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146217 states, 146216 states have (on average 1.3107457460195875) internal successors, (191652), 146216 states have internal predecessors, (191652), 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:53:55,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146217 states to 146217 states and 191652 transitions. [2024-12-02 14:53:55,959 INFO L78 Accepts]: Start accepts. Automaton has 146217 states and 191652 transitions. Word has length 70 [2024-12-02 14:53:55,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:53:55,959 INFO L471 AbstractCegarLoop]: Abstraction has 146217 states and 191652 transitions. [2024-12-02 14:53:55,959 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 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:53:55,959 INFO L276 IsEmpty]: Start isEmpty. Operand 146217 states and 191652 transitions. [2024-12-02 14:53:55,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-12-02 14:53:55,962 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:53:55,963 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:53:55,963 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-12-02 14:53:55,963 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 14:53:55,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:53:55,963 INFO L85 PathProgramCache]: Analyzing trace with hash 30251444, now seen corresponding path program 1 times [2024-12-02 14:53:55,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:53:55,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370128414] [2024-12-02 14:53:55,963 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:53:55,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:53:55,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:53:55,993 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:53:55,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:53:55,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370128414] [2024-12-02 14:53:55,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370128414] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 14:53:55,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 14:53:55,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-02 14:53:55,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890539517] [2024-12-02 14:53:55,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 14:53:55,994 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 14:53:55,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:53:55,994 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 14:53:55,994 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 14:53:55,994 INFO L87 Difference]: Start difference. First operand 146217 states and 191652 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:53:56,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:53:56,707 INFO L93 Difference]: Finished difference Result 241011 states and 316204 transitions. [2024-12-02 14:53:56,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 14:53:56,707 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 70 [2024-12-02 14:53:56,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:53:56,812 INFO L225 Difference]: With dead ends: 241011 [2024-12-02 14:53:56,812 INFO L226 Difference]: Without dead ends: 95308 [2024-12-02 14:53:56,852 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:53:56,854 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 81 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 14:53:56,854 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 129 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 14:53:56,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95308 states. [2024-12-02 14:53:57,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95308 to 95308. [2024-12-02 14:53:57,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95308 states, 95307 states have (on average 1.2988133085712488) internal successors, (123786), 95307 states have internal predecessors, (123786), 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:53:58,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95308 states to 95308 states and 123786 transitions. [2024-12-02 14:53:58,062 INFO L78 Accepts]: Start accepts. Automaton has 95308 states and 123786 transitions. Word has length 70 [2024-12-02 14:53:58,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:53:58,062 INFO L471 AbstractCegarLoop]: Abstraction has 95308 states and 123786 transitions. [2024-12-02 14:53:58,062 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:53:58,062 INFO L276 IsEmpty]: Start isEmpty. Operand 95308 states and 123786 transitions. [2024-12-02 14:53:58,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-12-02 14:53:58,065 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:53:58,065 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:53:58,065 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-12-02 14:53:58,066 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 14:53:58,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:53:58,066 INFO L85 PathProgramCache]: Analyzing trace with hash -570785947, now seen corresponding path program 1 times [2024-12-02 14:53:58,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:53:58,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430677221] [2024-12-02 14:53:58,066 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:53:58,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:53:58,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:53:58,854 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:53:58,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:53:58,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430677221] [2024-12-02 14:53:58,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [430677221] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 14:53:58,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [643361606] [2024-12-02 14:53:58,854 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:53:58,854 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 14:53:58,854 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8e72d21-4776-47fd-9959-19aa7adb9977/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 14:53:58,856 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8e72d21-4776-47fd-9959-19aa7adb9977/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 14:53:58,858 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8e72d21-4776-47fd-9959-19aa7adb9977/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-12-02 14:53:58,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:53:58,989 INFO L256 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-12-02 14:53:58,992 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 14:54:02,864 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:54:02,864 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 14:54:04,421 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:54:04,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [643361606] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 14:54:04,421 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 14:54:04,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 20, 17] total 46 [2024-12-02 14:54:04,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297079696] [2024-12-02 14:54:04,422 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 14:54:04,422 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2024-12-02 14:54:04,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:54:04,422 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2024-12-02 14:54:04,423 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=219, Invalid=1851, Unknown=0, NotChecked=0, Total=2070 [2024-12-02 14:54:04,423 INFO L87 Difference]: Start difference. First operand 95308 states and 123786 transitions. Second operand has 46 states, 46 states have (on average 4.326086956521739) internal successors, (199), 46 states have internal predecessors, (199), 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:55:38,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:55:38,250 INFO L93 Difference]: Finished difference Result 800673 states and 1019411 transitions. [2024-12-02 14:55:38,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 604 states. [2024-12-02 14:55:38,250 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 4.326086956521739) internal successors, (199), 46 states have internal predecessors, (199), 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:55:38,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:55:38,987 INFO L225 Difference]: With dead ends: 800673 [2024-12-02 14:55:38,987 INFO L226 Difference]: Without dead ends: 754131 [2024-12-02 14:55:39,473 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 752 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 643 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190345 ImplicationChecksByTransitivity, 83.8s TimeCoverageRelationStatistics Valid=48310, Invalid=367070, Unknown=0, NotChecked=0, Total=415380 [2024-12-02 14:55:39,474 INFO L435 NwaCegarLoop]: 448 mSDtfsCounter, 10298 mSDsluCounter, 10430 mSDsCounter, 0 mSdLazyCounter, 8053 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10298 SdHoareTripleChecker+Valid, 10878 SdHoareTripleChecker+Invalid, 8151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 8053 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.2s IncrementalHoareTripleChecker+Time [2024-12-02 14:55:39,474 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10298 Valid, 10878 Invalid, 8151 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [98 Valid, 8053 Invalid, 0 Unknown, 0 Unchecked, 8.2s Time] [2024-12-02 14:55:39,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 754131 states. [2024-12-02 14:55:43,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 754131 to 183038. [2024-12-02 14:55:43,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183038 states, 183037 states have (on average 1.2946726618115463) internal successors, (236973), 183037 states have internal predecessors, (236973), 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:55:43,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183038 states to 183038 states and 236973 transitions. [2024-12-02 14:55:43,542 INFO L78 Accepts]: Start accepts. Automaton has 183038 states and 236973 transitions. Word has length 71 [2024-12-02 14:55:43,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:55:43,542 INFO L471 AbstractCegarLoop]: Abstraction has 183038 states and 236973 transitions. [2024-12-02 14:55:43,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 4.326086956521739) internal successors, (199), 46 states have internal predecessors, (199), 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:55:43,542 INFO L276 IsEmpty]: Start isEmpty. Operand 183038 states and 236973 transitions. [2024-12-02 14:55:43,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-12-02 14:55:43,546 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:55:43,546 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:55:43,553 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8e72d21-4776-47fd-9959-19aa7adb9977/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-12-02 14:55:43,747 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8e72d21-4776-47fd-9959-19aa7adb9977/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 14:55:43,747 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 14:55:43,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:55:43,750 INFO L85 PathProgramCache]: Analyzing trace with hash -2102592302, now seen corresponding path program 1 times [2024-12-02 14:55:43,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:55:43,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114784386] [2024-12-02 14:55:43,750 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:55:43,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:55:43,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:55:43,790 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:55:43,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:55:43,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114784386] [2024-12-02 14:55:43,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [114784386] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 14:55:43,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 14:55:43,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-02 14:55:43,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195190769] [2024-12-02 14:55:43,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 14:55:43,791 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 14:55:43,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:55:43,791 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 14:55:43,791 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 14:55:43,791 INFO L87 Difference]: Start difference. First operand 183038 states and 236973 transitions. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 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:55:44,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:55:44,746 INFO L93 Difference]: Finished difference Result 324629 states and 421046 transitions. [2024-12-02 14:55:44,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 14:55:44,746 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 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:55:44,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:55:44,922 INFO L225 Difference]: With dead ends: 324629 [2024-12-02 14:55:44,922 INFO L226 Difference]: Without dead ends: 147061 [2024-12-02 14:55:44,958 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:55:44,959 INFO L435 NwaCegarLoop]: 85 mSDtfsCounter, 70 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 121 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:55:44,959 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 121 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 14:55:45,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147061 states. [2024-12-02 14:55:46,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147061 to 145385. [2024-12-02 14:55:46,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145385 states, 145384 states have (on average 1.2779673141473615) internal successors, (185796), 145384 states have internal predecessors, (185796), 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:55:46,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145385 states to 145385 states and 185796 transitions. [2024-12-02 14:55:46,611 INFO L78 Accepts]: Start accepts. Automaton has 145385 states and 185796 transitions. Word has length 73 [2024-12-02 14:55:46,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:55:46,611 INFO L471 AbstractCegarLoop]: Abstraction has 145385 states and 185796 transitions. [2024-12-02 14:55:46,611 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 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:55:46,612 INFO L276 IsEmpty]: Start isEmpty. Operand 145385 states and 185796 transitions. [2024-12-02 14:55:46,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-12-02 14:55:46,619 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:55:46,619 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 14:55:46,619 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-12-02 14:55:46,619 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 14:55:46,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:55:46,619 INFO L85 PathProgramCache]: Analyzing trace with hash -1327010627, now seen corresponding path program 1 times [2024-12-02 14:55:46,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:55:46,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987597124] [2024-12-02 14:55:46,619 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:55:46,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:55:46,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:55:46,678 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-12-02 14:55:46,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:55:46,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987597124] [2024-12-02 14:55:46,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [987597124] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 14:55:46,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 14:55:46,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-02 14:55:46,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359696157] [2024-12-02 14:55:46,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 14:55:46,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 14:55:46,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:55:46,679 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 14:55:46,679 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 14:55:46,679 INFO L87 Difference]: Start difference. First operand 145385 states and 185796 transitions. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 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:55:47,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:55:47,549 INFO L93 Difference]: Finished difference Result 265000 states and 338843 transitions. [2024-12-02 14:55:47,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 14:55:47,549 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 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 93 [2024-12-02 14:55:47,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:55:47,656 INFO L225 Difference]: With dead ends: 265000 [2024-12-02 14:55:47,656 INFO L226 Difference]: Without dead ends: 119740 [2024-12-02 14:55:47,696 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:55:47,696 INFO L435 NwaCegarLoop]: 74 mSDtfsCounter, 60 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 14:55:47,696 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 93 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 14:55:47,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119740 states. [2024-12-02 14:55:48,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119740 to 119332. [2024-12-02 14:55:48,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119332 states, 119331 states have (on average 1.2625721731989172) internal successors, (150664), 119331 states have internal predecessors, (150664), 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:55:48,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119332 states to 119332 states and 150664 transitions. [2024-12-02 14:55:48,881 INFO L78 Accepts]: Start accepts. Automaton has 119332 states and 150664 transitions. Word has length 93 [2024-12-02 14:55:48,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:55:48,881 INFO L471 AbstractCegarLoop]: Abstraction has 119332 states and 150664 transitions. [2024-12-02 14:55:48,881 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 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:55:48,882 INFO L276 IsEmpty]: Start isEmpty. Operand 119332 states and 150664 transitions. [2024-12-02 14:55:48,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-12-02 14:55:48,894 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:55:48,894 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, 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] [2024-12-02 14:55:48,894 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-12-02 14:55:48,894 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 14:55:48,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:55:48,895 INFO L85 PathProgramCache]: Analyzing trace with hash -79757418, now seen corresponding path program 1 times [2024-12-02 14:55:48,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:55:48,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634504991] [2024-12-02 14:55:48,895 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:55:48,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:55:48,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:55:48,942 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2024-12-02 14:55:48,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:55:48,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634504991] [2024-12-02 14:55:48,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1634504991] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 14:55:48,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 14:55:48,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-02 14:55:48,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969979232] [2024-12-02 14:55:48,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 14:55:48,942 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 14:55:48,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:55:48,943 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 14:55:48,943 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 14:55:48,943 INFO L87 Difference]: Start difference. First operand 119332 states and 150664 transitions. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 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:55:49,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:55:49,223 INFO L93 Difference]: Finished difference Result 125645 states and 158295 transitions. [2024-12-02 14:55:49,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 14:55:49,224 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 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:55:49,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:55:49,327 INFO L225 Difference]: With dead ends: 125645 [2024-12-02 14:55:49,328 INFO L226 Difference]: Without dead ends: 99635 [2024-12-02 14:55:49,352 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:55:49,353 INFO L435 NwaCegarLoop]: 163 mSDtfsCounter, 38 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 245 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:55:49,353 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 245 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 14:55:49,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99635 states. [2024-12-02 14:55:50,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99635 to 97763. [2024-12-02 14:55:50,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97763 states, 97762 states have (on average 1.2323602217630572) internal successors, (120478), 97762 states have internal predecessors, (120478), 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:55:50,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97763 states to 97763 states and 120478 transitions. [2024-12-02 14:55:50,671 INFO L78 Accepts]: Start accepts. Automaton has 97763 states and 120478 transitions. Word has length 118 [2024-12-02 14:55:50,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:55:50,672 INFO L471 AbstractCegarLoop]: Abstraction has 97763 states and 120478 transitions. [2024-12-02 14:55:50,672 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 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:55:50,672 INFO L276 IsEmpty]: Start isEmpty. Operand 97763 states and 120478 transitions. [2024-12-02 14:55:50,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-12-02 14:55:50,682 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:55:50,682 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:50,682 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-12-02 14:55:50,682 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 14:55:50,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:55:50,683 INFO L85 PathProgramCache]: Analyzing trace with hash 997965718, now seen corresponding path program 1 times [2024-12-02 14:55:50,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:55:50,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577120607] [2024-12-02 14:55:50,683 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:55:50,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:55:50,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:55:51,770 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 13 proven. 75 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:55:51,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:55:51,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577120607] [2024-12-02 14:55:51,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1577120607] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 14:55:51,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1059801927] [2024-12-02 14:55:51,771 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:55:51,771 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 14:55:51,771 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8e72d21-4776-47fd-9959-19aa7adb9977/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 14:55:51,772 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8e72d21-4776-47fd-9959-19aa7adb9977/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 14:55:51,774 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8e72d21-4776-47fd-9959-19aa7adb9977/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-12-02 14:55:51,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:55:51,904 INFO L256 TraceCheckSpWp]: Trace formula consists of 473 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-12-02 14:55:51,906 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 14:55:52,538 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 25 proven. 63 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:55:52,539 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 14:55:53,890 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 23 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:55:53,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1059801927] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 14:55:53,890 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 14:55:53,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 11, 11] total 41 [2024-12-02 14:55:53,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556637551] [2024-12-02 14:55:53,890 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 14:55:53,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2024-12-02 14:55:53,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:55:53,891 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2024-12-02 14:55:53,891 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=1514, Unknown=0, NotChecked=0, Total=1640 [2024-12-02 14:55:53,891 INFO L87 Difference]: Start difference. First operand 97763 states and 120478 transitions. Second operand has 41 states, 41 states have (on average 8.170731707317072) internal successors, (335), 41 states have internal predecessors, (335), 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:56:44,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:56:44,660 INFO L93 Difference]: Finished difference Result 280302 states and 342316 transitions. [2024-12-02 14:56:44,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 607 states. [2024-12-02 14:56:44,661 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 8.170731707317072) internal successors, (335), 41 states have internal predecessors, (335), 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:56:44,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:56:44,851 INFO L225 Difference]: With dead ends: 280302 [2024-12-02 14:56:44,851 INFO L226 Difference]: Without dead ends: 223567 [2024-12-02 14:56:44,916 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 860 GetRequests, 216 SyntacticMatches, 0 SemanticMatches, 644 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188450 ImplicationChecksByTransitivity, 41.1s TimeCoverageRelationStatistics Valid=30966, Invalid=385704, Unknown=0, NotChecked=0, Total=416670 [2024-12-02 14:56:44,916 INFO L435 NwaCegarLoop]: 421 mSDtfsCounter, 16745 mSDsluCounter, 8682 mSDsCounter, 0 mSdLazyCounter, 14191 mSolverCounterSat, 535 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16745 SdHoareTripleChecker+Valid, 9103 SdHoareTripleChecker+Invalid, 14726 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 535 IncrementalHoareTripleChecker+Valid, 14191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.7s IncrementalHoareTripleChecker+Time [2024-12-02 14:56:44,917 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16745 Valid, 9103 Invalid, 14726 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [535 Valid, 14191 Invalid, 0 Unknown, 0 Unchecked, 8.7s Time] [2024-12-02 14:56:45,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223567 states. [2024-12-02 14:56:46,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223567 to 96615. [2024-12-02 14:56:46,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96615 states, 96614 states have (on average 1.21463763015712) internal successors, (117351), 96614 states have internal predecessors, (117351), 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:56:46,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96615 states to 96615 states and 117351 transitions. [2024-12-02 14:56:46,588 INFO L78 Accepts]: Start accepts. Automaton has 96615 states and 117351 transitions. Word has length 118 [2024-12-02 14:56:46,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:56:46,588 INFO L471 AbstractCegarLoop]: Abstraction has 96615 states and 117351 transitions. [2024-12-02 14:56:46,588 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 8.170731707317072) internal successors, (335), 41 states have internal predecessors, (335), 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:56:46,588 INFO L276 IsEmpty]: Start isEmpty. Operand 96615 states and 117351 transitions. [2024-12-02 14:56:46,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-12-02 14:56:46,599 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:56:46,599 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, 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:56:46,606 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8e72d21-4776-47fd-9959-19aa7adb9977/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-12-02 14:56:46,799 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8e72d21-4776-47fd-9959-19aa7adb9977/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2024-12-02 14:56:46,799 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 14:56:46,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:56:46,801 INFO L85 PathProgramCache]: Analyzing trace with hash -2001233707, now seen corresponding path program 1 times [2024-12-02 14:56:46,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:56:46,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127535532] [2024-12-02 14:56:46,801 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:56:46,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:56:46,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:56:46,868 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-12-02 14:56:46,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:56:46,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127535532] [2024-12-02 14:56:46,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2127535532] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 14:56:46,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 14:56:46,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-02 14:56:46,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666818780] [2024-12-02 14:56:46,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 14:56:46,869 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 14:56:46,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:56:46,869 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 14:56:46,869 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 14:56:46,869 INFO L87 Difference]: Start difference. First operand 96615 states and 117351 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 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:56:47,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:56:47,221 INFO L93 Difference]: Finished difference Result 180989 states and 219567 transitions. [2024-12-02 14:56:47,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 14:56:47,221 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 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:56:47,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:56:47,314 INFO L225 Difference]: With dead ends: 180989 [2024-12-02 14:56:47,314 INFO L226 Difference]: Without dead ends: 85157 [2024-12-02 14:56:47,350 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:56:47,351 INFO L435 NwaCegarLoop]: 121 mSDtfsCounter, 43 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 205 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:56:47,351 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 205 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 14:56:47,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85157 states. [2024-12-02 14:56:47,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85157 to 82479. [2024-12-02 14:56:47,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82479 states, 82478 states have (on average 1.1881471422682413) internal successors, (97996), 82478 states have internal predecessors, (97996), 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:56:48,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82479 states to 82479 states and 97996 transitions. [2024-12-02 14:56:48,002 INFO L78 Accepts]: Start accepts. Automaton has 82479 states and 97996 transitions. Word has length 119 [2024-12-02 14:56:48,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:56:48,002 INFO L471 AbstractCegarLoop]: Abstraction has 82479 states and 97996 transitions. [2024-12-02 14:56:48,002 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 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:56:48,002 INFO L276 IsEmpty]: Start isEmpty. Operand 82479 states and 97996 transitions. [2024-12-02 14:56:48,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-12-02 14:56:48,007 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:56:48,007 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] [2024-12-02 14:56:48,007 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-12-02 14:56:48,007 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 14:56:48,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:56:48,007 INFO L85 PathProgramCache]: Analyzing trace with hash 1217470896, now seen corresponding path program 1 times [2024-12-02 14:56:48,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:56:48,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80941317] [2024-12-02 14:56:48,007 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:56:48,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:56:48,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:56:48,412 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 34 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:56:48,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:56:48,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80941317] [2024-12-02 14:56:48,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [80941317] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 14:56:48,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [123023047] [2024-12-02 14:56:48,412 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:56:48,413 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 14:56:48,413 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8e72d21-4776-47fd-9959-19aa7adb9977/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 14:56:48,414 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8e72d21-4776-47fd-9959-19aa7adb9977/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 14:56:48,415 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8e72d21-4776-47fd-9959-19aa7adb9977/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-12-02 14:56:48,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:56:48,534 INFO L256 TraceCheckSpWp]: Trace formula consists of 472 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-12-02 14:56:48,536 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 14:56:49,491 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 29 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:56:49,491 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 14:56:50,644 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 42 proven. 47 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:56:50,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [123023047] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 14:56:50,644 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 14:56:50,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 15, 14] total 38 [2024-12-02 14:56:50,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204183629] [2024-12-02 14:56:50,644 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 14:56:50,645 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2024-12-02 14:56:50,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:56:50,645 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2024-12-02 14:56:50,645 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=1286, Unknown=0, NotChecked=0, Total=1406 [2024-12-02 14:56:50,645 INFO L87 Difference]: Start difference. First operand 82479 states and 97996 transitions. Second operand has 38 states, 38 states have (on average 8.789473684210526) internal successors, (334), 38 states have internal predecessors, (334), 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:57:11,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:57:11,224 INFO L93 Difference]: Finished difference Result 229852 states and 271426 transitions. [2024-12-02 14:57:11,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 249 states. [2024-12-02 14:57:11,224 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 8.789473684210526) internal successors, (334), 38 states have internal predecessors, (334), 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:57:11,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:57:11,376 INFO L225 Difference]: With dead ends: 229852 [2024-12-02 14:57:11,376 INFO L226 Difference]: Without dead ends: 186366 [2024-12-02 14:57:11,415 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 525 GetRequests, 242 SyntacticMatches, 0 SemanticMatches, 283 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31280 ImplicationChecksByTransitivity, 17.2s TimeCoverageRelationStatistics Valid=10812, Invalid=70128, Unknown=0, NotChecked=0, Total=80940 [2024-12-02 14:57:11,416 INFO L435 NwaCegarLoop]: 224 mSDtfsCounter, 3459 mSDsluCounter, 4076 mSDsCounter, 0 mSdLazyCounter, 5303 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3459 SdHoareTripleChecker+Valid, 4300 SdHoareTripleChecker+Invalid, 5413 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 5303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-12-02 14:57:11,416 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3459 Valid, 4300 Invalid, 5413 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 5303 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-12-02 14:57:11,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186366 states. [2024-12-02 14:57:12,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186366 to 103116. [2024-12-02 14:57:12,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103116 states, 103115 states have (on average 1.1835814382000678) internal successors, (122045), 103115 states have internal predecessors, (122045), 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:57:12,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103116 states to 103116 states and 122045 transitions. [2024-12-02 14:57:12,542 INFO L78 Accepts]: Start accepts. Automaton has 103116 states and 122045 transitions. Word has length 119 [2024-12-02 14:57:12,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:57:12,542 INFO L471 AbstractCegarLoop]: Abstraction has 103116 states and 122045 transitions. [2024-12-02 14:57:12,543 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 8.789473684210526) internal successors, (334), 38 states have internal predecessors, (334), 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:57:12,543 INFO L276 IsEmpty]: Start isEmpty. Operand 103116 states and 122045 transitions. [2024-12-02 14:57:12,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-12-02 14:57:12,548 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:57:12,548 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:12,555 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8e72d21-4776-47fd-9959-19aa7adb9977/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-12-02 14:57:12,748 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8e72d21-4776-47fd-9959-19aa7adb9977/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2024-12-02 14:57:12,749 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 14:57:12,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:57:12,749 INFO L85 PathProgramCache]: Analyzing trace with hash 557579646, now seen corresponding path program 1 times [2024-12-02 14:57:12,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:57:12,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672379616] [2024-12-02 14:57:12,749 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:57:12,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:57:12,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:57:13,498 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 13 proven. 75 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:57:13,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:57:13,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672379616] [2024-12-02 14:57:13,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [672379616] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 14:57:13,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [274584764] [2024-12-02 14:57:13,498 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:57:13,498 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 14:57:13,498 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8e72d21-4776-47fd-9959-19aa7adb9977/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 14:57:13,500 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8e72d21-4776-47fd-9959-19aa7adb9977/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 14:57:13,501 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8e72d21-4776-47fd-9959-19aa7adb9977/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-12-02 14:57:13,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:57:13,645 INFO L256 TraceCheckSpWp]: Trace formula consists of 472 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-12-02 14:57:13,648 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 14:57:14,736 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 30 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:57:14,736 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 14:57:15,741 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 41 proven. 47 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:57:15,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [274584764] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 14:57:15,742 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 14:57:15,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 15, 14] total 43 [2024-12-02 14:57:15,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887709013] [2024-12-02 14:57:15,742 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 14:57:15,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2024-12-02 14:57:15,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:57:15,743 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2024-12-02 14:57:15,744 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=1659, Unknown=0, NotChecked=0, Total=1806 [2024-12-02 14:57:15,744 INFO L87 Difference]: Start difference. First operand 103116 states and 122045 transitions. Second operand has 43 states, 43 states have (on average 7.534883720930233) internal successors, (324), 43 states have internal predecessors, (324), 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:57:30,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:57:30,519 INFO L93 Difference]: Finished difference Result 263580 states and 310308 transitions. [2024-12-02 14:57:30,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 234 states. [2024-12-02 14:57:30,519 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 7.534883720930233) internal successors, (324), 43 states have internal predecessors, (324), 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:57:30,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:57:30,694 INFO L225 Difference]: With dead ends: 263580 [2024-12-02 14:57:30,694 INFO L226 Difference]: Without dead ends: 208464 [2024-12-02 14:57:30,736 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 500 GetRequests, 239 SyntacticMatches, 0 SemanticMatches, 261 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24601 ImplicationChecksByTransitivity, 10.9s TimeCoverageRelationStatistics Valid=5701, Invalid=63205, Unknown=0, NotChecked=0, Total=68906 [2024-12-02 14:57:30,736 INFO L435 NwaCegarLoop]: 682 mSDtfsCounter, 2356 mSDsluCounter, 19031 mSDsCounter, 0 mSdLazyCounter, 8043 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2356 SdHoareTripleChecker+Valid, 19713 SdHoareTripleChecker+Invalid, 8066 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 8043 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2024-12-02 14:57:30,737 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2356 Valid, 19713 Invalid, 8066 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [23 Valid, 8043 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2024-12-02 14:57:30,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208464 states. [2024-12-02 14:57:31,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208464 to 121000. [2024-12-02 14:57:31,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121000 states, 120999 states have (on average 1.182927131629187) internal successors, (143133), 120999 states have internal predecessors, (143133), 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:57:31,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121000 states to 121000 states and 143133 transitions. [2024-12-02 14:57:31,992 INFO L78 Accepts]: Start accepts. Automaton has 121000 states and 143133 transitions. Word has length 119 [2024-12-02 14:57:31,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:57:31,992 INFO L471 AbstractCegarLoop]: Abstraction has 121000 states and 143133 transitions. [2024-12-02 14:57:31,992 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 7.534883720930233) internal successors, (324), 43 states have internal predecessors, (324), 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:57:31,992 INFO L276 IsEmpty]: Start isEmpty. Operand 121000 states and 143133 transitions. [2024-12-02 14:57:31,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-12-02 14:57:31,999 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:57:31,999 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, 1, 1, 1, 1, 1, 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:57:32,006 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8e72d21-4776-47fd-9959-19aa7adb9977/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-12-02 14:57:32,200 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8e72d21-4776-47fd-9959-19aa7adb9977/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 14:57:32,200 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 14:57:32,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:57:32,200 INFO L85 PathProgramCache]: Analyzing trace with hash 473781221, now seen corresponding path program 1 times [2024-12-02 14:57:32,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:57:32,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410539072] [2024-12-02 14:57:32,200 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:57:32,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:57:32,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:57:32,708 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:57:32,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:57:32,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410539072] [2024-12-02 14:57:32,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [410539072] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 14:57:32,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1538204210] [2024-12-02 14:57:32,709 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:57:32,709 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 14:57:32,709 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8e72d21-4776-47fd-9959-19aa7adb9977/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 14:57:32,710 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8e72d21-4776-47fd-9959-19aa7adb9977/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 14:57:32,711 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8e72d21-4776-47fd-9959-19aa7adb9977/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-12-02 14:57:32,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:57:32,832 INFO L256 TraceCheckSpWp]: Trace formula consists of 476 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-12-02 14:57:32,833 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 14:57:34,532 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:57:34,532 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 14:57:36,881 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:57:36,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1538204210] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 14:57:36,881 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 14:57:36,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 18] total 47 [2024-12-02 14:57:36,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682969030] [2024-12-02 14:57:36,881 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 14:57:36,881 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2024-12-02 14:57:36,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:57:36,881 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2024-12-02 14:57:36,882 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=176, Invalid=1986, Unknown=0, NotChecked=0, Total=2162 [2024-12-02 14:57:36,882 INFO L87 Difference]: Start difference. First operand 121000 states and 143133 transitions. Second operand has 47 states, 47 states have (on average 6.914893617021277) internal successors, (325), 47 states have internal predecessors, (325), 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:57:41,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:57:41,444 INFO L93 Difference]: Finished difference Result 200638 states and 237119 transitions. [2024-12-02 14:57:41,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2024-12-02 14:57:41,445 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 47 states have (on average 6.914893617021277) internal successors, (325), 47 states have internal predecessors, (325), 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:57:41,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:57:41,575 INFO L225 Difference]: With dead ends: 200638 [2024-12-02 14:57:41,575 INFO L226 Difference]: Without dead ends: 144622 [2024-12-02 14:57:41,615 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 306 GetRequests, 210 SyntacticMatches, 1 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2363 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=1104, Invalid=8208, Unknown=0, NotChecked=0, Total=9312 [2024-12-02 14:57:41,615 INFO L435 NwaCegarLoop]: 611 mSDtfsCounter, 1098 mSDsluCounter, 13370 mSDsCounter, 0 mSdLazyCounter, 2996 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1098 SdHoareTripleChecker+Valid, 13981 SdHoareTripleChecker+Invalid, 3014 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 2996 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-12-02 14:57:41,616 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1098 Valid, 13981 Invalid, 3014 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 2996 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-12-02 14:57:41,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144622 states. [2024-12-02 14:57:42,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144622 to 127162. [2024-12-02 14:57:42,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127162 states, 127161 states have (on average 1.180141710115523) internal successors, (150068), 127161 states have internal predecessors, (150068), 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:57:42,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127162 states to 127162 states and 150068 transitions. [2024-12-02 14:57:42,698 INFO L78 Accepts]: Start accepts. Automaton has 127162 states and 150068 transitions. Word has length 120 [2024-12-02 14:57:42,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:57:42,698 INFO L471 AbstractCegarLoop]: Abstraction has 127162 states and 150068 transitions. [2024-12-02 14:57:42,698 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 47 states have (on average 6.914893617021277) internal successors, (325), 47 states have internal predecessors, (325), 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:57:42,698 INFO L276 IsEmpty]: Start isEmpty. Operand 127162 states and 150068 transitions. [2024-12-02 14:57:42,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-12-02 14:57:42,706 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:57:42,706 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, 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] [2024-12-02 14:57:42,713 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8e72d21-4776-47fd-9959-19aa7adb9977/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-12-02 14:57:42,907 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8e72d21-4776-47fd-9959-19aa7adb9977/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2024-12-02 14:57:42,907 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 14:57:42,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:57:42,907 INFO L85 PathProgramCache]: Analyzing trace with hash 307672798, now seen corresponding path program 1 times [2024-12-02 14:57:42,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:57:42,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811367471] [2024-12-02 14:57:42,907 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:57:42,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:57:42,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:57:42,967 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-12-02 14:57:42,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:57:42,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811367471] [2024-12-02 14:57:42,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1811367471] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 14:57:42,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 14:57:42,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-02 14:57:42,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206266357] [2024-12-02 14:57:42,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 14:57:42,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 14:57:42,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:57:42,969 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 14:57:42,969 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 14:57:42,969 INFO L87 Difference]: Start difference. First operand 127162 states and 150068 transitions. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 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:57:43,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:57:43,225 INFO L93 Difference]: Finished difference Result 170087 states and 200699 transitions. [2024-12-02 14:57:43,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 14:57:43,226 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 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:57:43,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:57:43,259 INFO L225 Difference]: With dead ends: 170087 [2024-12-02 14:57:43,259 INFO L226 Difference]: Without dead ends: 43681 [2024-12-02 14:57:43,289 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:57:43,290 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 31 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 186 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:57:43,290 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 186 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 14:57:43,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43681 states. [2024-12-02 14:57:43,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43681 to 42692. [2024-12-02 14:57:43,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42692 states, 42691 states have (on average 1.1530767609097936) internal successors, (49226), 42691 states have internal predecessors, (49226), 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:57:43,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42692 states to 42692 states and 49226 transitions. [2024-12-02 14:57:43,608 INFO L78 Accepts]: Start accepts. Automaton has 42692 states and 49226 transitions. Word has length 120 [2024-12-02 14:57:43,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:57:43,608 INFO L471 AbstractCegarLoop]: Abstraction has 42692 states and 49226 transitions. [2024-12-02 14:57:43,608 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 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:57:43,608 INFO L276 IsEmpty]: Start isEmpty. Operand 42692 states and 49226 transitions. [2024-12-02 14:57:43,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-12-02 14:57:43,611 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:57:43,611 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] [2024-12-02 14:57:43,611 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-12-02 14:57:43,611 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 14:57:43,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:57:43,611 INFO L85 PathProgramCache]: Analyzing trace with hash -1300564359, now seen corresponding path program 1 times [2024-12-02 14:57:43,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:57:43,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796608692] [2024-12-02 14:57:43,612 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:57:43,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:57:43,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:57:43,791 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 35 proven. 19 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-12-02 14:57:43,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:57:43,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796608692] [2024-12-02 14:57:43,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796608692] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 14:57:43,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [560676736] [2024-12-02 14:57:43,792 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:57:43,792 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 14:57:43,792 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8e72d21-4776-47fd-9959-19aa7adb9977/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 14:57:43,793 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8e72d21-4776-47fd-9959-19aa7adb9977/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 14:57:43,794 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8e72d21-4776-47fd-9959-19aa7adb9977/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-12-02 14:57:43,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:57:43,918 INFO L256 TraceCheckSpWp]: Trace formula consists of 471 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-12-02 14:57:43,919 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 14:57:45,368 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 29 proven. 61 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:57:45,368 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 14:57:46,398 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 42 proven. 48 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:57:46,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [560676736] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 14:57:46,398 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 14:57:46,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 17, 16] total 39 [2024-12-02 14:57:46,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103717156] [2024-12-02 14:57:46,398 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 14:57:46,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2024-12-02 14:57:46,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:57:46,399 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2024-12-02 14:57:46,399 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=1331, Unknown=0, NotChecked=0, Total=1482 [2024-12-02 14:57:46,400 INFO L87 Difference]: Start difference. First operand 42692 states and 49226 transitions. Second operand has 39 states, 39 states have (on average 8.23076923076923) internal successors, (321), 39 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:57:53,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:57:53,587 INFO L93 Difference]: Finished difference Result 87577 states and 101202 transitions. [2024-12-02 14:57:53,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 120 states. [2024-12-02 14:57:53,588 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 8.23076923076923) internal successors, (321), 39 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 120 [2024-12-02 14:57:53,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:57:53,633 INFO L225 Difference]: With dead ends: 87577 [2024-12-02 14:57:53,633 INFO L226 Difference]: Without dead ends: 58748 [2024-12-02 14:57:53,650 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 388 GetRequests, 233 SyntacticMatches, 0 SemanticMatches, 155 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7940 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=3428, Invalid=21064, Unknown=0, NotChecked=0, Total=24492 [2024-12-02 14:57:53,650 INFO L435 NwaCegarLoop]: 161 mSDtfsCounter, 3510 mSDsluCounter, 2925 mSDsCounter, 0 mSdLazyCounter, 3580 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3510 SdHoareTripleChecker+Valid, 3086 SdHoareTripleChecker+Invalid, 3660 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 3580 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-12-02 14:57:53,650 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3510 Valid, 3086 Invalid, 3660 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 3580 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-12-02 14:57:53,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58748 states. [2024-12-02 14:57:53,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58748 to 41050. [2024-12-02 14:57:54,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41050 states, 41049 states have (on average 1.1515018636263976) internal successors, (47268), 41049 states have internal predecessors, (47268), 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:57:54,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41050 states to 41050 states and 47268 transitions. [2024-12-02 14:57:54,044 INFO L78 Accepts]: Start accepts. Automaton has 41050 states and 47268 transitions. Word has length 120 [2024-12-02 14:57:54,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:57:54,044 INFO L471 AbstractCegarLoop]: Abstraction has 41050 states and 47268 transitions. [2024-12-02 14:57:54,044 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 8.23076923076923) internal successors, (321), 39 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:57:54,044 INFO L276 IsEmpty]: Start isEmpty. Operand 41050 states and 47268 transitions. [2024-12-02 14:57:54,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-12-02 14:57:54,047 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:57:54,047 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, 1, 1, 1, 1, 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:57:54,054 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8e72d21-4776-47fd-9959-19aa7adb9977/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-12-02 14:57:54,247 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8e72d21-4776-47fd-9959-19aa7adb9977/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2024-12-02 14:57:54,247 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 14:57:54,248 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:57:54,248 INFO L85 PathProgramCache]: Analyzing trace with hash -261518820, now seen corresponding path program 1 times [2024-12-02 14:57:54,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:57:54,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583558718] [2024-12-02 14:57:54,248 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:57:54,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:57:54,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:57:54,953 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 23 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:57:54,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:57:54,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583558718] [2024-12-02 14:57:54,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [583558718] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 14:57:54,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [931965905] [2024-12-02 14:57:54,953 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:57:54,954 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 14:57:54,954 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8e72d21-4776-47fd-9959-19aa7adb9977/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 14:57:54,955 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8e72d21-4776-47fd-9959-19aa7adb9977/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 14:57:54,956 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8e72d21-4776-47fd-9959-19aa7adb9977/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-12-02 14:57:55,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:57:55,092 INFO L256 TraceCheckSpWp]: Trace formula consists of 475 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-12-02 14:57:55,094 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 14:57:57,213 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 23 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:57:57,213 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 14:57:59,347 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 23 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:57:59,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [931965905] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 14:57:59,347 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 14:57:59,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 20, 19] total 56 [2024-12-02 14:57:59,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744595645] [2024-12-02 14:57:59,348 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 14:57:59,348 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2024-12-02 14:57:59,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:57:59,348 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2024-12-02 14:57:59,349 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=2887, Unknown=0, NotChecked=0, Total=3080 [2024-12-02 14:57:59,349 INFO L87 Difference]: Start difference. First operand 41050 states and 47268 transitions. Second operand has 56 states, 56 states have (on average 5.946428571428571) internal successors, (333), 56 states have internal predecessors, (333), 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:58:08,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:58:08,790 INFO L93 Difference]: Finished difference Result 68623 states and 79315 transitions. [2024-12-02 14:58:08,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2024-12-02 14:58:08,791 INFO L78 Accepts]: Start accepts. Automaton has has 56 states, 56 states have (on average 5.946428571428571) internal successors, (333), 56 states have internal predecessors, (333), 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 121 [2024-12-02 14:58:08,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:58:08,821 INFO L225 Difference]: With dead ends: 68623 [2024-12-02 14:58:08,821 INFO L226 Difference]: Without dead ends: 48918 [2024-12-02 14:58:08,834 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 334 GetRequests, 208 SyntacticMatches, 1 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3397 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=1927, Invalid=14075, Unknown=0, NotChecked=0, Total=16002 [2024-12-02 14:58:08,834 INFO L435 NwaCegarLoop]: 327 mSDtfsCounter, 3005 mSDsluCounter, 7149 mSDsCounter, 0 mSdLazyCounter, 3725 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3005 SdHoareTripleChecker+Valid, 7476 SdHoareTripleChecker+Invalid, 3776 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 3725 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-12-02 14:58:08,834 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3005 Valid, 7476 Invalid, 3776 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 3725 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-12-02 14:58:08,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48918 states. [2024-12-02 14:58:09,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48918 to 39081. [2024-12-02 14:58:09,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39081 states, 39080 states have (on average 1.1523285568065507) internal successors, (45033), 39080 states have internal predecessors, (45033), 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:58:09,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39081 states to 39081 states and 45033 transitions. [2024-12-02 14:58:09,135 INFO L78 Accepts]: Start accepts. Automaton has 39081 states and 45033 transitions. Word has length 121 [2024-12-02 14:58:09,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:58:09,135 INFO L471 AbstractCegarLoop]: Abstraction has 39081 states and 45033 transitions. [2024-12-02 14:58:09,135 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 56 states have (on average 5.946428571428571) internal successors, (333), 56 states have internal predecessors, (333), 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:58:09,135 INFO L276 IsEmpty]: Start isEmpty. Operand 39081 states and 45033 transitions. [2024-12-02 14:58:09,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-12-02 14:58:09,138 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:58:09,138 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, 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:58:09,144 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8e72d21-4776-47fd-9959-19aa7adb9977/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-12-02 14:58:09,339 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8e72d21-4776-47fd-9959-19aa7adb9977/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2024-12-02 14:58:09,339 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 14:58:09,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:58:09,339 INFO L85 PathProgramCache]: Analyzing trace with hash -2110870819, now seen corresponding path program 1 times [2024-12-02 14:58:09,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:58:09,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062752698] [2024-12-02 14:58:09,339 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:58:09,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:58:09,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:58:09,654 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 128 proven. 32 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2024-12-02 14:58:09,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:58:09,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062752698] [2024-12-02 14:58:09,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062752698] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 14:58:09,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [360377546] [2024-12-02 14:58:09,654 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:58:09,654 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 14:58:09,655 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8e72d21-4776-47fd-9959-19aa7adb9977/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 14:58:09,656 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8e72d21-4776-47fd-9959-19aa7adb9977/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 14:58:09,657 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8e72d21-4776-47fd-9959-19aa7adb9977/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-12-02 14:58:09,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:58:09,816 INFO L256 TraceCheckSpWp]: Trace formula consists of 572 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-12-02 14:58:09,818 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 14:58:10,887 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 160 proven. 27 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-12-02 14:58:10,887 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 14:58:11,825 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 86 proven. 101 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-12-02 14:58:11,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [360377546] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 14:58:11,825 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 14:58:11,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 16, 15] total 34 [2024-12-02 14:58:11,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360104894] [2024-12-02 14:58:11,825 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 14:58:11,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2024-12-02 14:58:11,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:58:11,826 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-12-02 14:58:11,826 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=241, Invalid=881, Unknown=0, NotChecked=0, Total=1122 [2024-12-02 14:58:11,826 INFO L87 Difference]: Start difference. First operand 39081 states and 45033 transitions. Second operand has 34 states, 34 states have (on average 7.529411764705882) internal successors, (256), 34 states have internal predecessors, (256), 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:58:12,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:58:12,828 INFO L93 Difference]: Finished difference Result 56197 states and 64824 transitions. [2024-12-02 14:58:12,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-12-02 14:58:12,829 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 7.529411764705882) internal successors, (256), 34 states have internal predecessors, (256), 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 139 [2024-12-02 14:58:12,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:58:12,857 INFO L225 Difference]: With dead ends: 56197 [2024-12-02 14:58:12,857 INFO L226 Difference]: Without dead ends: 45447 [2024-12-02 14:58:12,867 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 309 GetRequests, 256 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 603 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=708, Invalid=2262, Unknown=0, NotChecked=0, Total=2970 [2024-12-02 14:58:12,868 INFO L435 NwaCegarLoop]: 157 mSDtfsCounter, 1450 mSDsluCounter, 1931 mSDsCounter, 0 mSdLazyCounter, 887 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1450 SdHoareTripleChecker+Valid, 2088 SdHoareTripleChecker+Invalid, 906 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 887 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-12-02 14:58:12,868 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1450 Valid, 2088 Invalid, 906 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 887 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-12-02 14:58:12,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45447 states. [2024-12-02 14:58:13,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45447 to 42974. [2024-12-02 14:58:13,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42974 states, 42973 states have (on average 1.1490005352197892) internal successors, (49376), 42973 states have internal predecessors, (49376), 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:58:13,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42974 states to 42974 states and 49376 transitions. [2024-12-02 14:58:13,175 INFO L78 Accepts]: Start accepts. Automaton has 42974 states and 49376 transitions. Word has length 139 [2024-12-02 14:58:13,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:58:13,176 INFO L471 AbstractCegarLoop]: Abstraction has 42974 states and 49376 transitions. [2024-12-02 14:58:13,176 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 7.529411764705882) internal successors, (256), 34 states have internal predecessors, (256), 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:58:13,176 INFO L276 IsEmpty]: Start isEmpty. Operand 42974 states and 49376 transitions. [2024-12-02 14:58:13,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-12-02 14:58:13,179 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:58:13,179 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, 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:58:13,186 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8e72d21-4776-47fd-9959-19aa7adb9977/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2024-12-02 14:58:13,379 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8e72d21-4776-47fd-9959-19aa7adb9977/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2024-12-02 14:58:13,379 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 14:58:13,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:58:13,379 INFO L85 PathProgramCache]: Analyzing trace with hash 1265176327, now seen corresponding path program 1 times [2024-12-02 14:58:13,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:58:13,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668806784] [2024-12-02 14:58:13,380 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:58:13,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:58:13,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-02 14:58:13,411 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-12-02 14:58:13,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-02 14:58:13,478 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-12-02 14:58:13,479 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-12-02 14:58:13,479 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-12-02 14:58:13,481 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-12-02 14:58:13,483 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 14:58:13,577 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-12-02 14:58:13,580 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 02:58:13 BoogieIcfgContainer [2024-12-02 14:58:13,580 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-12-02 14:58:13,581 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-12-02 14:58:13,581 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-12-02 14:58:13,581 INFO L274 PluginConnector]: Witness Printer initialized [2024-12-02 14:58:13,582 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 02:53:01" (3/4) ... [2024-12-02 14:58:13,583 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2024-12-02 14:58:13,705 INFO L129 tionWitnessGenerator]: Generated YAML witness of length 92. [2024-12-02 14:58:13,785 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8e72d21-4776-47fd-9959-19aa7adb9977/bin/uautomizer-verify-84ZbGMXZE1/witness.graphml [2024-12-02 14:58:13,785 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8e72d21-4776-47fd-9959-19aa7adb9977/bin/uautomizer-verify-84ZbGMXZE1/witness.yml [2024-12-02 14:58:13,785 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-12-02 14:58:13,786 INFO L158 Benchmark]: Toolchain (without parser) took 312961.48ms. Allocated memory was 117.4MB in the beginning and 10.6GB in the end (delta: 10.5GB). Free memory was 92.9MB in the beginning and 3.1GB in the end (delta: -3.0GB). Peak memory consumption was 7.5GB. Max. memory is 16.1GB. [2024-12-02 14:58:13,786 INFO L158 Benchmark]: CDTParser took 0.33ms. Allocated memory is still 117.4MB. Free memory is still 73.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-12-02 14:58:13,786 INFO L158 Benchmark]: CACSL2BoogieTranslator took 239.44ms. Allocated memory is still 117.4MB. Free memory was 92.6MB in the beginning and 78.0MB in the end (delta: 14.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-12-02 14:58:13,787 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.04ms. Allocated memory is still 117.4MB. Free memory was 77.7MB in the beginning and 75.6MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-12-02 14:58:13,787 INFO L158 Benchmark]: Boogie Preprocessor took 43.29ms. Allocated memory is still 117.4MB. Free memory was 75.6MB in the beginning and 73.5MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-12-02 14:58:13,787 INFO L158 Benchmark]: RCFGBuilder took 519.31ms. Allocated memory is still 117.4MB. Free memory was 73.3MB in the beginning and 48.7MB in the end (delta: 24.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-12-02 14:58:13,787 INFO L158 Benchmark]: TraceAbstraction took 311917.79ms. Allocated memory was 117.4MB in the beginning and 10.6GB in the end (delta: 10.5GB). Free memory was 48.2MB in the beginning and 3.2GB in the end (delta: -3.1GB). Peak memory consumption was 7.4GB. Max. memory is 16.1GB. [2024-12-02 14:58:13,787 INFO L158 Benchmark]: Witness Printer took 204.63ms. Allocated memory is still 10.6GB. Free memory was 3.2GB in the beginning and 3.1GB in the end (delta: 29.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-12-02 14:58:13,788 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.33ms. Allocated memory is still 117.4MB. Free memory is still 73.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 239.44ms. Allocated memory is still 117.4MB. Free memory was 92.6MB in the beginning and 78.0MB in the end (delta: 14.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 32.04ms. Allocated memory is still 117.4MB. Free memory was 77.7MB in the beginning and 75.6MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 43.29ms. Allocated memory is still 117.4MB. Free memory was 75.6MB in the beginning and 73.5MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 519.31ms. Allocated memory is still 117.4MB. Free memory was 73.3MB in the beginning and 48.7MB in the end (delta: 24.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 311917.79ms. Allocated memory was 117.4MB in the beginning and 10.6GB in the end (delta: 10.5GB). Free memory was 48.2MB in the beginning and 3.2GB in the end (delta: -3.1GB). Peak memory consumption was 7.4GB. Max. memory is 16.1GB. * Witness Printer took 204.63ms. Allocated memory is still 10.6GB. Free memory was 3.2GB in the beginning and 3.1GB in the end (delta: 29.4MB). Peak memory consumption was 25.2MB. 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: 212]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L10] int __return_main; [L25] msg_t nomsg = (msg_t )-1; [L26] char r1 = '\x0'; [L27] port_t p1 = 0; [L28] char p1_old = '\x0'; [L29] char p1_new = '\x0'; [L30] char id1 = '\x0'; [L31] char st1 = '\x0'; [L32] msg_t send1 = '\x0'; [L33] _Bool mode1 = 0; [L34] _Bool alive1 = 0; [L35] port_t p2 = 0; [L36] char p2_old = '\x0'; [L37] char p2_new = '\x0'; [L38] char id2 = '\x0'; [L39] char st2 = '\x0'; [L40] msg_t send2 = '\x0'; [L41] _Bool mode2 = 0; [L42] _Bool alive2 = 0; [L43] port_t p3 = 0; [L44] char p3_old = '\x0'; [L45] char p3_new = '\x0'; [L46] char id3 = '\x0'; [L47] char st3 = '\x0'; [L48] msg_t send3 = '\x0'; [L49] _Bool mode3 = 0; [L50] _Bool alive3 = 0; [L54] void (*nodes[3])() = { &node1, &node2, &node3 }; [L58] int __return_6067; [L59] int __return_6163; [L60] int __return_6228; VAL [__return_6067=0, __return_6163=0, __return_6228=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_char() [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_6067=0, __return_6163=0, __return_6228=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] [L84] COND TRUE ((int)r1) == 0 VAL [__return_6067=0, __return_6163=0, __return_6228=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_6067=0, __return_6163=0, __return_6228=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_6067=0, __return_6163=0, __return_6228=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_6067=0, __return_6163=0, __return_6228=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_6067=0, __return_6163=0, __return_6228=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_6067=0, __return_6163=0, __return_6228=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_6067=0, __return_6163=0, __return_6228=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_6067=0, __return_6163=0, __return_6228=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_6067=0, __return_6163=0, __return_6228=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_6067=0, __return_6163=0, __return_6228=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_6067=0, __return_6163=0, __return_6228=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_6067=0, __return_6163=0, __return_6228=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_6067=0, __return_6163=0, __return_6228=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_6067=0, __return_6163=0, __return_6228=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_6067=0, __return_6163=0, __return_6228=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_6067=0, __return_6163=0, __return_6228=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_6067 = init__tmp [L120] main__i2 = __return_6067 VAL [__return_6067=1, __return_6163=0, __return_6228=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_6067=1, __return_6163=0, __return_6228=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, main__i2=0, 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] [L131] COND TRUE main__i2 < 6 [L134] msg_t node1__m1; [L135] node1__m1 = nomsg VAL [__return_6067=1, __return_6163=0, __return_6228=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, main__i2=0, 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] [L136] COND FALSE !(!(mode1 == 0)) VAL [__return_6067=1, __return_6163=0, __return_6228=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, main__i2=0, 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] [L442] COND FALSE !(!(alive1 == 0)) VAL [__return_6067=1, __return_6163=0, __return_6228=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, main__i2=0, 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] [L453] mode1 = 1 VAL [__return_6067=1, __return_6163=0, __return_6228=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, main__i2=0, 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] [L153] msg_t node2__m2; [L154] node2__m2 = nomsg VAL [__return_6067=1, __return_6163=0, __return_6228=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, main__i2=0, 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] COND FALSE !(!(mode2 == 0)) VAL [__return_6067=1, __return_6163=0, __return_6228=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, main__i2=0, 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_6067=1, __return_6163=0, __return_6228=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, main__i2=0, 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_6067=1, __return_6163=0, __return_6228=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, main__i2=0, 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_6067=1, __return_6163=0, __return_6228=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, main__i2=0, 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] [L171] msg_t node3__m3; [L172] node3__m3 = nomsg VAL [__return_6067=1, __return_6163=0, __return_6228=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, main__i2=0, 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] COND FALSE !(!(mode3 == 0)) VAL [__return_6067=1, __return_6163=0, __return_6228=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, main__i2=0, 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_6067=1, __return_6163=0, __return_6228=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, main__i2=0, 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_6067=1, __return_6163=0, __return_6228=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, main__i2=0, 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_6067=1, __return_6163=0, __return_6228=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, main__i2=0, 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_6067=1, __return_6163=0, __return_6228=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, main__i2=0, 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_6067=1, __return_6163=0, __return_6228=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, main__i2=0, 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] [L188] p1_old = p1_new [L189] p1_new = nomsg [L190] p2_old = p2_new [L191] p2_new = nomsg [L192] p3_old = p3_new [L193] p3_new = nomsg [L195] int check__tmp; VAL [__return_6067=1, __return_6163=0, __return_6228=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, main__i2=0, 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] [L196] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) <= 1 VAL [__return_6067=1, __return_6163=0, __return_6228=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, main__i2=0, 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)r1) < 3 [L200] check__tmp = 1 VAL [__return_6067=1, __return_6163=0, __return_6228=0, __return_main=0, alive1=0, alive2=0, alive3=1, check__tmp=1, id1=0, id2=1, id3=127, main__i2=0, 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] [L203] __return_6163 = check__tmp [L204] main__c1 = __return_6163 [L206] _Bool __tmp_1; [L207] __tmp_1 = main__c1 [L208] _Bool assert__arg; [L209] assert__arg = __tmp_1 VAL [__return_6067=1, __return_6163=1, __return_6228=0, __return_main=0, alive1=0, alive2=0, alive3=1, assert__arg=1, id1=0, id2=1, id3=127, main__i2=0, 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] [L210] COND FALSE !(assert__arg == 0) [L217] int main____CPAchecker_TMP_0 = main__i2; [L218] main__i2 = main__i2 + 1 VAL [__return_6067=1, __return_6163=1, __return_6228=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, main__i2=1, 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] [L131] COND TRUE main__i2 < 6 [L134] msg_t node1__m1; [L135] node1__m1 = nomsg VAL [__return_6067=1, __return_6163=1, __return_6228=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, main__i2=1, 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 TRUE !(mode1 == 0) [L138] r1 = (char)(((int)r1) + 1) [L139] node1__m1 = p3_old [L140] p3_old = nomsg VAL [__return_6067=1, __return_6163=1, __return_6228=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, main__i2=1, 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] [L141] COND TRUE ((int)node1__m1) != ((int)nomsg) VAL [__return_6067=1, __return_6163=1, __return_6228=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, main__i2=1, 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 FALSE !(!(alive1 == 0)) [L431] send1 = node1__m1 VAL [__return_6067=1, __return_6163=1, __return_6228=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, main__i2=1, 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] [L150] mode1 = 0 VAL [__return_6067=1, __return_6163=1, __return_6228=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, main__i2=1, 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] [L153] msg_t node2__m2; [L154] node2__m2 = nomsg VAL [__return_6067=1, __return_6163=1, __return_6228=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, main__i2=1, 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] COND TRUE !(mode2 == 0) [L157] node2__m2 = p1_old [L158] p1_old = nomsg VAL [__return_6067=1, __return_6163=1, __return_6228=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, main__i2=1, 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] [L159] COND FALSE !(((int)node2__m2) != ((int)nomsg)) VAL [__return_6067=1, __return_6163=1, __return_6228=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, main__i2=1, 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] [L168] mode2 = 0 VAL [__return_6067=1, __return_6163=1, __return_6228=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, main__i2=1, 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] [L171] msg_t node3__m3; [L172] node3__m3 = nomsg VAL [__return_6067=1, __return_6163=1, __return_6228=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, main__i2=1, 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] COND TRUE !(mode3 == 0) [L175] node3__m3 = p2_old [L176] p2_old = nomsg VAL [__return_6067=1, __return_6163=1, __return_6228=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, main__i2=1, 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] [L177] COND FALSE !(((int)node3__m3) != ((int)nomsg)) VAL [__return_6067=1, __return_6163=1, __return_6228=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, main__i2=1, 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] [L186] mode3 = 0 VAL [__return_6067=1, __return_6163=1, __return_6228=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=-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] p1_old = p1_new [L189] p1_new = nomsg [L190] p2_old = p2_new [L191] p2_new = nomsg [L192] p3_old = p3_new [L193] p3_new = nomsg [L195] int check__tmp; VAL [__return_6067=1, __return_6163=1, __return_6228=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=-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] [L196] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) <= 1 VAL [__return_6067=1, __return_6163=1, __return_6228=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=-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)r1) < 3 [L200] check__tmp = 1 VAL [__return_6067=1, __return_6163=1, __return_6228=0, __return_main=0, alive1=0, alive2=0, alive3=1, check__tmp=1, id1=0, id2=1, id3=127, main__i2=1, 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] [L203] __return_6163 = check__tmp [L204] main__c1 = __return_6163 [L206] _Bool __tmp_1; [L207] __tmp_1 = main__c1 [L208] _Bool assert__arg; [L209] assert__arg = __tmp_1 VAL [__return_6067=1, __return_6163=1, __return_6228=0, __return_main=0, alive1=0, alive2=0, alive3=1, assert__arg=1, id1=0, id2=1, id3=127, main__i2=1, 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] [L210] COND FALSE !(assert__arg == 0) [L217] int main____CPAchecker_TMP_0 = main__i2; [L218] main__i2 = main__i2 + 1 VAL [__return_6067=1, __return_6163=1, __return_6228=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, main__i2=2, 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] [L131] COND TRUE main__i2 < 6 [L134] msg_t node1__m1; [L135] node1__m1 = nomsg VAL [__return_6067=1, __return_6163=1, __return_6228=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, main__i2=2, 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] [L136] COND FALSE !(!(mode1 == 0)) VAL [__return_6067=1, __return_6163=1, __return_6228=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, main__i2=2, 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] [L442] COND FALSE !(!(alive1 == 0)) VAL [__return_6067=1, __return_6163=1, __return_6228=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, main__i2=2, 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] [L453] mode1 = 1 VAL [__return_6067=1, __return_6163=1, __return_6228=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, main__i2=2, 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] [L153] msg_t node2__m2; [L154] node2__m2 = nomsg VAL [__return_6067=1, __return_6163=1, __return_6228=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, main__i2=2, 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] COND FALSE !(!(mode2 == 0)) VAL [__return_6067=1, __return_6163=1, __return_6228=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, main__i2=2, 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_6067=1, __return_6163=1, __return_6228=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, main__i2=2, 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_6067=1, __return_6163=1, __return_6228=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, main__i2=2, 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_6067=1, __return_6163=1, __return_6228=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, main__i2=2, 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] [L171] msg_t node3__m3; [L172] node3__m3 = nomsg VAL [__return_6067=1, __return_6163=1, __return_6228=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, main__i2=2, 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] COND FALSE !(!(mode3 == 0)) VAL [__return_6067=1, __return_6163=1, __return_6228=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, main__i2=2, 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_6067=1, __return_6163=1, __return_6228=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, main__i2=2, 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_6067=1, __return_6163=1, __return_6228=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, main__i2=2, 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_6067=1, __return_6163=1, __return_6228=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, main__i2=2, 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_6067=1, __return_6163=1, __return_6228=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, main__i2=2, 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_6067=1, __return_6163=1, __return_6228=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, main__i2=2, 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] [L188] p1_old = p1_new [L189] p1_new = nomsg [L190] p2_old = p2_new [L191] p2_new = nomsg [L192] p3_old = p3_new [L193] p3_new = nomsg [L195] int check__tmp; VAL [__return_6067=1, __return_6163=1, __return_6228=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, main__i2=2, 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] [L196] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) <= 1 VAL [__return_6067=1, __return_6163=1, __return_6228=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, main__i2=2, 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)r1) < 3 [L200] check__tmp = 1 VAL [__return_6067=1, __return_6163=1, __return_6228=0, __return_main=0, alive1=0, alive2=0, alive3=1, check__tmp=1, id1=0, id2=1, id3=127, main__i2=2, 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] [L203] __return_6163 = check__tmp [L204] main__c1 = __return_6163 [L206] _Bool __tmp_1; [L207] __tmp_1 = main__c1 [L208] _Bool assert__arg; [L209] assert__arg = __tmp_1 VAL [__return_6067=1, __return_6163=1, __return_6228=0, __return_main=0, alive1=0, alive2=0, alive3=1, assert__arg=1, id1=0, id2=1, id3=127, main__i2=2, 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] [L210] COND FALSE !(assert__arg == 0) [L217] int main____CPAchecker_TMP_0 = main__i2; [L218] main__i2 = main__i2 + 1 VAL [__return_6067=1, __return_6163=1, __return_6228=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, main__i2=3, 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] [L131] COND TRUE main__i2 < 6 [L134] msg_t node1__m1; [L135] node1__m1 = nomsg VAL [__return_6067=1, __return_6163=1, __return_6228=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, main__i2=3, 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 TRUE !(mode1 == 0) [L138] r1 = (char)(((int)r1) + 1) [L139] node1__m1 = p3_old [L140] p3_old = nomsg VAL [__return_6067=1, __return_6163=1, __return_6228=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, main__i2=3, 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] [L141] COND TRUE ((int)node1__m1) != ((int)nomsg) VAL [__return_6067=1, __return_6163=1, __return_6228=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, main__i2=3, 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 FALSE !(!(alive1 == 0)) [L431] send1 = node1__m1 VAL [__return_6067=1, __return_6163=1, __return_6228=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, main__i2=3, 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] [L150] mode1 = 0 VAL [__return_6067=1, __return_6163=1, __return_6228=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, main__i2=3, 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] [L153] msg_t node2__m2; [L154] node2__m2 = nomsg VAL [__return_6067=1, __return_6163=1, __return_6228=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, main__i2=3, 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] COND TRUE !(mode2 == 0) [L157] node2__m2 = p1_old [L158] p1_old = nomsg VAL [__return_6067=1, __return_6163=1, __return_6228=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, main__i2=3, 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] [L159] COND FALSE !(((int)node2__m2) != ((int)nomsg)) VAL [__return_6067=1, __return_6163=1, __return_6228=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, main__i2=3, 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] [L168] mode2 = 0 VAL [__return_6067=1, __return_6163=1, __return_6228=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, main__i2=3, 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] [L171] msg_t node3__m3; [L172] node3__m3 = nomsg VAL [__return_6067=1, __return_6163=1, __return_6228=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, main__i2=3, 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] COND TRUE !(mode3 == 0) [L175] node3__m3 = p2_old [L176] p2_old = nomsg VAL [__return_6067=1, __return_6163=1, __return_6228=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, main__i2=3, 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] [L177] COND FALSE !(((int)node3__m3) != ((int)nomsg)) VAL [__return_6067=1, __return_6163=1, __return_6228=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, main__i2=3, 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] [L186] mode3 = 0 VAL [__return_6067=1, __return_6163=1, __return_6228=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, main__i2=3, 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] [L188] p1_old = p1_new [L189] p1_new = nomsg [L190] p2_old = p2_new [L191] p2_new = nomsg [L192] p3_old = p3_new [L193] p3_new = nomsg [L195] int check__tmp; VAL [__return_6067=1, __return_6163=1, __return_6228=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, main__i2=3, 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] [L196] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) <= 1 VAL [__return_6067=1, __return_6163=1, __return_6228=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, main__i2=3, 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)r1) < 3 [L200] check__tmp = 1 VAL [__return_6067=1, __return_6163=1, __return_6228=0, __return_main=0, alive1=0, alive2=0, alive3=1, check__tmp=1, id1=0, id2=1, id3=127, main__i2=3, 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] [L203] __return_6163 = check__tmp [L204] main__c1 = __return_6163 [L206] _Bool __tmp_1; [L207] __tmp_1 = main__c1 [L208] _Bool assert__arg; [L209] assert__arg = __tmp_1 VAL [__return_6067=1, __return_6163=1, __return_6228=0, __return_main=0, alive1=0, alive2=0, alive3=1, assert__arg=1, id1=0, id2=1, id3=127, main__i2=3, 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] [L210] COND FALSE !(assert__arg == 0) [L217] int main____CPAchecker_TMP_0 = main__i2; [L218] main__i2 = main__i2 + 1 VAL [__return_6067=1, __return_6163=1, __return_6228=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, main__i2=4, 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] [L131] COND TRUE main__i2 < 6 [L134] msg_t node1__m1; [L135] node1__m1 = nomsg VAL [__return_6067=1, __return_6163=1, __return_6228=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, main__i2=4, 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] [L136] COND FALSE !(!(mode1 == 0)) VAL [__return_6067=1, __return_6163=1, __return_6228=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, main__i2=4, 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] [L442] COND FALSE !(!(alive1 == 0)) VAL [__return_6067=1, __return_6163=1, __return_6228=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, main__i2=4, 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] [L453] mode1 = 1 VAL [__return_6067=1, __return_6163=1, __return_6228=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, main__i2=4, 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] [L153] msg_t node2__m2; [L154] node2__m2 = nomsg VAL [__return_6067=1, __return_6163=1, __return_6228=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, main__i2=4, 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] COND FALSE !(!(mode2 == 0)) VAL [__return_6067=1, __return_6163=1, __return_6228=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, main__i2=4, 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_6067=1, __return_6163=1, __return_6228=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, main__i2=4, 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_6067=1, __return_6163=1, __return_6228=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, main__i2=4, 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_6067=1, __return_6163=1, __return_6228=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, main__i2=4, 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] [L171] msg_t node3__m3; [L172] node3__m3 = nomsg VAL [__return_6067=1, __return_6163=1, __return_6228=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, main__i2=4, 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] COND FALSE !(!(mode3 == 0)) VAL [__return_6067=1, __return_6163=1, __return_6228=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, main__i2=4, 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_6067=1, __return_6163=1, __return_6228=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, main__i2=4, 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_6067=1, __return_6163=1, __return_6228=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, main__i2=4, 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_6067=1, __return_6163=1, __return_6228=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, main__i2=4, 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_6067=1, __return_6163=1, __return_6228=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, main__i2=4, 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_6067=1, __return_6163=1, __return_6228=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, main__i2=4, 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] [L188] p1_old = p1_new [L189] p1_new = nomsg [L190] p2_old = p2_new [L191] p2_new = nomsg [L192] p3_old = p3_new [L193] p3_new = nomsg [L195] int check__tmp; VAL [__return_6067=1, __return_6163=1, __return_6228=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, main__i2=4, 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] [L196] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) <= 1 VAL [__return_6067=1, __return_6163=1, __return_6228=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, main__i2=4, 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)r1) < 3 [L200] check__tmp = 1 VAL [__return_6067=1, __return_6163=1, __return_6228=0, __return_main=0, alive1=0, alive2=0, alive3=1, check__tmp=1, id1=0, id2=1, id3=127, main__i2=4, 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] [L203] __return_6163 = check__tmp [L204] main__c1 = __return_6163 [L206] _Bool __tmp_1; [L207] __tmp_1 = main__c1 [L208] _Bool assert__arg; [L209] assert__arg = __tmp_1 VAL [__return_6067=1, __return_6163=1, __return_6228=0, __return_main=0, alive1=0, alive2=0, alive3=1, assert__arg=1, id1=0, id2=1, id3=127, main__i2=4, 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] [L210] COND FALSE !(assert__arg == 0) [L217] int main____CPAchecker_TMP_0 = main__i2; [L218] main__i2 = main__i2 + 1 VAL [__return_6067=1, __return_6163=1, __return_6228=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, main__i2=5, 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] [L131] COND TRUE main__i2 < 6 [L134] msg_t node1__m1; [L135] node1__m1 = nomsg VAL [__return_6067=1, __return_6163=1, __return_6228=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, main__i2=5, 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 TRUE !(mode1 == 0) [L138] r1 = (char)(((int)r1) + 1) [L139] node1__m1 = p3_old [L140] p3_old = nomsg VAL [__return_6067=1, __return_6163=1, __return_6228=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, main__i2=5, 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] [L141] COND TRUE ((int)node1__m1) != ((int)nomsg) VAL [__return_6067=1, __return_6163=1, __return_6228=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, main__i2=5, 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 FALSE !(!(alive1 == 0)) [L431] send1 = node1__m1 VAL [__return_6067=1, __return_6163=1, __return_6228=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, main__i2=5, 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] [L150] mode1 = 0 VAL [__return_6067=1, __return_6163=1, __return_6228=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, main__i2=5, 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] [L153] msg_t node2__m2; [L154] node2__m2 = nomsg VAL [__return_6067=1, __return_6163=1, __return_6228=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, main__i2=5, 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] COND TRUE !(mode2 == 0) [L157] node2__m2 = p1_old [L158] p1_old = nomsg VAL [__return_6067=1, __return_6163=1, __return_6228=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, main__i2=5, 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] [L159] COND FALSE !(((int)node2__m2) != ((int)nomsg)) VAL [__return_6067=1, __return_6163=1, __return_6228=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, main__i2=5, 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] [L168] mode2 = 0 VAL [__return_6067=1, __return_6163=1, __return_6228=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, main__i2=5, 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] [L171] msg_t node3__m3; [L172] node3__m3 = nomsg VAL [__return_6067=1, __return_6163=1, __return_6228=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, main__i2=5, 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] COND TRUE !(mode3 == 0) [L175] node3__m3 = p2_old [L176] p2_old = nomsg VAL [__return_6067=1, __return_6163=1, __return_6228=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, main__i2=5, 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] [L177] COND FALSE !(((int)node3__m3) != ((int)nomsg)) VAL [__return_6067=1, __return_6163=1, __return_6228=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, main__i2=5, 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] [L186] mode3 = 0 VAL [__return_6067=1, __return_6163=1, __return_6228=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, main__i2=5, 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] [L188] p1_old = p1_new [L189] p1_new = nomsg [L190] p2_old = p2_new [L191] p2_new = nomsg [L192] p3_old = p3_new [L193] p3_new = nomsg [L195] int check__tmp; VAL [__return_6067=1, __return_6163=1, __return_6228=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, main__i2=5, 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] [L196] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) <= 1 VAL [__return_6067=1, __return_6163=1, __return_6228=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, main__i2=5, 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 FALSE !(((int)r1) < 3) VAL [__return_6067=1, __return_6163=1, __return_6228=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, main__i2=5, 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_6067=1, __return_6163=1, __return_6228=0, __return_main=0, alive1=0, alive2=0, alive3=1, check__tmp=0, id1=0, id2=1, id3=127, main__i2=5, 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] [L203] __return_6163 = check__tmp [L204] main__c1 = __return_6163 [L206] _Bool __tmp_1; [L207] __tmp_1 = main__c1 [L208] _Bool assert__arg; [L209] assert__arg = __tmp_1 VAL [__return_6067=1, __return_6163=0, __return_6228=0, __return_main=0, alive1=0, alive2=0, alive3=1, assert__arg=0, id1=0, id2=1, id3=127, main__i2=5, 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] [L210] COND TRUE assert__arg == 0 VAL [__return_6067=1, __return_6163=0, __return_6228=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, main__i2=5, 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] reach_error() VAL [__return_6067=1, __return_6163=0, __return_6228=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, main__i2=5, 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, 80 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 311.8s, OverallIterations: 36, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.2s, AutomataDifference: 243.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 64249 SdHoareTripleChecker+Valid, 36.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 64249 mSDsluCounter, 82801 SdHoareTripleChecker+Invalid, 32.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 76220 mSDsCounter, 1462 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 53500 IncrementalHoareTripleChecker+Invalid, 54962 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1462 mSolverCounterUnsat, 6581 mSDtfsCounter, 53500 mSolverCounterSat, 0.4s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 5264 GetRequests, 2355 SyntacticMatches, 17 SemanticMatches, 2892 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 577078 ImplicationChecksByTransitivity, 195.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=183038occurred in iteration=23, InterpolantAutomatonStates: 2584, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 27.1s AutomataMinimizationTime, 35 MinimizatonAttempts, 1481620 StatesRemovedByMinimization, 33 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 35.2s InterpolantComputationTime, 4071 NumberOfCodeBlocks, 4071 NumberOfCodeBlocksAsserted, 49 NumberOfCheckSat, 5127 ConstructedInterpolants, 61 QuantifiedInterpolants, 61177 SizeOfPredicates, 57 NumberOfNonLiveVariables, 5344 ConjunctsInSsa, 270 ConjunctsInUnsatCore, 61 InterpolantComputations, 22 PerfectInterpolantSequences, 1536/2863 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:58:13,828 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8e72d21-4776-47fd-9959-19aa7adb9977/bin/uautomizer-verify-84ZbGMXZE1/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE