./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+nlh-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_deece62d-eb9a-4fa9-9dff-416e8fe1102f/bin/uautomizer-verify-84ZbGMXZE1/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_deece62d-eb9a-4fa9-9dff-416e8fe1102f/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_deece62d-eb9a-4fa9-9dff-416e8fe1102f/bin/uautomizer-verify-84ZbGMXZE1/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_deece62d-eb9a-4fa9-9dff-416e8fe1102f/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+nlh-reducer.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_deece62d-eb9a-4fa9-9dff-416e8fe1102f/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_deece62d-eb9a-4fa9-9dff-416e8fe1102f/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 2f774b3e755d7b6f786f7d23823d008ce09be620750647481355094233fd1ac8 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-12-02 14:38:52,269 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-12-02 14:38:52,325 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_deece62d-eb9a-4fa9-9dff-416e8fe1102f/bin/uautomizer-verify-84ZbGMXZE1/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-12-02 14:38:52,331 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-12-02 14:38:52,331 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-12-02 14:38:52,353 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-12-02 14:38:52,353 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-12-02 14:38:52,353 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-12-02 14:38:52,354 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-12-02 14:38:52,354 INFO L153 SettingsManager]: * Use memory slicer=true [2024-12-02 14:38:52,354 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-12-02 14:38:52,354 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-12-02 14:38:52,354 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-12-02 14:38:52,354 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-12-02 14:38:52,355 INFO L153 SettingsManager]: * Use SBE=true [2024-12-02 14:38:52,355 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-12-02 14:38:52,355 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-12-02 14:38:52,355 INFO L153 SettingsManager]: * sizeof long=4 [2024-12-02 14:38:52,355 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-12-02 14:38:52,355 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-12-02 14:38:52,355 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-12-02 14:38:52,355 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-12-02 14:38:52,355 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-12-02 14:38:52,355 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-12-02 14:38:52,356 INFO L153 SettingsManager]: * sizeof long double=12 [2024-12-02 14:38:52,356 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-12-02 14:38:52,356 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-12-02 14:38:52,356 INFO L153 SettingsManager]: * Use constant arrays=true [2024-12-02 14:38:52,356 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-12-02 14:38:52,356 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-12-02 14:38:52,356 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-12-02 14:38:52,356 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-12-02 14:38:52,356 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-12-02 14:38:52,356 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-12-02 14:38:52,356 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-12-02 14:38:52,357 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-12-02 14:38:52,357 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-12-02 14:38:52,357 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-12-02 14:38:52,357 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-12-02 14:38:52,357 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-12-02 14:38:52,357 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-12-02 14:38:52,357 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-12-02 14:38:52,357 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-12-02 14:38:52,357 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-12-02 14:38:52,357 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-12-02 14:38:52,357 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-12-02 14:38:52,357 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-12-02 14:38:52,358 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-12-02 14:38:52,358 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_deece62d-eb9a-4fa9-9dff-416e8fe1102f/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 -> 2f774b3e755d7b6f786f7d23823d008ce09be620750647481355094233fd1ac8 [2024-12-02 14:38:52,582 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-12-02 14:38:52,589 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-12-02 14:38:52,591 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-12-02 14:38:52,592 INFO L270 PluginConnector]: Initializing CDTParser... [2024-12-02 14:38:52,592 INFO L274 PluginConnector]: CDTParser initialized [2024-12-02 14:38:52,593 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_deece62d-eb9a-4fa9-9dff-416e8fe1102f/bin/uautomizer-verify-84ZbGMXZE1/../../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2024-12-02 14:38:55,193 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_deece62d-eb9a-4fa9-9dff-416e8fe1102f/bin/uautomizer-verify-84ZbGMXZE1/data/93b2820bd/8906557b681f4c6a9f102bbd006acc79/FLAGa9f8dd2f2 [2024-12-02 14:38:55,415 INFO L384 CDTParser]: Found 1 translation units. [2024-12-02 14:38:55,416 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_deece62d-eb9a-4fa9-9dff-416e8fe1102f/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2024-12-02 14:38:55,425 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_deece62d-eb9a-4fa9-9dff-416e8fe1102f/bin/uautomizer-verify-84ZbGMXZE1/data/93b2820bd/8906557b681f4c6a9f102bbd006acc79/FLAGa9f8dd2f2 [2024-12-02 14:38:55,773 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_deece62d-eb9a-4fa9-9dff-416e8fe1102f/bin/uautomizer-verify-84ZbGMXZE1/data/93b2820bd/8906557b681f4c6a9f102bbd006acc79 [2024-12-02 14:38:55,775 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-12-02 14:38:55,776 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-12-02 14:38:55,777 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-12-02 14:38:55,777 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-12-02 14:38:55,781 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-12-02 14:38:55,782 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 02:38:55" (1/1) ... [2024-12-02 14:38:55,782 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@38b07512 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:38:55, skipping insertion in model container [2024-12-02 14:38:55,783 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 02:38:55" (1/1) ... [2024-12-02 14:38:55,809 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-12-02 14:38:55,984 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_deece62d-eb9a-4fa9-9dff-416e8fe1102f/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c[7471,7484] [2024-12-02 14:38:56,016 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-02 14:38:56,027 INFO L200 MainTranslator]: Completed pre-run [2024-12-02 14:38:56,069 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_deece62d-eb9a-4fa9-9dff-416e8fe1102f/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c[7471,7484] [2024-12-02 14:38:56,090 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-02 14:38:56,106 INFO L204 MainTranslator]: Completed translation [2024-12-02 14:38:56,107 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:38:56 WrapperNode [2024-12-02 14:38:56,107 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-12-02 14:38:56,108 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-12-02 14:38:56,108 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-12-02 14:38:56,108 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-12-02 14:38:56,114 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:38:56" (1/1) ... [2024-12-02 14:38:56,125 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:38:56" (1/1) ... [2024-12-02 14:38:56,146 INFO L138 Inliner]: procedures = 22, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 626 [2024-12-02 14:38:56,146 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-12-02 14:38:56,147 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-12-02 14:38:56,147 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-12-02 14:38:56,147 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-12-02 14:38:56,153 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:38:56" (1/1) ... [2024-12-02 14:38:56,153 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:38:56" (1/1) ... [2024-12-02 14:38:56,155 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:38:56" (1/1) ... [2024-12-02 14:38:56,170 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:38:56,170 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:38:56" (1/1) ... [2024-12-02 14:38:56,170 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:38:56" (1/1) ... [2024-12-02 14:38:56,179 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:38:56" (1/1) ... [2024-12-02 14:38:56,180 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:38:56" (1/1) ... [2024-12-02 14:38:56,185 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:38:56" (1/1) ... [2024-12-02 14:38:56,187 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:38:56" (1/1) ... [2024-12-02 14:38:56,188 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:38:56" (1/1) ... [2024-12-02 14:38:56,191 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-12-02 14:38:56,192 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-12-02 14:38:56,192 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-12-02 14:38:56,192 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-12-02 14:38:56,193 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:38:56" (1/1) ... [2024-12-02 14:38:56,198 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-12-02 14:38:56,209 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_deece62d-eb9a-4fa9-9dff-416e8fe1102f/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 14:38:56,221 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_deece62d-eb9a-4fa9-9dff-416e8fe1102f/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:38:56,224 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_deece62d-eb9a-4fa9-9dff-416e8fe1102f/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:38:56,246 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-12-02 14:38:56,247 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-12-02 14:38:56,247 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-12-02 14:38:56,247 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-12-02 14:38:56,340 INFO L234 CfgBuilder]: Building ICFG [2024-12-02 14:38:56,341 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-12-02 14:38:56,845 INFO L? ?]: Removed 86 outVars from TransFormulas that were not future-live. [2024-12-02 14:38:56,845 INFO L283 CfgBuilder]: Performing block encoding [2024-12-02 14:38:56,856 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-12-02 14:38:56,857 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2024-12-02 14:38:56,857 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 02:38:56 BoogieIcfgContainer [2024-12-02 14:38:56,857 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-12-02 14:38:56,859 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-12-02 14:38:56,859 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-12-02 14:38:56,862 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-12-02 14:38:56,862 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 02:38:55" (1/3) ... [2024-12-02 14:38:56,863 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68fd5ce0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 02:38:56, skipping insertion in model container [2024-12-02 14:38:56,863 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:38:56" (2/3) ... [2024-12-02 14:38:56,863 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68fd5ce0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 02:38:56, skipping insertion in model container [2024-12-02 14:38:56,863 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 02:38:56" (3/3) ... [2024-12-02 14:38:56,865 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2024-12-02 14:38:56,875 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-12-02 14:38:56,877 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c that has 1 procedures, 148 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2024-12-02 14:38:56,920 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-12-02 14:38:56,929 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;@fbf8eb5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-02 14:38:56,929 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-12-02 14:38:56,933 INFO L276 IsEmpty]: Start isEmpty. Operand has 148 states, 146 states have (on average 1.7123287671232876) internal successors, (250), 147 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:38:56,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-12-02 14:38:56,938 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:38:56,939 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, 1, 1, 1, 1, 1, 1] [2024-12-02 14:38:56,939 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 14:38:56,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:38:56,943 INFO L85 PathProgramCache]: Analyzing trace with hash 1935961454, now seen corresponding path program 1 times [2024-12-02 14:38:56,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:38:56,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578721269] [2024-12-02 14:38:56,948 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:38:56,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:38:57,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:38:57,332 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:38:57,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:38:57,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578721269] [2024-12-02 14:38:57,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [578721269] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 14:38:57,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 14:38:57,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-12-02 14:38:57,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387397233] [2024-12-02 14:38:57,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 14:38:57,338 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-02 14:38:57,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:38:57,354 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-02 14:38:57,354 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-12-02 14:38:57,356 INFO L87 Difference]: Start difference. First operand has 148 states, 146 states have (on average 1.7123287671232876) internal successors, (250), 147 states have internal predecessors, (250), 0 states have call successors, (0), 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 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:38:57,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:38:57,521 INFO L93 Difference]: Finished difference Result 468 states and 757 transitions. [2024-12-02 14:38:57,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-02 14:38:57,523 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 0 states have call successors, (0), 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 49 [2024-12-02 14:38:57,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:38:57,533 INFO L225 Difference]: With dead ends: 468 [2024-12-02 14:38:57,533 INFO L226 Difference]: Without dead ends: 394 [2024-12-02 14:38:57,536 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:38:57,538 INFO L435 NwaCegarLoop]: 301 mSDtfsCounter, 829 mSDsluCounter, 566 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 829 SdHoareTripleChecker+Valid, 867 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-12-02 14:38:57,539 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [829 Valid, 867 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-12-02 14:38:57,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2024-12-02 14:38:57,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 232. [2024-12-02 14:38:57,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 231 states have (on average 1.4891774891774892) internal successors, (344), 231 states have internal predecessors, (344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:38:57,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 344 transitions. [2024-12-02 14:38:57,582 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 344 transitions. Word has length 49 [2024-12-02 14:38:57,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:38:57,583 INFO L471 AbstractCegarLoop]: Abstraction has 232 states and 344 transitions. [2024-12-02 14:38:57,583 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:38:57,583 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 344 transitions. [2024-12-02 14:38:57,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-12-02 14:38:57,585 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:38:57,585 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 14:38:57,585 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-12-02 14:38:57,586 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 14:38:57,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:38:57,586 INFO L85 PathProgramCache]: Analyzing trace with hash 1118200662, now seen corresponding path program 1 times [2024-12-02 14:38:57,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:38:57,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867838425] [2024-12-02 14:38:57,586 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:38:57,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:38:57,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:38:57,698 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:38:57,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:38:57,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867838425] [2024-12-02 14:38:57,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1867838425] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 14:38:57,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 14:38:57,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-02 14:38:57,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261949216] [2024-12-02 14:38:57,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 14:38:57,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 14:38:57,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:38:57,700 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 14:38:57,700 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 14:38:57,701 INFO L87 Difference]: Start difference. First operand 232 states and 344 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:38:57,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:38:57,739 INFO L93 Difference]: Finished difference Result 570 states and 864 transitions. [2024-12-02 14:38:57,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 14:38:57,740 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 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 52 [2024-12-02 14:38:57,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:38:57,742 INFO L225 Difference]: With dead ends: 570 [2024-12-02 14:38:57,742 INFO L226 Difference]: Without dead ends: 402 [2024-12-02 14:38:57,743 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:38:57,744 INFO L435 NwaCegarLoop]: 206 mSDtfsCounter, 141 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 390 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 14:38:57,744 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 390 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 14:38:57,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2024-12-02 14:38:57,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 400. [2024-12-02 14:38:57,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 400 states, 399 states have (on average 1.4912280701754386) internal successors, (595), 399 states have internal predecessors, (595), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:38:57,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 595 transitions. [2024-12-02 14:38:57,761 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 595 transitions. Word has length 52 [2024-12-02 14:38:57,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:38:57,762 INFO L471 AbstractCegarLoop]: Abstraction has 400 states and 595 transitions. [2024-12-02 14:38:57,762 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:38:57,762 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 595 transitions. [2024-12-02 14:38:57,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-12-02 14:38:57,763 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:38:57,763 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 14:38:57,763 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-12-02 14:38:57,764 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 14:38:57,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:38:57,764 INFO L85 PathProgramCache]: Analyzing trace with hash -1570903849, now seen corresponding path program 1 times [2024-12-02 14:38:57,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:38:57,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706159559] [2024-12-02 14:38:57,764 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:38:57,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:38:57,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:38:57,849 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:38:57,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:38:57,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706159559] [2024-12-02 14:38:57,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1706159559] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 14:38:57,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 14:38:57,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-02 14:38:57,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760019230] [2024-12-02 14:38:57,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 14:38:57,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 14:38:57,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:38:57,850 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 14:38:57,850 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 14:38:57,851 INFO L87 Difference]: Start difference. First operand 400 states and 595 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:38:57,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:38:57,886 INFO L93 Difference]: Finished difference Result 980 states and 1475 transitions. [2024-12-02 14:38:57,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 14:38:57,886 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 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 52 [2024-12-02 14:38:57,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:38:57,889 INFO L225 Difference]: With dead ends: 980 [2024-12-02 14:38:57,889 INFO L226 Difference]: Without dead ends: 692 [2024-12-02 14:38:57,890 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:38:57,891 INFO L435 NwaCegarLoop]: 206 mSDtfsCounter, 128 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 390 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 14:38:57,891 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 390 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 14:38:57,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 692 states. [2024-12-02 14:38:57,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 692 to 690. [2024-12-02 14:38:57,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 690 states, 689 states have (on average 1.478955007256894) internal successors, (1019), 689 states have internal predecessors, (1019), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:38:57,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 690 states to 690 states and 1019 transitions. [2024-12-02 14:38:57,915 INFO L78 Accepts]: Start accepts. Automaton has 690 states and 1019 transitions. Word has length 52 [2024-12-02 14:38:57,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:38:57,915 INFO L471 AbstractCegarLoop]: Abstraction has 690 states and 1019 transitions. [2024-12-02 14:38:57,915 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:38:57,915 INFO L276 IsEmpty]: Start isEmpty. Operand 690 states and 1019 transitions. [2024-12-02 14:38:57,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-12-02 14:38:57,917 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:38:57,917 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 14:38:57,917 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-12-02 14:38:57,917 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 14:38:57,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:38:57,918 INFO L85 PathProgramCache]: Analyzing trace with hash 1320706551, now seen corresponding path program 1 times [2024-12-02 14:38:57,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:38:57,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601807192] [2024-12-02 14:38:57,918 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:38:57,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:38:57,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:38:57,991 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:38:57,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:38:57,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601807192] [2024-12-02 14:38:57,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1601807192] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 14:38:57,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 14:38:57,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-02 14:38:57,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019032711] [2024-12-02 14:38:57,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 14:38:57,992 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 14:38:57,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:38:57,993 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 14:38:57,993 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 14:38:57,993 INFO L87 Difference]: Start difference. First operand 690 states and 1019 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:38:58,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:38:58,040 INFO L93 Difference]: Finished difference Result 1813 states and 2684 transitions. [2024-12-02 14:38:58,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 14:38:58,040 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 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 52 [2024-12-02 14:38:58,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:38:58,045 INFO L225 Difference]: With dead ends: 1813 [2024-12-02 14:38:58,045 INFO L226 Difference]: Without dead ends: 1211 [2024-12-02 14:38:58,046 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:38:58,047 INFO L435 NwaCegarLoop]: 204 mSDtfsCounter, 137 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 398 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 14:38:58,047 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 398 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 14:38:58,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1211 states. [2024-12-02 14:38:58,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1211 to 1209. [2024-12-02 14:38:58,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1209 states, 1208 states have (on average 1.4403973509933774) internal successors, (1740), 1208 states have internal predecessors, (1740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:38:58,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1209 states to 1209 states and 1740 transitions. [2024-12-02 14:38:58,091 INFO L78 Accepts]: Start accepts. Automaton has 1209 states and 1740 transitions. Word has length 52 [2024-12-02 14:38:58,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:38:58,091 INFO L471 AbstractCegarLoop]: Abstraction has 1209 states and 1740 transitions. [2024-12-02 14:38:58,092 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:38:58,092 INFO L276 IsEmpty]: Start isEmpty. Operand 1209 states and 1740 transitions. [2024-12-02 14:38:58,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-12-02 14:38:58,093 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:38:58,093 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 14:38:58,093 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-12-02 14:38:58,093 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 14:38:58,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:38:58,094 INFO L85 PathProgramCache]: Analyzing trace with hash -1834372633, now seen corresponding path program 1 times [2024-12-02 14:38:58,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:38:58,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927480021] [2024-12-02 14:38:58,094 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:38:58,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:38:58,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:38:58,236 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:38:58,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:38:58,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927480021] [2024-12-02 14:38:58,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [927480021] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 14:38:58,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 14:38:58,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-12-02 14:38:58,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456162978] [2024-12-02 14:38:58,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 14:38:58,237 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-02 14:38:58,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:38:58,237 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-02 14:38:58,237 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-12-02 14:38:58,237 INFO L87 Difference]: Start difference. First operand 1209 states and 1740 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:38:58,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:38:58,344 INFO L93 Difference]: Finished difference Result 2352 states and 3451 transitions. [2024-12-02 14:38:58,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-02 14:38:58,344 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 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 53 [2024-12-02 14:38:58,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:38:58,351 INFO L225 Difference]: With dead ends: 2352 [2024-12-02 14:38:58,351 INFO L226 Difference]: Without dead ends: 2006 [2024-12-02 14:38:58,352 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:38:58,352 INFO L435 NwaCegarLoop]: 363 mSDtfsCounter, 556 mSDsluCounter, 521 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 556 SdHoareTripleChecker+Valid, 884 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-12-02 14:38:58,353 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [556 Valid, 884 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-12-02 14:38:58,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2006 states. [2024-12-02 14:38:58,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2006 to 1614. [2024-12-02 14:38:58,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1614 states, 1613 states have (on average 1.4476131432114072) internal successors, (2335), 1613 states have internal predecessors, (2335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:38:58,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1614 states to 1614 states and 2335 transitions. [2024-12-02 14:38:58,403 INFO L78 Accepts]: Start accepts. Automaton has 1614 states and 2335 transitions. Word has length 53 [2024-12-02 14:38:58,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:38:58,403 INFO L471 AbstractCegarLoop]: Abstraction has 1614 states and 2335 transitions. [2024-12-02 14:38:58,403 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:38:58,403 INFO L276 IsEmpty]: Start isEmpty. Operand 1614 states and 2335 transitions. [2024-12-02 14:38:58,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-12-02 14:38:58,404 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:38:58,404 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 14:38:58,405 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-12-02 14:38:58,405 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 14:38:58,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:38:58,405 INFO L85 PathProgramCache]: Analyzing trace with hash 1785989049, now seen corresponding path program 1 times [2024-12-02 14:38:58,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:38:58,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151894681] [2024-12-02 14:38:58,405 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:38:58,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:38:58,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:38:58,552 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:38:58,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:38:58,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151894681] [2024-12-02 14:38:58,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [151894681] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 14:38:58,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 14:38:58,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-12-02 14:38:58,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486598984] [2024-12-02 14:38:58,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 14:38:58,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-02 14:38:58,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:38:58,554 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-02 14:38:58,554 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-12-02 14:38:58,554 INFO L87 Difference]: Start difference. First operand 1614 states and 2335 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:38:58,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:38:58,657 INFO L93 Difference]: Finished difference Result 2726 states and 4001 transitions. [2024-12-02 14:38:58,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-02 14:38:58,657 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 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 53 [2024-12-02 14:38:58,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:38:58,666 INFO L225 Difference]: With dead ends: 2726 [2024-12-02 14:38:58,666 INFO L226 Difference]: Without dead ends: 2380 [2024-12-02 14:38:58,667 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:38:58,668 INFO L435 NwaCegarLoop]: 369 mSDtfsCounter, 562 mSDsluCounter, 490 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 562 SdHoareTripleChecker+Valid, 859 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-12-02 14:38:58,668 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [562 Valid, 859 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-12-02 14:38:58,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2380 states. [2024-12-02 14:38:58,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2380 to 1925. [2024-12-02 14:38:58,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1925 states, 1924 states have (on average 1.4527027027027026) internal successors, (2795), 1924 states have internal predecessors, (2795), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:38:58,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1925 states to 1925 states and 2795 transitions. [2024-12-02 14:38:58,742 INFO L78 Accepts]: Start accepts. Automaton has 1925 states and 2795 transitions. Word has length 53 [2024-12-02 14:38:58,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:38:58,742 INFO L471 AbstractCegarLoop]: Abstraction has 1925 states and 2795 transitions. [2024-12-02 14:38:58,742 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:38:58,742 INFO L276 IsEmpty]: Start isEmpty. Operand 1925 states and 2795 transitions. [2024-12-02 14:38:58,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-12-02 14:38:58,744 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:38:58,744 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 14:38:58,744 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-12-02 14:38:58,744 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 14:38:58,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:38:58,745 INFO L85 PathProgramCache]: Analyzing trace with hash -1176645599, now seen corresponding path program 1 times [2024-12-02 14:38:58,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:38:58,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244649468] [2024-12-02 14:38:58,745 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:38:58,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:38:58,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:38:58,895 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:38:58,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:38:58,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244649468] [2024-12-02 14:38:58,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [244649468] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 14:38:58,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 14:38:58,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-12-02 14:38:58,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977053592] [2024-12-02 14:38:58,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 14:38:58,896 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-02 14:38:58,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:38:58,896 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-02 14:38:58,896 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-12-02 14:38:58,896 INFO L87 Difference]: Start difference. First operand 1925 states and 2795 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:38:58,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:38:58,999 INFO L93 Difference]: Finished difference Result 3143 states and 4614 transitions. [2024-12-02 14:38:58,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-02 14:38:58,999 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 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 54 [2024-12-02 14:38:58,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:38:59,007 INFO L225 Difference]: With dead ends: 3143 [2024-12-02 14:38:59,008 INFO L226 Difference]: Without dead ends: 2797 [2024-12-02 14:38:59,009 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:38:59,010 INFO L435 NwaCegarLoop]: 390 mSDtfsCounter, 567 mSDsluCounter, 540 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 567 SdHoareTripleChecker+Valid, 930 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-12-02 14:38:59,010 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [567 Valid, 930 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-12-02 14:38:59,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2797 states. [2024-12-02 14:38:59,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2797 to 2223. [2024-12-02 14:38:59,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2223 states, 2222 states have (on average 1.4572457245724573) internal successors, (3238), 2222 states have internal predecessors, (3238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:38:59,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2223 states to 2223 states and 3238 transitions. [2024-12-02 14:38:59,086 INFO L78 Accepts]: Start accepts. Automaton has 2223 states and 3238 transitions. Word has length 54 [2024-12-02 14:38:59,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:38:59,086 INFO L471 AbstractCegarLoop]: Abstraction has 2223 states and 3238 transitions. [2024-12-02 14:38:59,086 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:38:59,086 INFO L276 IsEmpty]: Start isEmpty. Operand 2223 states and 3238 transitions. [2024-12-02 14:38:59,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-12-02 14:38:59,088 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:38:59,088 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 14:38:59,088 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-12-02 14:38:59,089 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 14:38:59,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:38:59,089 INFO L85 PathProgramCache]: Analyzing trace with hash -1625242146, now seen corresponding path program 1 times [2024-12-02 14:38:59,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:38:59,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081744302] [2024-12-02 14:38:59,089 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:38:59,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:38:59,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:38:59,219 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:38:59,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:38:59,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081744302] [2024-12-02 14:38:59,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2081744302] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 14:38:59,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 14:38:59,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-12-02 14:38:59,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155973771] [2024-12-02 14:38:59,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 14:38:59,220 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-02 14:38:59,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:38:59,221 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-02 14:38:59,221 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-12-02 14:38:59,221 INFO L87 Difference]: Start difference. First operand 2223 states and 3238 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:38:59,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:38:59,431 INFO L93 Difference]: Finished difference Result 5276 states and 7686 transitions. [2024-12-02 14:38:59,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-02 14:38:59,432 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 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 57 [2024-12-02 14:38:59,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:38:59,437 INFO L225 Difference]: With dead ends: 5276 [2024-12-02 14:38:59,438 INFO L226 Difference]: Without dead ends: 3095 [2024-12-02 14:38:59,440 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-12-02 14:38:59,440 INFO L435 NwaCegarLoop]: 121 mSDtfsCounter, 799 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 799 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-12-02 14:38:59,440 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [799 Valid, 207 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-12-02 14:38:59,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3095 states. [2024-12-02 14:38:59,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3095 to 3077. [2024-12-02 14:38:59,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3077 states, 3076 states have (on average 1.4447334200260078) internal successors, (4444), 3076 states have internal predecessors, (4444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:38:59,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3077 states to 3077 states and 4444 transitions. [2024-12-02 14:38:59,508 INFO L78 Accepts]: Start accepts. Automaton has 3077 states and 4444 transitions. Word has length 57 [2024-12-02 14:38:59,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:38:59,508 INFO L471 AbstractCegarLoop]: Abstraction has 3077 states and 4444 transitions. [2024-12-02 14:38:59,509 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:38:59,509 INFO L276 IsEmpty]: Start isEmpty. Operand 3077 states and 4444 transitions. [2024-12-02 14:38:59,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-12-02 14:38:59,510 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:38:59,510 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 14:38:59,510 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-12-02 14:38:59,510 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 14:38:59,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:38:59,511 INFO L85 PathProgramCache]: Analyzing trace with hash -1198136650, now seen corresponding path program 1 times [2024-12-02 14:38:59,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:38:59,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512557157] [2024-12-02 14:38:59,511 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:38:59,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:38:59,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:38:59,584 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:38:59,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:38:59,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512557157] [2024-12-02 14:38:59,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [512557157] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 14:38:59,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 14:38:59,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-12-02 14:38:59,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570101223] [2024-12-02 14:38:59,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 14:38:59,585 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-02 14:38:59,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:38:59,586 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-02 14:38:59,586 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-12-02 14:38:59,586 INFO L87 Difference]: Start difference. First operand 3077 states and 4444 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 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:38:59,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:38:59,785 INFO L93 Difference]: Finished difference Result 7194 states and 10361 transitions. [2024-12-02 14:38:59,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-02 14:38:59,786 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 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 58 [2024-12-02 14:38:59,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:38:59,793 INFO L225 Difference]: With dead ends: 7194 [2024-12-02 14:38:59,793 INFO L226 Difference]: Without dead ends: 4204 [2024-12-02 14:38:59,796 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-12-02 14:38:59,797 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 798 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 798 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-12-02 14:38:59,797 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [798 Valid, 197 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-12-02 14:38:59,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4204 states. [2024-12-02 14:38:59,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4204 to 3077. [2024-12-02 14:38:59,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3077 states, 3076 states have (on average 1.428478543563069) internal successors, (4394), 3076 states have internal predecessors, (4394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:38:59,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3077 states to 3077 states and 4394 transitions. [2024-12-02 14:38:59,842 INFO L78 Accepts]: Start accepts. Automaton has 3077 states and 4394 transitions. Word has length 58 [2024-12-02 14:38:59,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:38:59,842 INFO L471 AbstractCegarLoop]: Abstraction has 3077 states and 4394 transitions. [2024-12-02 14:38:59,843 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 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:38:59,843 INFO L276 IsEmpty]: Start isEmpty. Operand 3077 states and 4394 transitions. [2024-12-02 14:38:59,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-12-02 14:38:59,843 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:38:59,844 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 14:38:59,844 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-12-02 14:38:59,844 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 14:38:59,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:38:59,844 INFO L85 PathProgramCache]: Analyzing trace with hash -153913959, now seen corresponding path program 1 times [2024-12-02 14:38:59,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:38:59,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212977233] [2024-12-02 14:38:59,844 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:38:59,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:38:59,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:38:59,922 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:38:59,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:38:59,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212977233] [2024-12-02 14:38:59,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [212977233] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 14:38:59,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 14:38:59,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-12-02 14:38:59,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285803475] [2024-12-02 14:38:59,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 14:38:59,923 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-02 14:38:59,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:38:59,924 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-02 14:38:59,924 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-12-02 14:38:59,924 INFO L87 Difference]: Start difference. First operand 3077 states and 4394 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 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:39:00,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:39:00,093 INFO L93 Difference]: Finished difference Result 7259 states and 10357 transitions. [2024-12-02 14:39:00,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-02 14:39:00,093 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 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 58 [2024-12-02 14:39:00,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:39:00,100 INFO L225 Difference]: With dead ends: 7259 [2024-12-02 14:39:00,101 INFO L226 Difference]: Without dead ends: 4260 [2024-12-02 14:39:00,103 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:39:00,103 INFO L435 NwaCegarLoop]: 121 mSDtfsCounter, 741 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 741 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-12-02 14:39:00,103 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [741 Valid, 209 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-12-02 14:39:00,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4260 states. [2024-12-02 14:39:00,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4260 to 4235. [2024-12-02 14:39:00,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4235 states, 4234 states have (on average 1.4121398205007085) internal successors, (5979), 4234 states have internal predecessors, (5979), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:39:00,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4235 states to 4235 states and 5979 transitions. [2024-12-02 14:39:00,168 INFO L78 Accepts]: Start accepts. Automaton has 4235 states and 5979 transitions. Word has length 58 [2024-12-02 14:39:00,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:39:00,168 INFO L471 AbstractCegarLoop]: Abstraction has 4235 states and 5979 transitions. [2024-12-02 14:39:00,169 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 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:39:00,169 INFO L276 IsEmpty]: Start isEmpty. Operand 4235 states and 5979 transitions. [2024-12-02 14:39:00,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-12-02 14:39:00,170 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:39:00,170 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 14:39:00,170 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-12-02 14:39:00,170 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 14:39:00,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:39:00,171 INFO L85 PathProgramCache]: Analyzing trace with hash 1572096567, now seen corresponding path program 1 times [2024-12-02 14:39:00,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:39:00,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986146017] [2024-12-02 14:39:00,171 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:39:00,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:39:00,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:39:00,280 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:39:00,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:39:00,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986146017] [2024-12-02 14:39:00,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1986146017] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 14:39:00,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 14:39:00,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-12-02 14:39:00,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302090438] [2024-12-02 14:39:00,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 14:39:00,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-12-02 14:39:00,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:39:00,281 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-12-02 14:39:00,281 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-12-02 14:39:00,281 INFO L87 Difference]: Start difference. First operand 4235 states and 5979 transitions. Second operand has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 6 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:39:00,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:39:00,600 INFO L93 Difference]: Finished difference Result 10180 states and 14327 transitions. [2024-12-02 14:39:00,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-12-02 14:39:00,600 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 6 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 59 [2024-12-02 14:39:00,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:39:00,621 INFO L225 Difference]: With dead ends: 10180 [2024-12-02 14:39:00,621 INFO L226 Difference]: Without dead ends: 8810 [2024-12-02 14:39:00,624 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2024-12-02 14:39:00,625 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 1342 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 261 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1342 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-12-02 14:39:00,625 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1342 Valid, 365 Invalid, 280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 261 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-12-02 14:39:00,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8810 states. [2024-12-02 14:39:00,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8810 to 4247. [2024-12-02 14:39:00,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4247 states, 4246 states have (on average 1.4119170984455958) internal successors, (5995), 4246 states have internal predecessors, (5995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:39:00,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4247 states to 4247 states and 5995 transitions. [2024-12-02 14:39:00,690 INFO L78 Accepts]: Start accepts. Automaton has 4247 states and 5995 transitions. Word has length 59 [2024-12-02 14:39:00,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:39:00,690 INFO L471 AbstractCegarLoop]: Abstraction has 4247 states and 5995 transitions. [2024-12-02 14:39:00,690 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 6 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:39:00,690 INFO L276 IsEmpty]: Start isEmpty. Operand 4247 states and 5995 transitions. [2024-12-02 14:39:00,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-12-02 14:39:00,692 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:39:00,692 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 14:39:00,692 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-12-02 14:39:00,692 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 14:39:00,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:39:00,692 INFO L85 PathProgramCache]: Analyzing trace with hash -1131093665, now seen corresponding path program 1 times [2024-12-02 14:39:00,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:39:00,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119144651] [2024-12-02 14:39:00,693 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:39:00,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:39:00,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:39:00,806 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:39:00,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:39:00,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119144651] [2024-12-02 14:39:00,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2119144651] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 14:39:00,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 14:39:00,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-12-02 14:39:00,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675046042] [2024-12-02 14:39:00,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 14:39:00,807 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-12-02 14:39:00,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:39:00,807 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-12-02 14:39:00,807 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-12-02 14:39:00,807 INFO L87 Difference]: Start difference. First operand 4247 states and 5995 transitions. Second operand has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 6 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:39:01,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:39:01,058 INFO L93 Difference]: Finished difference Result 9547 states and 13395 transitions. [2024-12-02 14:39:01,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-12-02 14:39:01,059 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 6 states have internal predecessors, (60), 0 states have call successors, (0), 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:39:01,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:39:01,068 INFO L225 Difference]: With dead ends: 9547 [2024-12-02 14:39:01,068 INFO L226 Difference]: Without dead ends: 7317 [2024-12-02 14:39:01,070 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2024-12-02 14:39:01,070 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 991 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 991 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-12-02 14:39:01,071 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [991 Valid, 313 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-12-02 14:39:01,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7317 states. [2024-12-02 14:39:01,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7317 to 4267. [2024-12-02 14:39:01,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4267 states, 4266 states have (on average 1.4109235818096577) internal successors, (6019), 4266 states have internal predecessors, (6019), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:39:01,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4267 states to 4267 states and 6019 transitions. [2024-12-02 14:39:01,127 INFO L78 Accepts]: Start accepts. Automaton has 4267 states and 6019 transitions. Word has length 60 [2024-12-02 14:39:01,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:39:01,127 INFO L471 AbstractCegarLoop]: Abstraction has 4267 states and 6019 transitions. [2024-12-02 14:39:01,127 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 6 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:39:01,127 INFO L276 IsEmpty]: Start isEmpty. Operand 4267 states and 6019 transitions. [2024-12-02 14:39:01,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-12-02 14:39:01,128 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:39:01,128 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 14:39:01,128 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-12-02 14:39:01,129 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 14:39:01,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:39:01,129 INFO L85 PathProgramCache]: Analyzing trace with hash -1840434496, now seen corresponding path program 1 times [2024-12-02 14:39:01,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:39:01,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180075900] [2024-12-02 14:39:01,129 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:39:01,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:39:01,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:39:01,232 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:39:01,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:39:01,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180075900] [2024-12-02 14:39:01,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [180075900] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 14:39:01,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 14:39:01,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-12-02 14:39:01,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536050231] [2024-12-02 14:39:01,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 14:39:01,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-12-02 14:39:01,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:39:01,233 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-12-02 14:39:01,233 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-12-02 14:39:01,233 INFO L87 Difference]: Start difference. First operand 4267 states and 6019 transitions. Second operand has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 6 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:39:01,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:39:01,524 INFO L93 Difference]: Finished difference Result 11077 states and 15592 transitions. [2024-12-02 14:39:01,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-12-02 14:39:01,525 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 6 states have internal predecessors, (60), 0 states have call successors, (0), 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:39:01,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:39:01,541 INFO L225 Difference]: With dead ends: 11077 [2024-12-02 14:39:01,541 INFO L226 Difference]: Without dead ends: 9031 [2024-12-02 14:39:01,545 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2024-12-02 14:39:01,545 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 1172 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 251 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1172 SdHoareTripleChecker+Valid, 347 SdHoareTripleChecker+Invalid, 270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-12-02 14:39:01,546 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1172 Valid, 347 Invalid, 270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 251 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-12-02 14:39:01,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9031 states. [2024-12-02 14:39:01,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9031 to 4345. [2024-12-02 14:39:01,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4345 states, 4344 states have (on average 1.408609576427256) internal successors, (6119), 4344 states have internal predecessors, (6119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:39:01,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4345 states to 4345 states and 6119 transitions. [2024-12-02 14:39:01,670 INFO L78 Accepts]: Start accepts. Automaton has 4345 states and 6119 transitions. Word has length 60 [2024-12-02 14:39:01,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:39:01,670 INFO L471 AbstractCegarLoop]: Abstraction has 4345 states and 6119 transitions. [2024-12-02 14:39:01,670 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 6 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:39:01,670 INFO L276 IsEmpty]: Start isEmpty. Operand 4345 states and 6119 transitions. [2024-12-02 14:39:01,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-12-02 14:39:01,673 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:39:01,674 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 14:39:01,674 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-12-02 14:39:01,674 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 14:39:01,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:39:01,674 INFO L85 PathProgramCache]: Analyzing trace with hash -1556118219, now seen corresponding path program 1 times [2024-12-02 14:39:01,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:39:01,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453848616] [2024-12-02 14:39:01,675 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:39:01,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:39:01,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:39:02,070 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:39:02,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:39:02,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453848616] [2024-12-02 14:39:02,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1453848616] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 14:39:02,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 14:39:02,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-12-02 14:39:02,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127182311] [2024-12-02 14:39:02,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 14:39:02,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-12-02 14:39:02,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:39:02,071 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-12-02 14:39:02,071 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-12-02 14:39:02,071 INFO L87 Difference]: Start difference. First operand 4345 states and 6119 transitions. Second operand has 10 states, 10 states have (on average 6.2) internal successors, (62), 9 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:39:02,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:39:02,560 INFO L93 Difference]: Finished difference Result 10476 states and 14803 transitions. [2024-12-02 14:39:02,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-12-02 14:39:02,560 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.2) internal successors, (62), 9 states have internal predecessors, (62), 0 states have call successors, (0), 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:39:02,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:39:02,574 INFO L225 Difference]: With dead ends: 10476 [2024-12-02 14:39:02,574 INFO L226 Difference]: Without dead ends: 6887 [2024-12-02 14:39:02,578 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2024-12-02 14:39:02,578 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 1113 mSDsluCounter, 515 mSDsCounter, 0 mSdLazyCounter, 507 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1113 SdHoareTripleChecker+Valid, 632 SdHoareTripleChecker+Invalid, 518 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 507 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-12-02 14:39:02,579 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1113 Valid, 632 Invalid, 518 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 507 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-12-02 14:39:02,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6887 states. [2024-12-02 14:39:02,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6887 to 4345. [2024-12-02 14:39:02,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4345 states, 4344 states have (on average 1.4072283609576428) internal successors, (6113), 4344 states have internal predecessors, (6113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:39:02,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4345 states to 4345 states and 6113 transitions. [2024-12-02 14:39:02,671 INFO L78 Accepts]: Start accepts. Automaton has 4345 states and 6113 transitions. Word has length 62 [2024-12-02 14:39:02,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:39:02,671 INFO L471 AbstractCegarLoop]: Abstraction has 4345 states and 6113 transitions. [2024-12-02 14:39:02,672 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.2) internal successors, (62), 9 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:39:02,672 INFO L276 IsEmpty]: Start isEmpty. Operand 4345 states and 6113 transitions. [2024-12-02 14:39:02,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-12-02 14:39:02,673 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:39:02,674 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 14:39:02,674 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-12-02 14:39:02,674 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 14:39:02,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:39:02,674 INFO L85 PathProgramCache]: Analyzing trace with hash -443125389, now seen corresponding path program 1 times [2024-12-02 14:39:02,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:39:02,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856728] [2024-12-02 14:39:02,675 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:39:02,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:39:02,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:39:03,011 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:39:03,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:39:03,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856728] [2024-12-02 14:39:03,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1856728] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 14:39:03,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 14:39:03,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-12-02 14:39:03,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250980589] [2024-12-02 14:39:03,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 14:39:03,012 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-12-02 14:39:03,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:39:03,012 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-12-02 14:39:03,012 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-12-02 14:39:03,013 INFO L87 Difference]: Start difference. First operand 4345 states and 6113 transitions. Second operand has 10 states, 10 states have (on average 6.2) internal successors, (62), 9 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:39:03,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:39:03,562 INFO L93 Difference]: Finished difference Result 10232 states and 14474 transitions. [2024-12-02 14:39:03,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-12-02 14:39:03,563 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.2) internal successors, (62), 9 states have internal predecessors, (62), 0 states have call successors, (0), 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:39:03,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:39:03,572 INFO L225 Difference]: With dead ends: 10232 [2024-12-02 14:39:03,572 INFO L226 Difference]: Without dead ends: 6782 [2024-12-02 14:39:03,575 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=122, Invalid=340, Unknown=0, NotChecked=0, Total=462 [2024-12-02 14:39:03,575 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 1173 mSDsluCounter, 549 mSDsCounter, 0 mSdLazyCounter, 568 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1173 SdHoareTripleChecker+Valid, 680 SdHoareTripleChecker+Invalid, 580 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 568 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-12-02 14:39:03,575 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1173 Valid, 680 Invalid, 580 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 568 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-12-02 14:39:03,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6782 states. [2024-12-02 14:39:03,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6782 to 4261. [2024-12-02 14:39:03,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4261 states, 4260 states have (on average 1.4046948356807512) internal successors, (5984), 4260 states have internal predecessors, (5984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:39:03,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4261 states to 4261 states and 5984 transitions. [2024-12-02 14:39:03,648 INFO L78 Accepts]: Start accepts. Automaton has 4261 states and 5984 transitions. Word has length 62 [2024-12-02 14:39:03,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:39:03,648 INFO L471 AbstractCegarLoop]: Abstraction has 4261 states and 5984 transitions. [2024-12-02 14:39:03,649 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.2) internal successors, (62), 9 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:39:03,649 INFO L276 IsEmpty]: Start isEmpty. Operand 4261 states and 5984 transitions. [2024-12-02 14:39:03,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-12-02 14:39:03,650 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:39:03,650 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 14:39:03,650 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-12-02 14:39:03,650 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 14:39:03,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:39:03,651 INFO L85 PathProgramCache]: Analyzing trace with hash 1162737396, now seen corresponding path program 1 times [2024-12-02 14:39:03,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:39:03,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537992389] [2024-12-02 14:39:03,651 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:39:03,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:39:03,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:39:03,933 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:39:03,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:39:03,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537992389] [2024-12-02 14:39:03,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [537992389] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 14:39:03,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 14:39:03,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-12-02 14:39:03,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441962178] [2024-12-02 14:39:03,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 14:39:03,935 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-12-02 14:39:03,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:39:03,935 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-12-02 14:39:03,935 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-12-02 14:39:03,935 INFO L87 Difference]: Start difference. First operand 4261 states and 5984 transitions. Second operand has 10 states, 10 states have (on average 6.2) internal successors, (62), 9 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:39:04,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:39:04,432 INFO L93 Difference]: Finished difference Result 11280 states and 15949 transitions. [2024-12-02 14:39:04,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-12-02 14:39:04,433 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.2) internal successors, (62), 9 states have internal predecessors, (62), 0 states have call successors, (0), 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:39:04,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:39:04,447 INFO L225 Difference]: With dead ends: 11280 [2024-12-02 14:39:04,447 INFO L226 Difference]: Without dead ends: 7701 [2024-12-02 14:39:04,451 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2024-12-02 14:39:04,452 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 854 mSDsluCounter, 600 mSDsCounter, 0 mSdLazyCounter, 593 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 854 SdHoareTripleChecker+Valid, 745 SdHoareTripleChecker+Invalid, 604 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 593 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-12-02 14:39:04,452 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [854 Valid, 745 Invalid, 604 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 593 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-12-02 14:39:04,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7701 states. [2024-12-02 14:39:04,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7701 to 4082. [2024-12-02 14:39:04,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4082 states, 4081 states have (on average 1.4021073266356285) internal successors, (5722), 4081 states have internal predecessors, (5722), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:39:04,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4082 states to 4082 states and 5722 transitions. [2024-12-02 14:39:04,523 INFO L78 Accepts]: Start accepts. Automaton has 4082 states and 5722 transitions. Word has length 62 [2024-12-02 14:39:04,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:39:04,523 INFO L471 AbstractCegarLoop]: Abstraction has 4082 states and 5722 transitions. [2024-12-02 14:39:04,523 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.2) internal successors, (62), 9 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:39:04,523 INFO L276 IsEmpty]: Start isEmpty. Operand 4082 states and 5722 transitions. [2024-12-02 14:39:04,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-12-02 14:39:04,525 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:39:04,525 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 14:39:04,525 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-12-02 14:39:04,525 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 14:39:04,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:39:04,526 INFO L85 PathProgramCache]: Analyzing trace with hash 1143949417, now seen corresponding path program 1 times [2024-12-02 14:39:04,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:39:04,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592672176] [2024-12-02 14:39:04,526 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:39:04,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:39:04,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:39:04,591 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:39:04,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:39:04,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592672176] [2024-12-02 14:39:04,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1592672176] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 14:39:04,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 14:39:04,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-02 14:39:04,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732424910] [2024-12-02 14:39:04,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 14:39:04,592 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 14:39:04,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:39:04,592 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 14:39:04,592 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 14:39:04,592 INFO L87 Difference]: Start difference. First operand 4082 states and 5722 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:39:04,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:39:04,619 INFO L93 Difference]: Finished difference Result 6091 states and 8563 transitions. [2024-12-02 14:39:04,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 14:39:04,619 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2024-12-02 14:39:04,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:39:04,625 INFO L225 Difference]: With dead ends: 6091 [2024-12-02 14:39:04,625 INFO L226 Difference]: Without dead ends: 3975 [2024-12-02 14:39:04,627 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 14:39:04,627 INFO L435 NwaCegarLoop]: 300 mSDtfsCounter, 130 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 473 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 14:39:04,628 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 473 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 14:39:04,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3975 states. [2024-12-02 14:39:04,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3975 to 3973. [2024-12-02 14:39:04,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3973 states, 3972 states have (on average 1.3862034239677745) internal successors, (5506), 3972 states have internal predecessors, (5506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:39:04,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3973 states to 3973 states and 5506 transitions. [2024-12-02 14:39:04,675 INFO L78 Accepts]: Start accepts. Automaton has 3973 states and 5506 transitions. Word has length 63 [2024-12-02 14:39:04,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:39:04,675 INFO L471 AbstractCegarLoop]: Abstraction has 3973 states and 5506 transitions. [2024-12-02 14:39:04,675 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:39:04,675 INFO L276 IsEmpty]: Start isEmpty. Operand 3973 states and 5506 transitions. [2024-12-02 14:39:04,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-12-02 14:39:04,676 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:39:04,676 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 14:39:04,677 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-12-02 14:39:04,677 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 14:39:04,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:39:04,677 INFO L85 PathProgramCache]: Analyzing trace with hash -1363691260, now seen corresponding path program 1 times [2024-12-02 14:39:04,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:39:04,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045327026] [2024-12-02 14:39:04,677 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:39:04,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:39:04,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:39:04,732 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:39:04,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:39:04,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045327026] [2024-12-02 14:39:04,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1045327026] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 14:39:04,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 14:39:04,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-02 14:39:04,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455505202] [2024-12-02 14:39:04,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 14:39:04,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 14:39:04,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:39:04,733 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 14:39:04,733 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 14:39:04,733 INFO L87 Difference]: Start difference. First operand 3973 states and 5506 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:39:04,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:39:04,760 INFO L93 Difference]: Finished difference Result 5478 states and 7588 transitions. [2024-12-02 14:39:04,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 14:39:04,760 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2024-12-02 14:39:04,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:39:04,766 INFO L225 Difference]: With dead ends: 5478 [2024-12-02 14:39:04,767 INFO L226 Difference]: Without dead ends: 3380 [2024-12-02 14:39:04,768 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 14:39:04,769 INFO L435 NwaCegarLoop]: 289 mSDtfsCounter, 118 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 462 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 14:39:04,769 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 462 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 14:39:04,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3380 states. [2024-12-02 14:39:04,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3380 to 3378. [2024-12-02 14:39:04,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3378 states, 3377 states have (on average 1.3591945513769619) internal successors, (4590), 3377 states have internal predecessors, (4590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:39:04,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3378 states to 3378 states and 4590 transitions. [2024-12-02 14:39:04,813 INFO L78 Accepts]: Start accepts. Automaton has 3378 states and 4590 transitions. Word has length 63 [2024-12-02 14:39:04,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:39:04,813 INFO L471 AbstractCegarLoop]: Abstraction has 3378 states and 4590 transitions. [2024-12-02 14:39:04,813 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:39:04,813 INFO L276 IsEmpty]: Start isEmpty. Operand 3378 states and 4590 transitions. [2024-12-02 14:39:04,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-12-02 14:39:04,814 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:39:04,814 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 14:39:04,815 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-12-02 14:39:04,815 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 14:39:04,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:39:04,815 INFO L85 PathProgramCache]: Analyzing trace with hash -1254313906, now seen corresponding path program 1 times [2024-12-02 14:39:04,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:39:04,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5273130] [2024-12-02 14:39:04,815 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:39:04,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:39:04,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:39:04,868 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:39:04,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:39:04,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5273130] [2024-12-02 14:39:04,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5273130] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 14:39:04,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 14:39:04,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-02 14:39:04,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209438299] [2024-12-02 14:39:04,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 14:39:04,869 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 14:39:04,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:39:04,869 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 14:39:04,869 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 14:39:04,869 INFO L87 Difference]: Start difference. First operand 3378 states and 4590 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:39:04,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:39:04,898 INFO L93 Difference]: Finished difference Result 4127 states and 5582 transitions. [2024-12-02 14:39:04,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 14:39:04,899 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2024-12-02 14:39:04,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:39:04,904 INFO L225 Difference]: With dead ends: 4127 [2024-12-02 14:39:04,904 INFO L226 Difference]: Without dead ends: 2783 [2024-12-02 14:39:04,905 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 14:39:04,906 INFO L435 NwaCegarLoop]: 320 mSDtfsCounter, 148 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 477 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 14:39:04,906 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 477 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 14:39:04,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2783 states. [2024-12-02 14:39:04,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2783 to 2781. [2024-12-02 14:39:04,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2781 states, 2780 states have (on average 1.3273381294964028) internal successors, (3690), 2780 states have internal predecessors, (3690), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:39:04,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2781 states to 2781 states and 3690 transitions. [2024-12-02 14:39:04,940 INFO L78 Accepts]: Start accepts. Automaton has 2781 states and 3690 transitions. Word has length 63 [2024-12-02 14:39:04,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:39:04,940 INFO L471 AbstractCegarLoop]: Abstraction has 2781 states and 3690 transitions. [2024-12-02 14:39:04,941 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:39:04,941 INFO L276 IsEmpty]: Start isEmpty. Operand 2781 states and 3690 transitions. [2024-12-02 14:39:04,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-12-02 14:39:04,942 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:39:04,942 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 14:39:04,942 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-12-02 14:39:04,942 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 14:39:04,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:39:04,943 INFO L85 PathProgramCache]: Analyzing trace with hash -424034558, now seen corresponding path program 1 times [2024-12-02 14:39:04,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:39:04,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132319250] [2024-12-02 14:39:04,943 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:39:04,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:39:04,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:39:05,701 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:39:05,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:39:05,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132319250] [2024-12-02 14:39:05,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2132319250] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 14:39:05,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 14:39:05,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-12-02 14:39:05,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58135983] [2024-12-02 14:39:05,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 14:39:05,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-12-02 14:39:05,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:39:05,703 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-12-02 14:39:05,703 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2024-12-02 14:39:05,703 INFO L87 Difference]: Start difference. First operand 2781 states and 3690 transitions. Second operand has 13 states, 13 states have (on average 4.923076923076923) internal successors, (64), 13 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:39:06,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:39:06,571 INFO L93 Difference]: Finished difference Result 7264 states and 9760 transitions. [2024-12-02 14:39:06,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-12-02 14:39:06,572 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.923076923076923) internal successors, (64), 13 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:39:06,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:39:06,584 INFO L225 Difference]: With dead ends: 7264 [2024-12-02 14:39:06,584 INFO L226 Difference]: Without dead ends: 6876 [2024-12-02 14:39:06,586 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=166, Invalid=434, Unknown=0, NotChecked=0, Total=600 [2024-12-02 14:39:06,587 INFO L435 NwaCegarLoop]: 232 mSDtfsCounter, 1818 mSDsluCounter, 1522 mSDsCounter, 0 mSdLazyCounter, 586 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1818 SdHoareTripleChecker+Valid, 1754 SdHoareTripleChecker+Invalid, 592 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 586 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-12-02 14:39:06,587 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1818 Valid, 1754 Invalid, 592 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 586 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-12-02 14:39:06,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6876 states. [2024-12-02 14:39:06,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6876 to 2695. [2024-12-02 14:39:06,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2695 states, 2694 states have (on average 1.3270230141054193) internal successors, (3575), 2694 states have internal predecessors, (3575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:39:06,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2695 states to 2695 states and 3575 transitions. [2024-12-02 14:39:06,640 INFO L78 Accepts]: Start accepts. Automaton has 2695 states and 3575 transitions. Word has length 64 [2024-12-02 14:39:06,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:39:06,640 INFO L471 AbstractCegarLoop]: Abstraction has 2695 states and 3575 transitions. [2024-12-02 14:39:06,640 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.923076923076923) internal successors, (64), 13 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:39:06,640 INFO L276 IsEmpty]: Start isEmpty. Operand 2695 states and 3575 transitions. [2024-12-02 14:39:06,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-12-02 14:39:06,642 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:39:06,642 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 14:39:06,642 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-12-02 14:39:06,642 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 14:39:06,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:39:06,642 INFO L85 PathProgramCache]: Analyzing trace with hash -1940234754, now seen corresponding path program 1 times [2024-12-02 14:39:06,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:39:06,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443825734] [2024-12-02 14:39:06,643 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:39:06,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:39:06,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:39:07,235 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:39:07,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:39:07,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443825734] [2024-12-02 14:39:07,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1443825734] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 14:39:07,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 14:39:07,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-12-02 14:39:07,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672921462] [2024-12-02 14:39:07,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 14:39:07,235 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-12-02 14:39:07,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:39:07,236 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-12-02 14:39:07,236 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2024-12-02 14:39:07,236 INFO L87 Difference]: Start difference. First operand 2695 states and 3575 transitions. Second operand has 13 states, 13 states have (on average 4.923076923076923) internal successors, (64), 13 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:39:07,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:39:07,937 INFO L93 Difference]: Finished difference Result 4039 states and 5399 transitions. [2024-12-02 14:39:07,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-12-02 14:39:07,937 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.923076923076923) internal successors, (64), 13 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:39:07,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:39:07,942 INFO L225 Difference]: With dead ends: 4039 [2024-12-02 14:39:07,942 INFO L226 Difference]: Without dead ends: 3813 [2024-12-02 14:39:07,943 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=142, Invalid=458, Unknown=0, NotChecked=0, Total=600 [2024-12-02 14:39:07,944 INFO L435 NwaCegarLoop]: 201 mSDtfsCounter, 1224 mSDsluCounter, 1040 mSDsCounter, 0 mSdLazyCounter, 341 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1224 SdHoareTripleChecker+Valid, 1241 SdHoareTripleChecker+Invalid, 346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-12-02 14:39:07,944 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1224 Valid, 1241 Invalid, 346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 341 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-12-02 14:39:07,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3813 states. [2024-12-02 14:39:07,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3813 to 2649. [2024-12-02 14:39:07,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2649 states, 2648 states have (on average 1.3266616314199395) internal successors, (3513), 2648 states have internal predecessors, (3513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:39:07,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2649 states to 2649 states and 3513 transitions. [2024-12-02 14:39:07,980 INFO L78 Accepts]: Start accepts. Automaton has 2649 states and 3513 transitions. Word has length 64 [2024-12-02 14:39:07,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:39:07,980 INFO L471 AbstractCegarLoop]: Abstraction has 2649 states and 3513 transitions. [2024-12-02 14:39:07,981 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.923076923076923) internal successors, (64), 13 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:39:07,981 INFO L276 IsEmpty]: Start isEmpty. Operand 2649 states and 3513 transitions. [2024-12-02 14:39:07,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-12-02 14:39:07,982 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:39:07,982 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 14:39:07,982 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-12-02 14:39:07,982 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 14:39:07,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:39:07,982 INFO L85 PathProgramCache]: Analyzing trace with hash 1380487795, now seen corresponding path program 1 times [2024-12-02 14:39:07,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:39:07,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796280610] [2024-12-02 14:39:07,983 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:39:07,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:39:08,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:39:08,036 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:39:08,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:39:08,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796280610] [2024-12-02 14:39:08,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [796280610] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 14:39:08,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 14:39:08,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-02 14:39:08,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296362991] [2024-12-02 14:39:08,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 14:39:08,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 14:39:08,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:39:08,038 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 14:39:08,038 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 14:39:08,038 INFO L87 Difference]: Start difference. First operand 2649 states and 3513 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:39:08,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:39:08,078 INFO L93 Difference]: Finished difference Result 4860 states and 6496 transitions. [2024-12-02 14:39:08,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 14:39:08,079 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:39:08,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:39:08,085 INFO L225 Difference]: With dead ends: 4860 [2024-12-02 14:39:08,085 INFO L226 Difference]: Without dead ends: 3514 [2024-12-02 14:39:08,087 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 14:39:08,088 INFO L435 NwaCegarLoop]: 191 mSDtfsCounter, 148 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 14:39:08,089 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 304 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 14:39:08,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3514 states. [2024-12-02 14:39:08,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3514 to 2483. [2024-12-02 14:39:08,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2483 states, 2482 states have (on average 1.3251410153102336) internal successors, (3289), 2482 states have internal predecessors, (3289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:39:08,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2483 states to 2483 states and 3289 transitions. [2024-12-02 14:39:08,123 INFO L78 Accepts]: Start accepts. Automaton has 2483 states and 3289 transitions. Word has length 64 [2024-12-02 14:39:08,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:39:08,123 INFO L471 AbstractCegarLoop]: Abstraction has 2483 states and 3289 transitions. [2024-12-02 14:39:08,123 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:39:08,123 INFO L276 IsEmpty]: Start isEmpty. Operand 2483 states and 3289 transitions. [2024-12-02 14:39:08,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-12-02 14:39:08,124 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:39:08,124 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 14:39:08,125 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-12-02 14:39:08,125 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 14:39:08,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:39:08,125 INFO L85 PathProgramCache]: Analyzing trace with hash -427633856, now seen corresponding path program 1 times [2024-12-02 14:39:08,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:39:08,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238908968] [2024-12-02 14:39:08,125 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:39:08,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:39:08,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:39:08,218 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:39:08,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:39:08,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238908968] [2024-12-02 14:39:08,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [238908968] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 14:39:08,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 14:39:08,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-12-02 14:39:08,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707362635] [2024-12-02 14:39:08,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 14:39:08,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-02 14:39:08,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:39:08,219 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-02 14:39:08,219 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-12-02 14:39:08,219 INFO L87 Difference]: Start difference. First operand 2483 states and 3289 transitions. Second operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:39:08,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:39:08,271 INFO L93 Difference]: Finished difference Result 2489 states and 3292 transitions. [2024-12-02 14:39:08,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-02 14:39:08,272 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2024-12-02 14:39:08,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:39:08,275 INFO L225 Difference]: With dead ends: 2489 [2024-12-02 14:39:08,275 INFO L226 Difference]: Without dead ends: 2274 [2024-12-02 14:39:08,275 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:39:08,276 INFO L435 NwaCegarLoop]: 306 mSDtfsCounter, 569 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 569 SdHoareTripleChecker+Valid, 554 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 14:39:08,276 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [569 Valid, 554 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 14:39:08,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2274 states. [2024-12-02 14:39:08,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2274 to 2270. [2024-12-02 14:39:08,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2270 states, 2269 states have (on average 1.3283384750991627) internal successors, (3014), 2269 states have internal predecessors, (3014), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:39:08,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2270 states to 2270 states and 3014 transitions. [2024-12-02 14:39:08,302 INFO L78 Accepts]: Start accepts. Automaton has 2270 states and 3014 transitions. Word has length 68 [2024-12-02 14:39:08,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:39:08,302 INFO L471 AbstractCegarLoop]: Abstraction has 2270 states and 3014 transitions. [2024-12-02 14:39:08,302 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:39:08,302 INFO L276 IsEmpty]: Start isEmpty. Operand 2270 states and 3014 transitions. [2024-12-02 14:39:08,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-12-02 14:39:08,303 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:39:08,303 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 14:39:08,303 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-12-02 14:39:08,303 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 14:39:08,304 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:39:08,304 INFO L85 PathProgramCache]: Analyzing trace with hash 1513353753, now seen corresponding path program 1 times [2024-12-02 14:39:08,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:39:08,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431509849] [2024-12-02 14:39:08,304 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:39:08,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:39:08,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:39:08,390 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:39:08,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:39:08,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431509849] [2024-12-02 14:39:08,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1431509849] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 14:39:08,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 14:39:08,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-02 14:39:08,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985068873] [2024-12-02 14:39:08,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 14:39:08,390 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 14:39:08,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:39:08,391 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 14:39:08,391 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 14:39:08,391 INFO L87 Difference]: Start difference. First operand 2270 states and 3014 transitions. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:39:08,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:39:08,418 INFO L93 Difference]: Finished difference Result 5629 states and 7596 transitions. [2024-12-02 14:39:08,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 14:39:08,419 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2024-12-02 14:39:08,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:39:08,424 INFO L225 Difference]: With dead ends: 5629 [2024-12-02 14:39:08,424 INFO L226 Difference]: Without dead ends: 3872 [2024-12-02 14:39:08,426 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 14:39:08,426 INFO L435 NwaCegarLoop]: 254 mSDtfsCounter, 99 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 403 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 14:39:08,426 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 403 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 14:39:08,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3872 states. [2024-12-02 14:39:08,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3872 to 3604. [2024-12-02 14:39:08,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3604 states, 3603 states have (on average 1.334165972800444) internal successors, (4807), 3603 states have internal predecessors, (4807), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:39:08,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3604 states to 3604 states and 4807 transitions. [2024-12-02 14:39:08,471 INFO L78 Accepts]: Start accepts. Automaton has 3604 states and 4807 transitions. Word has length 71 [2024-12-02 14:39:08,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:39:08,471 INFO L471 AbstractCegarLoop]: Abstraction has 3604 states and 4807 transitions. [2024-12-02 14:39:08,471 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:39:08,471 INFO L276 IsEmpty]: Start isEmpty. Operand 3604 states and 4807 transitions. [2024-12-02 14:39:08,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-12-02 14:39:08,472 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:39:08,472 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 14:39:08,473 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-12-02 14:39:08,473 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 14:39:08,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:39:08,473 INFO L85 PathProgramCache]: Analyzing trace with hash 87467842, now seen corresponding path program 1 times [2024-12-02 14:39:08,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:39:08,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353647049] [2024-12-02 14:39:08,473 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:39:08,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:39:08,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:39:08,557 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:39:08,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:39:08,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353647049] [2024-12-02 14:39:08,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1353647049] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 14:39:08,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 14:39:08,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-02 14:39:08,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702669469] [2024-12-02 14:39:08,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 14:39:08,558 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 14:39:08,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:39:08,559 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 14:39:08,559 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 14:39:08,559 INFO L87 Difference]: Start difference. First operand 3604 states and 4807 transitions. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:39:08,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:39:08,590 INFO L93 Difference]: Finished difference Result 9476 states and 12737 transitions. [2024-12-02 14:39:08,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 14:39:08,591 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2024-12-02 14:39:08,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:39:08,599 INFO L225 Difference]: With dead ends: 9476 [2024-12-02 14:39:08,599 INFO L226 Difference]: Without dead ends: 6385 [2024-12-02 14:39:08,602 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 14:39:08,603 INFO L435 NwaCegarLoop]: 236 mSDtfsCounter, 88 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 395 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 14:39:08,603 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 395 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 14:39:08,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6385 states. [2024-12-02 14:39:08,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6385 to 5931. [2024-12-02 14:39:08,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5931 states, 5930 states have (on average 1.3317032040472176) internal successors, (7897), 5930 states have internal predecessors, (7897), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:39:08,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5931 states to 5931 states and 7897 transitions. [2024-12-02 14:39:08,676 INFO L78 Accepts]: Start accepts. Automaton has 5931 states and 7897 transitions. Word has length 72 [2024-12-02 14:39:08,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:39:08,676 INFO L471 AbstractCegarLoop]: Abstraction has 5931 states and 7897 transitions. [2024-12-02 14:39:08,677 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:39:08,677 INFO L276 IsEmpty]: Start isEmpty. Operand 5931 states and 7897 transitions. [2024-12-02 14:39:08,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-12-02 14:39:08,678 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:39:08,678 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 14:39:08,678 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-12-02 14:39:08,678 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 14:39:08,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:39:08,679 INFO L85 PathProgramCache]: Analyzing trace with hash -1178358807, now seen corresponding path program 1 times [2024-12-02 14:39:08,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:39:08,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88062484] [2024-12-02 14:39:08,679 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:39:08,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:39:08,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:39:08,770 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:39:08,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:39:08,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88062484] [2024-12-02 14:39:08,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [88062484] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 14:39:08,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 14:39:08,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-02 14:39:08,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919840663] [2024-12-02 14:39:08,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 14:39:08,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 14:39:08,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:39:08,771 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 14:39:08,771 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 14:39:08,771 INFO L87 Difference]: Start difference. First operand 5931 states and 7897 transitions. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:39:08,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:39:08,818 INFO L93 Difference]: Finished difference Result 16057 states and 21377 transitions. [2024-12-02 14:39:08,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 14:39:08,818 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2024-12-02 14:39:08,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:39:08,830 INFO L225 Difference]: With dead ends: 16057 [2024-12-02 14:39:08,830 INFO L226 Difference]: Without dead ends: 10551 [2024-12-02 14:39:08,835 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 14:39:08,836 INFO L435 NwaCegarLoop]: 239 mSDtfsCounter, 99 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 379 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 14:39:08,836 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 379 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 14:39:08,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10551 states. [2024-12-02 14:39:08,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10551 to 9757. [2024-12-02 14:39:08,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9757 states, 9756 states have (on average 1.320110701107011) internal successors, (12879), 9756 states have internal predecessors, (12879), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:39:08,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9757 states to 9757 states and 12879 transitions. [2024-12-02 14:39:08,938 INFO L78 Accepts]: Start accepts. Automaton has 9757 states and 12879 transitions. Word has length 74 [2024-12-02 14:39:08,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:39:08,938 INFO L471 AbstractCegarLoop]: Abstraction has 9757 states and 12879 transitions. [2024-12-02 14:39:08,938 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:39:08,939 INFO L276 IsEmpty]: Start isEmpty. Operand 9757 states and 12879 transitions. [2024-12-02 14:39:08,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-12-02 14:39:08,939 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:39:08,940 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 14:39:08,940 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-12-02 14:39:08,940 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 14:39:08,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:39:08,940 INFO L85 PathProgramCache]: Analyzing trace with hash -1504202340, now seen corresponding path program 1 times [2024-12-02 14:39:08,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:39:08,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557881903] [2024-12-02 14:39:08,941 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:39:08,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:39:08,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:39:09,159 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:39:09,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:39:09,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557881903] [2024-12-02 14:39:09,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1557881903] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 14:39:09,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 14:39:09,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-12-02 14:39:09,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069829668] [2024-12-02 14:39:09,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 14:39:09,160 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-12-02 14:39:09,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:39:09,160 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-12-02 14:39:09,160 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-12-02 14:39:09,161 INFO L87 Difference]: Start difference. First operand 9757 states and 12879 transitions. Second operand has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:39:09,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:39:09,208 INFO L93 Difference]: Finished difference Result 10743 states and 14192 transitions. [2024-12-02 14:39:09,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-12-02 14:39:09,209 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 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 75 [2024-12-02 14:39:09,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:39:09,222 INFO L225 Difference]: With dead ends: 10743 [2024-12-02 14:39:09,222 INFO L226 Difference]: Without dead ends: 10741 [2024-12-02 14:39:09,225 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-12-02 14:39:09,226 INFO L435 NwaCegarLoop]: 180 mSDtfsCounter, 0 mSDsluCounter, 704 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 884 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 14:39:09,226 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 884 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 14:39:09,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10741 states. [2024-12-02 14:39:09,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10741 to 10741. [2024-12-02 14:39:09,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10741 states, 10740 states have (on average 1.290782122905028) internal successors, (13863), 10740 states have internal predecessors, (13863), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:39:09,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10741 states to 10741 states and 13863 transitions. [2024-12-02 14:39:09,340 INFO L78 Accepts]: Start accepts. Automaton has 10741 states and 13863 transitions. Word has length 75 [2024-12-02 14:39:09,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:39:09,340 INFO L471 AbstractCegarLoop]: Abstraction has 10741 states and 13863 transitions. [2024-12-02 14:39:09,340 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:39:09,340 INFO L276 IsEmpty]: Start isEmpty. Operand 10741 states and 13863 transitions. [2024-12-02 14:39:09,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-12-02 14:39:09,341 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:39:09,341 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 14:39:09,341 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-12-02 14:39:09,342 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 14:39:09,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:39:09,342 INFO L85 PathProgramCache]: Analyzing trace with hash -1668309570, now seen corresponding path program 1 times [2024-12-02 14:39:09,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:39:09,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403035153] [2024-12-02 14:39:09,342 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:39:09,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:39:09,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:39:09,391 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:39:09,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:39:09,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403035153] [2024-12-02 14:39:09,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1403035153] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 14:39:09,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 14:39:09,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-02 14:39:09,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650918939] [2024-12-02 14:39:09,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 14:39:09,391 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 14:39:09,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:39:09,392 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 14:39:09,392 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 14:39:09,392 INFO L87 Difference]: Start difference. First operand 10741 states and 13863 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:39:09,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:39:09,453 INFO L93 Difference]: Finished difference Result 26129 states and 33557 transitions. [2024-12-02 14:39:09,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 14:39:09,454 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 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 76 [2024-12-02 14:39:09,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:39:09,471 INFO L225 Difference]: With dead ends: 26129 [2024-12-02 14:39:09,472 INFO L226 Difference]: Without dead ends: 15827 [2024-12-02 14:39:09,479 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 14:39:09,480 INFO L435 NwaCegarLoop]: 204 mSDtfsCounter, 117 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 14:39:09,480 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 319 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 14:39:09,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15827 states. [2024-12-02 14:39:09,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15827 to 15825. [2024-12-02 14:39:09,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15825 states, 15824 states have (on average 1.264850859453994) internal successors, (20015), 15824 states have internal predecessors, (20015), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:39:09,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15825 states to 15825 states and 20015 transitions. [2024-12-02 14:39:09,672 INFO L78 Accepts]: Start accepts. Automaton has 15825 states and 20015 transitions. Word has length 76 [2024-12-02 14:39:09,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:39:09,672 INFO L471 AbstractCegarLoop]: Abstraction has 15825 states and 20015 transitions. [2024-12-02 14:39:09,673 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:39:09,673 INFO L276 IsEmpty]: Start isEmpty. Operand 15825 states and 20015 transitions. [2024-12-02 14:39:09,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-12-02 14:39:09,676 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:39:09,676 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 14:39:09,676 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-12-02 14:39:09,676 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 14:39:09,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:39:09,676 INFO L85 PathProgramCache]: Analyzing trace with hash -1627547032, now seen corresponding path program 1 times [2024-12-02 14:39:09,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:39:09,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545394321] [2024-12-02 14:39:09,677 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:39:09,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:39:09,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:39:09,942 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:39:09,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:39:09,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545394321] [2024-12-02 14:39:09,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [545394321] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 14:39:09,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1976714198] [2024-12-02 14:39:09,942 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:39:09,943 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 14:39:09,943 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_deece62d-eb9a-4fa9-9dff-416e8fe1102f/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 14:39:09,945 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_deece62d-eb9a-4fa9-9dff-416e8fe1102f/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 14:39:09,946 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_deece62d-eb9a-4fa9-9dff-416e8fe1102f/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-12-02 14:39:10,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:39:10,106 INFO L256 TraceCheckSpWp]: Trace formula consists of 465 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-12-02 14:39:10,110 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 14:39:11,388 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:39:11,389 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 14:39:12,627 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:39:12,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1976714198] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 14:39:12,628 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 14:39:12,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 13, 14] total 31 [2024-12-02 14:39:12,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217613358] [2024-12-02 14:39:12,628 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 14:39:12,628 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-12-02 14:39:12,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:39:12,629 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-12-02 14:39:12,629 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=837, Unknown=0, NotChecked=0, Total=992 [2024-12-02 14:39:12,629 INFO L87 Difference]: Start difference. First operand 15825 states and 20015 transitions. Second operand has 32 states, 32 states have (on average 7.75) internal successors, (248), 31 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:39:22,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:39:22,690 INFO L93 Difference]: Finished difference Result 109403 states and 137119 transitions. [2024-12-02 14:39:22,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 160 states. [2024-12-02 14:39:22,690 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 7.75) internal successors, (248), 31 states have internal predecessors, (248), 0 states have call successors, (0), 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 95 [2024-12-02 14:39:22,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:39:22,767 INFO L225 Difference]: With dead ends: 109403 [2024-12-02 14:39:22,767 INFO L226 Difference]: Without dead ends: 101501 [2024-12-02 14:39:22,788 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 355 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 188 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13840 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=6648, Invalid=29262, Unknown=0, NotChecked=0, Total=35910 [2024-12-02 14:39:22,788 INFO L435 NwaCegarLoop]: 275 mSDtfsCounter, 5018 mSDsluCounter, 4408 mSDsCounter, 0 mSdLazyCounter, 4730 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5018 SdHoareTripleChecker+Valid, 4683 SdHoareTripleChecker+Invalid, 4845 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 4730 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-12-02 14:39:22,788 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5018 Valid, 4683 Invalid, 4845 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 4730 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-12-02 14:39:22,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101501 states. [2024-12-02 14:39:23,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101501 to 32810. [2024-12-02 14:39:23,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32810 states, 32809 states have (on average 1.2658416897802431) internal successors, (41531), 32809 states have internal predecessors, (41531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:39:23,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32810 states to 32810 states and 41531 transitions. [2024-12-02 14:39:23,401 INFO L78 Accepts]: Start accepts. Automaton has 32810 states and 41531 transitions. Word has length 95 [2024-12-02 14:39:23,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:39:23,402 INFO L471 AbstractCegarLoop]: Abstraction has 32810 states and 41531 transitions. [2024-12-02 14:39:23,402 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 7.75) internal successors, (248), 31 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:39:23,402 INFO L276 IsEmpty]: Start isEmpty. Operand 32810 states and 41531 transitions. [2024-12-02 14:39:23,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-12-02 14:39:23,406 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:39:23,406 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 14:39:23,416 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_deece62d-eb9a-4fa9-9dff-416e8fe1102f/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-12-02 14:39:23,606 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_deece62d-eb9a-4fa9-9dff-416e8fe1102f/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2024-12-02 14:39:23,607 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 14:39:23,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:39:23,607 INFO L85 PathProgramCache]: Analyzing trace with hash 1724852386, now seen corresponding path program 1 times [2024-12-02 14:39:23,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:39:23,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92873268] [2024-12-02 14:39:23,607 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:39:23,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:39:23,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:39:23,789 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:39:23,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:39:23,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92873268] [2024-12-02 14:39:23,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [92873268] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 14:39:23,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1932504756] [2024-12-02 14:39:23,790 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:39:23,790 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 14:39:23,790 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_deece62d-eb9a-4fa9-9dff-416e8fe1102f/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 14:39:23,792 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_deece62d-eb9a-4fa9-9dff-416e8fe1102f/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 14:39:23,794 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_deece62d-eb9a-4fa9-9dff-416e8fe1102f/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-12-02 14:39:23,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:39:23,948 INFO L256 TraceCheckSpWp]: Trace formula consists of 465 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-12-02 14:39:23,951 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 14:39:24,427 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:39:24,427 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-12-02 14:39:24,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1932504756] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 14:39:24,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-12-02 14:39:24,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [5] total 15 [2024-12-02 14:39:24,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343843317] [2024-12-02 14:39:24,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 14:39:24,428 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-12-02 14:39:24,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:39:24,428 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-12-02 14:39:24,428 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2024-12-02 14:39:24,429 INFO L87 Difference]: Start difference. First operand 32810 states and 41531 transitions. Second operand has 12 states, 12 states have (on average 7.916666666666667) internal successors, (95), 11 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:39:25,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:39:25,303 INFO L93 Difference]: Finished difference Result 66972 states and 84717 transitions. [2024-12-02 14:39:25,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-12-02 14:39:25,303 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 7.916666666666667) internal successors, (95), 11 states have internal predecessors, (95), 0 states have call successors, (0), 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 95 [2024-12-02 14:39:25,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:39:25,341 INFO L225 Difference]: With dead ends: 66972 [2024-12-02 14:39:25,341 INFO L226 Difference]: Without dead ends: 53864 [2024-12-02 14:39:25,353 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=97, Invalid=455, Unknown=0, NotChecked=0, Total=552 [2024-12-02 14:39:25,353 INFO L435 NwaCegarLoop]: 192 mSDtfsCounter, 390 mSDsluCounter, 1522 mSDsCounter, 0 mSdLazyCounter, 1187 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 390 SdHoareTripleChecker+Valid, 1714 SdHoareTripleChecker+Invalid, 1192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-12-02 14:39:25,353 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [390 Valid, 1714 Invalid, 1192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1187 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-12-02 14:39:25,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53864 states. [2024-12-02 14:39:25,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53864 to 47708. [2024-12-02 14:39:25,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47708 states, 47707 states have (on average 1.2653908231496427) internal successors, (60368), 47707 states have internal predecessors, (60368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:39:25,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47708 states to 47708 states and 60368 transitions. [2024-12-02 14:39:25,807 INFO L78 Accepts]: Start accepts. Automaton has 47708 states and 60368 transitions. Word has length 95 [2024-12-02 14:39:25,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:39:25,807 INFO L471 AbstractCegarLoop]: Abstraction has 47708 states and 60368 transitions. [2024-12-02 14:39:25,807 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.916666666666667) internal successors, (95), 11 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:39:25,807 INFO L276 IsEmpty]: Start isEmpty. Operand 47708 states and 60368 transitions. [2024-12-02 14:39:25,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-12-02 14:39:25,810 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:39:25,810 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 14:39:25,816 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_deece62d-eb9a-4fa9-9dff-416e8fe1102f/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-12-02 14:39:26,011 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_deece62d-eb9a-4fa9-9dff-416e8fe1102f/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 14:39:26,011 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 14:39:26,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:39:26,011 INFO L85 PathProgramCache]: Analyzing trace with hash -1342062746, now seen corresponding path program 1 times [2024-12-02 14:39:26,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:39:26,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359755719] [2024-12-02 14:39:26,012 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:39:26,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:39:26,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:39:26,101 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:39:26,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:39:26,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359755719] [2024-12-02 14:39:26,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1359755719] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 14:39:26,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 14:39:26,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-02 14:39:26,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603533621] [2024-12-02 14:39:26,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 14:39:26,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 14:39:26,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:39:26,102 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 14:39:26,102 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 14:39:26,102 INFO L87 Difference]: Start difference. First operand 47708 states and 60368 transitions. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:39:26,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:39:26,321 INFO L93 Difference]: Finished difference Result 94864 states and 120129 transitions. [2024-12-02 14:39:26,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 14:39:26,321 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 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 96 [2024-12-02 14:39:26,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:39:26,379 INFO L225 Difference]: With dead ends: 94864 [2024-12-02 14:39:26,379 INFO L226 Difference]: Without dead ends: 47710 [2024-12-02 14:39:26,406 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 14:39:26,406 INFO L435 NwaCegarLoop]: 207 mSDtfsCounter, 87 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 14:39:26,407 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 341 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 14:39:26,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47710 states. [2024-12-02 14:39:26,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47710 to 46027. [2024-12-02 14:39:26,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46027 states, 46026 states have (on average 1.246317298918003) internal successors, (57363), 46026 states have internal predecessors, (57363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:39:26,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46027 states to 46027 states and 57363 transitions. [2024-12-02 14:39:26,999 INFO L78 Accepts]: Start accepts. Automaton has 46027 states and 57363 transitions. Word has length 96 [2024-12-02 14:39:26,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:39:27,000 INFO L471 AbstractCegarLoop]: Abstraction has 46027 states and 57363 transitions. [2024-12-02 14:39:27,000 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:39:27,000 INFO L276 IsEmpty]: Start isEmpty. Operand 46027 states and 57363 transitions. [2024-12-02 14:39:27,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-12-02 14:39:27,003 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:39:27,003 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 14:39:27,003 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-12-02 14:39:27,003 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 14:39:27,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:39:27,004 INFO L85 PathProgramCache]: Analyzing trace with hash -1487690829, now seen corresponding path program 1 times [2024-12-02 14:39:27,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:39:27,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65874649] [2024-12-02 14:39:27,004 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:39:27,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:39:27,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:39:27,386 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:39:27,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:39:27,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65874649] [2024-12-02 14:39:27,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [65874649] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 14:39:27,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1008731303] [2024-12-02 14:39:27,387 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:39:27,387 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 14:39:27,387 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_deece62d-eb9a-4fa9-9dff-416e8fe1102f/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 14:39:27,389 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_deece62d-eb9a-4fa9-9dff-416e8fe1102f/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 14:39:27,396 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_deece62d-eb9a-4fa9-9dff-416e8fe1102f/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-12-02 14:39:27,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:39:27,604 INFO L256 TraceCheckSpWp]: Trace formula consists of 468 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-12-02 14:39:27,609 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 14:39:27,948 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:39:27,948 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 14:39:28,539 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:39:28,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1008731303] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 14:39:28,539 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 14:39:28,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 10, 9] total 19 [2024-12-02 14:39:28,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380722432] [2024-12-02 14:39:28,540 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 14:39:28,540 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-12-02 14:39:28,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:39:28,541 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-12-02 14:39:28,541 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=239, Unknown=0, NotChecked=0, Total=342 [2024-12-02 14:39:28,541 INFO L87 Difference]: Start difference. First operand 46027 states and 57363 transitions. Second operand has 19 states, 19 states have (on average 13.68421052631579) internal successors, (260), 19 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:39:29,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:39:29,725 INFO L93 Difference]: Finished difference Result 179878 states and 224454 transitions. [2024-12-02 14:39:29,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-12-02 14:39:29,726 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 13.68421052631579) internal successors, (260), 19 states have internal predecessors, (260), 0 states have call successors, (0), 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 96 [2024-12-02 14:39:29,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:39:29,819 INFO L225 Difference]: With dead ends: 179878 [2024-12-02 14:39:29,819 INFO L226 Difference]: Without dead ends: 134405 [2024-12-02 14:39:29,840 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 633 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=501, Invalid=1479, Unknown=0, NotChecked=0, Total=1980 [2024-12-02 14:39:29,840 INFO L435 NwaCegarLoop]: 419 mSDtfsCounter, 3127 mSDsluCounter, 2529 mSDsCounter, 0 mSdLazyCounter, 335 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3127 SdHoareTripleChecker+Valid, 2948 SdHoareTripleChecker+Invalid, 374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 335 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-12-02 14:39:29,840 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3127 Valid, 2948 Invalid, 374 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 335 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-12-02 14:39:29,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134405 states. [2024-12-02 14:39:30,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134405 to 122420. [2024-12-02 14:39:30,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122420 states, 122419 states have (on average 1.2341303229073919) internal successors, (151081), 122419 states have internal predecessors, (151081), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:39:30,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122420 states to 122420 states and 151081 transitions. [2024-12-02 14:39:30,832 INFO L78 Accepts]: Start accepts. Automaton has 122420 states and 151081 transitions. Word has length 96 [2024-12-02 14:39:30,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:39:30,832 INFO L471 AbstractCegarLoop]: Abstraction has 122420 states and 151081 transitions. [2024-12-02 14:39:30,833 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 13.68421052631579) internal successors, (260), 19 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:39:30,833 INFO L276 IsEmpty]: Start isEmpty. Operand 122420 states and 151081 transitions. [2024-12-02 14:39:30,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-12-02 14:39:30,838 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:39:30,838 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 14:39:30,843 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_deece62d-eb9a-4fa9-9dff-416e8fe1102f/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-12-02 14:39:31,038 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_deece62d-eb9a-4fa9-9dff-416e8fe1102f/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 14:39:31,038 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 14:39:31,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:39:31,039 INFO L85 PathProgramCache]: Analyzing trace with hash 1839550213, now seen corresponding path program 1 times [2024-12-02 14:39:31,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:39:31,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236806544] [2024-12-02 14:39:31,039 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:39:31,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:39:31,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:39:31,248 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:39:31,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:39:31,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236806544] [2024-12-02 14:39:31,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [236806544] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 14:39:31,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [801271958] [2024-12-02 14:39:31,248 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:39:31,248 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 14:39:31,248 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_deece62d-eb9a-4fa9-9dff-416e8fe1102f/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 14:39:31,250 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_deece62d-eb9a-4fa9-9dff-416e8fe1102f/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 14:39:31,254 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_deece62d-eb9a-4fa9-9dff-416e8fe1102f/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-12-02 14:39:31,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:39:31,395 INFO L256 TraceCheckSpWp]: Trace formula consists of 484 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-12-02 14:39:31,396 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 14:39:31,647 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:39:31,647 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 14:39:31,770 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:39:31,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [801271958] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 14:39:31,770 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 14:39:31,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 14 [2024-12-02 14:39:31,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329674085] [2024-12-02 14:39:31,770 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 14:39:31,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-12-02 14:39:31,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:39:31,771 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-12-02 14:39:31,771 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2024-12-02 14:39:31,771 INFO L87 Difference]: Start difference. First operand 122420 states and 151081 transitions. Second operand has 14 states, 14 states have (on average 19.928571428571427) internal successors, (279), 14 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:39:32,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:39:32,540 INFO L93 Difference]: Finished difference Result 216011 states and 266697 transitions. [2024-12-02 14:39:32,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-12-02 14:39:32,540 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 19.928571428571427) internal successors, (279), 14 states have internal predecessors, (279), 0 states have call successors, (0), 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 105 [2024-12-02 14:39:32,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:39:32,612 INFO L225 Difference]: With dead ends: 216011 [2024-12-02 14:39:32,613 INFO L226 Difference]: Without dead ends: 94089 [2024-12-02 14:39:32,648 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 203 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=253, Unknown=0, NotChecked=0, Total=342 [2024-12-02 14:39:32,648 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 1631 mSDsluCounter, 641 mSDsCounter, 0 mSdLazyCounter, 528 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1631 SdHoareTripleChecker+Valid, 750 SdHoareTripleChecker+Invalid, 569 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 528 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-12-02 14:39:32,648 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1631 Valid, 750 Invalid, 569 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 528 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-12-02 14:39:32,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94089 states. [2024-12-02 14:39:33,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94089 to 93690. [2024-12-02 14:39:33,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93690 states, 93689 states have (on average 1.209469628238107) internal successors, (113314), 93689 states have internal predecessors, (113314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:39:33,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93690 states to 93690 states and 113314 transitions. [2024-12-02 14:39:33,590 INFO L78 Accepts]: Start accepts. Automaton has 93690 states and 113314 transitions. Word has length 105 [2024-12-02 14:39:33,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:39:33,591 INFO L471 AbstractCegarLoop]: Abstraction has 93690 states and 113314 transitions. [2024-12-02 14:39:33,591 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 19.928571428571427) internal successors, (279), 14 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:39:33,591 INFO L276 IsEmpty]: Start isEmpty. Operand 93690 states and 113314 transitions. [2024-12-02 14:39:33,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-12-02 14:39:33,598 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:39:33,598 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 14:39:33,603 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_deece62d-eb9a-4fa9-9dff-416e8fe1102f/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-12-02 14:39:33,798 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_deece62d-eb9a-4fa9-9dff-416e8fe1102f/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2024-12-02 14:39:33,798 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 14:39:33,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:39:33,799 INFO L85 PathProgramCache]: Analyzing trace with hash -39169075, now seen corresponding path program 1 times [2024-12-02 14:39:33,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:39:33,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968351557] [2024-12-02 14:39:33,799 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:39:33,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:39:33,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:39:33,914 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:39:33,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:39:33,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968351557] [2024-12-02 14:39:33,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1968351557] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 14:39:33,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 14:39:33,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-12-02 14:39:33,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001182709] [2024-12-02 14:39:33,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 14:39:33,915 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-02 14:39:33,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:39:33,915 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-02 14:39:33,915 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-12-02 14:39:33,915 INFO L87 Difference]: Start difference. First operand 93690 states and 113314 transitions. Second operand has 5 states, 5 states have (on average 21.2) internal successors, (106), 5 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:39:34,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:39:34,348 INFO L93 Difference]: Finished difference Result 178239 states and 215350 transitions. [2024-12-02 14:39:34,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-12-02 14:39:34,349 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.2) internal successors, (106), 5 states have internal predecessors, (106), 0 states have call successors, (0), 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 106 [2024-12-02 14:39:34,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:39:34,431 INFO L225 Difference]: With dead ends: 178239 [2024-12-02 14:39:34,431 INFO L226 Difference]: Without dead ends: 85089 [2024-12-02 14:39:34,475 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-12-02 14:39:34,475 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 327 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 327 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-12-02 14:39:34,476 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [327 Valid, 327 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-12-02 14:39:34,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85089 states. [2024-12-02 14:39:35,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85089 to 83933. [2024-12-02 14:39:35,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83933 states, 83932 states have (on average 1.186257923080589) internal successors, (99565), 83932 states have internal predecessors, (99565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:39:35,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83933 states to 83933 states and 99565 transitions. [2024-12-02 14:39:35,377 INFO L78 Accepts]: Start accepts. Automaton has 83933 states and 99565 transitions. Word has length 106 [2024-12-02 14:39:35,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:39:35,377 INFO L471 AbstractCegarLoop]: Abstraction has 83933 states and 99565 transitions. [2024-12-02 14:39:35,377 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.2) internal successors, (106), 5 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:39:35,378 INFO L276 IsEmpty]: Start isEmpty. Operand 83933 states and 99565 transitions. [2024-12-02 14:39:35,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-12-02 14:39:35,382 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:39:35,382 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 14:39:35,382 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-12-02 14:39:35,382 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 14:39:35,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:39:35,382 INFO L85 PathProgramCache]: Analyzing trace with hash 263677056, now seen corresponding path program 1 times [2024-12-02 14:39:35,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:39:35,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635478828] [2024-12-02 14:39:35,383 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:39:35,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:39:35,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:39:35,463 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:39:35,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:39:35,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635478828] [2024-12-02 14:39:35,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [635478828] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 14:39:35,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1488583773] [2024-12-02 14:39:35,463 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:39:35,463 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 14:39:35,464 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_deece62d-eb9a-4fa9-9dff-416e8fe1102f/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 14:39:35,465 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_deece62d-eb9a-4fa9-9dff-416e8fe1102f/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 14:39:35,467 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_deece62d-eb9a-4fa9-9dff-416e8fe1102f/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-12-02 14:39:35,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:39:35,629 INFO L256 TraceCheckSpWp]: Trace formula consists of 488 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-12-02 14:39:35,631 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 14:39:35,877 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:39:35,878 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 14:39:36,011 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:39:36,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1488583773] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 14:39:36,011 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 14:39:36,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 14 [2024-12-02 14:39:36,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077579012] [2024-12-02 14:39:36,011 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 14:39:36,012 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-12-02 14:39:36,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:39:36,012 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-12-02 14:39:36,012 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2024-12-02 14:39:36,013 INFO L87 Difference]: Start difference. First operand 83933 states and 99565 transitions. Second operand has 14 states, 14 states have (on average 21.071428571428573) internal successors, (295), 14 states have internal predecessors, (295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:39:36,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:39:36,489 INFO L93 Difference]: Finished difference Result 180540 states and 214391 transitions. [2024-12-02 14:39:36,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-12-02 14:39:36,489 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 21.071428571428573) internal successors, (295), 14 states have internal predecessors, (295), 0 states have call successors, (0), 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 107 [2024-12-02 14:39:36,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:39:36,561 INFO L225 Difference]: With dead ends: 180540 [2024-12-02 14:39:36,561 INFO L226 Difference]: Without dead ends: 97147 [2024-12-02 14:39:36,595 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 207 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=253, Unknown=0, NotChecked=0, Total=342 [2024-12-02 14:39:36,595 INFO L435 NwaCegarLoop]: 125 mSDtfsCounter, 1036 mSDsluCounter, 563 mSDsCounter, 0 mSdLazyCounter, 494 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1036 SdHoareTripleChecker+Valid, 688 SdHoareTripleChecker+Invalid, 522 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 494 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-12-02 14:39:36,595 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1036 Valid, 688 Invalid, 522 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 494 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-12-02 14:39:36,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97147 states. [2024-12-02 14:39:37,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97147 to 81968. [2024-12-02 14:39:37,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81968 states, 81967 states have (on average 1.1607476179438068) internal successors, (95143), 81967 states have internal predecessors, (95143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:39:37,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81968 states to 81968 states and 95143 transitions. [2024-12-02 14:39:37,427 INFO L78 Accepts]: Start accepts. Automaton has 81968 states and 95143 transitions. Word has length 107 [2024-12-02 14:39:37,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:39:37,428 INFO L471 AbstractCegarLoop]: Abstraction has 81968 states and 95143 transitions. [2024-12-02 14:39:37,428 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 21.071428571428573) internal successors, (295), 14 states have internal predecessors, (295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:39:37,428 INFO L276 IsEmpty]: Start isEmpty. Operand 81968 states and 95143 transitions. [2024-12-02 14:39:37,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-12-02 14:39:37,434 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:39:37,434 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 14:39:37,439 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_deece62d-eb9a-4fa9-9dff-416e8fe1102f/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-12-02 14:39:37,634 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_deece62d-eb9a-4fa9-9dff-416e8fe1102f/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2024-12-02 14:39:37,634 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 14:39:37,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:39:37,635 INFO L85 PathProgramCache]: Analyzing trace with hash -1946151591, now seen corresponding path program 1 times [2024-12-02 14:39:37,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:39:37,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324266419] [2024-12-02 14:39:37,635 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:39:37,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:39:37,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:39:37,966 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:39:37,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:39:37,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324266419] [2024-12-02 14:39:37,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1324266419] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 14:39:37,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [910482060] [2024-12-02 14:39:37,966 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:39:37,966 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 14:39:37,966 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_deece62d-eb9a-4fa9-9dff-416e8fe1102f/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 14:39:37,968 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_deece62d-eb9a-4fa9-9dff-416e8fe1102f/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 14:39:37,970 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_deece62d-eb9a-4fa9-9dff-416e8fe1102f/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-12-02 14:39:38,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:39:38,140 INFO L256 TraceCheckSpWp]: Trace formula consists of 494 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-12-02 14:39:38,142 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 14:39:39,214 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:39:39,214 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 14:39:40,216 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:39:40,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [910482060] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 14:39:40,216 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 14:39:40,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 15, 16] total 36 [2024-12-02 14:39:40,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767158404] [2024-12-02 14:39:40,216 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 14:39:40,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2024-12-02 14:39:40,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:39:40,217 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2024-12-02 14:39:40,217 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=1160, Unknown=0, NotChecked=0, Total=1332 [2024-12-02 14:39:40,218 INFO L87 Difference]: Start difference. First operand 81968 states and 95143 transitions. Second operand has 37 states, 37 states have (on average 8.0) internal successors, (296), 36 states have internal predecessors, (296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:39:42,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:39:42,873 INFO L93 Difference]: Finished difference Result 277437 states and 323688 transitions. [2024-12-02 14:39:42,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-12-02 14:39:42,874 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 8.0) internal successors, (296), 36 states have internal predecessors, (296), 0 states have call successors, (0), 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 109 [2024-12-02 14:39:42,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:39:43,046 INFO L225 Difference]: With dead ends: 277437 [2024-12-02 14:39:43,047 INFO L226 Difference]: Without dead ends: 210219 [2024-12-02 14:39:43,093 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 189 SyntacticMatches, 1 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1135 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=854, Invalid=3568, Unknown=0, NotChecked=0, Total=4422 [2024-12-02 14:39:43,093 INFO L435 NwaCegarLoop]: 198 mSDtfsCounter, 2659 mSDsluCounter, 3118 mSDsCounter, 0 mSdLazyCounter, 2753 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2659 SdHoareTripleChecker+Valid, 3316 SdHoareTripleChecker+Invalid, 2802 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 2753 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-12-02 14:39:43,093 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2659 Valid, 3316 Invalid, 2802 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 2753 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-12-02 14:39:43,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210219 states. [2024-12-02 14:39:44,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210219 to 83022. [2024-12-02 14:39:44,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83022 states, 83021 states have (on average 1.1606220112983463) internal successors, (96356), 83021 states have internal predecessors, (96356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:39:44,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83022 states to 83022 states and 96356 transitions. [2024-12-02 14:39:44,242 INFO L78 Accepts]: Start accepts. Automaton has 83022 states and 96356 transitions. Word has length 109 [2024-12-02 14:39:44,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:39:44,242 INFO L471 AbstractCegarLoop]: Abstraction has 83022 states and 96356 transitions. [2024-12-02 14:39:44,242 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 8.0) internal successors, (296), 36 states have internal predecessors, (296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:39:44,242 INFO L276 IsEmpty]: Start isEmpty. Operand 83022 states and 96356 transitions. [2024-12-02 14:39:44,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-12-02 14:39:44,246 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:39:44,246 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 14:39:44,255 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_deece62d-eb9a-4fa9-9dff-416e8fe1102f/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-12-02 14:39:44,447 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_deece62d-eb9a-4fa9-9dff-416e8fe1102f/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2024-12-02 14:39:44,447 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 14:39:44,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:39:44,447 INFO L85 PathProgramCache]: Analyzing trace with hash -1831109222, now seen corresponding path program 1 times [2024-12-02 14:39:44,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:39:44,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500755031] [2024-12-02 14:39:44,448 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:39:44,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:39:44,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:39:45,193 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:39:45,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:39:45,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500755031] [2024-12-02 14:39:45,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500755031] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 14:39:45,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [732597477] [2024-12-02 14:39:45,194 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:39:45,194 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 14:39:45,194 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_deece62d-eb9a-4fa9-9dff-416e8fe1102f/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 14:39:45,198 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_deece62d-eb9a-4fa9-9dff-416e8fe1102f/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 14:39:45,202 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_deece62d-eb9a-4fa9-9dff-416e8fe1102f/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-12-02 14:39:45,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:39:45,415 INFO L256 TraceCheckSpWp]: Trace formula consists of 494 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-12-02 14:39:45,419 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 14:39:46,074 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:39:46,074 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 14:39:46,816 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:39:46,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [732597477] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 14:39:46,816 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 14:39:46,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12, 12] total 36 [2024-12-02 14:39:46,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528651125] [2024-12-02 14:39:46,817 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 14:39:46,817 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2024-12-02 14:39:46,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:39:46,817 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2024-12-02 14:39:46,817 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=1161, Unknown=0, NotChecked=0, Total=1260 [2024-12-02 14:39:46,818 INFO L87 Difference]: Start difference. First operand 83022 states and 96356 transitions. Second operand has 36 states, 36 states have (on average 8.444444444444445) internal successors, (304), 36 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:39:59,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:39:59,692 INFO L93 Difference]: Finished difference Result 264532 states and 307312 transitions. [2024-12-02 14:39:59,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 148 states. [2024-12-02 14:39:59,693 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 8.444444444444445) internal successors, (304), 36 states have internal predecessors, (304), 0 states have call successors, (0), 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 110 [2024-12-02 14:39:59,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:39:59,889 INFO L225 Difference]: With dead ends: 264532 [2024-12-02 14:39:59,889 INFO L226 Difference]: Without dead ends: 240160 [2024-12-02 14:40:00,039 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 380 GetRequests, 200 SyntacticMatches, 0 SemanticMatches, 180 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10803 ImplicationChecksByTransitivity, 10.0s TimeCoverageRelationStatistics Valid=4270, Invalid=28672, Unknown=0, NotChecked=0, Total=32942 [2024-12-02 14:40:00,039 INFO L435 NwaCegarLoop]: 264 mSDtfsCounter, 7587 mSDsluCounter, 4963 mSDsCounter, 0 mSdLazyCounter, 5073 mSolverCounterSat, 148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7587 SdHoareTripleChecker+Valid, 5227 SdHoareTripleChecker+Invalid, 5221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 148 IncrementalHoareTripleChecker+Valid, 5073 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-12-02 14:40:00,040 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7587 Valid, 5227 Invalid, 5221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 5073 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-12-02 14:40:00,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240160 states. [2024-12-02 14:40:00,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240160 to 82963. [2024-12-02 14:40:01,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82963 states, 82962 states have (on average 1.1606157035751308) internal successors, (96287), 82962 states have internal predecessors, (96287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:40:01,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82963 states to 82963 states and 96287 transitions. [2024-12-02 14:40:01,096 INFO L78 Accepts]: Start accepts. Automaton has 82963 states and 96287 transitions. Word has length 110 [2024-12-02 14:40:01,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:40:01,096 INFO L471 AbstractCegarLoop]: Abstraction has 82963 states and 96287 transitions. [2024-12-02 14:40:01,096 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 8.444444444444445) internal successors, (304), 36 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:40:01,096 INFO L276 IsEmpty]: Start isEmpty. Operand 82963 states and 96287 transitions. [2024-12-02 14:40:01,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-12-02 14:40:01,099 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:40:01,100 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 14:40:01,105 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_deece62d-eb9a-4fa9-9dff-416e8fe1102f/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-12-02 14:40:01,300 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_deece62d-eb9a-4fa9-9dff-416e8fe1102f/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2024-12-02 14:40:01,300 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 14:40:01,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:40:01,301 INFO L85 PathProgramCache]: Analyzing trace with hash -568306696, now seen corresponding path program 1 times [2024-12-02 14:40:01,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:40:01,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955313928] [2024-12-02 14:40:01,301 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:40:01,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:40:01,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:40:01,371 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-12-02 14:40:01,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:40:01,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955313928] [2024-12-02 14:40:01,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1955313928] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 14:40:01,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 14:40:01,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-12-02 14:40:01,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264011040] [2024-12-02 14:40:01,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 14:40:01,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-12-02 14:40:01,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:40:01,372 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-12-02 14:40:01,372 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-12-02 14:40:01,372 INFO L87 Difference]: Start difference. First operand 82963 states and 96287 transitions. Second operand has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:40:01,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:40:01,657 INFO L93 Difference]: Finished difference Result 147075 states and 171076 transitions. [2024-12-02 14:40:01,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-02 14:40:01,658 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 0 states have call successors, (0), 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 110 [2024-12-02 14:40:01,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:40:01,750 INFO L225 Difference]: With dead ends: 147075 [2024-12-02 14:40:01,750 INFO L226 Difference]: Without dead ends: 111822 [2024-12-02 14:40:01,775 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-12-02 14:40:01,776 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 115 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 372 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-12-02 14:40:01,776 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 372 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-12-02 14:40:01,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111822 states. [2024-12-02 14:40:02,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111822 to 78602. [2024-12-02 14:40:02,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78602 states, 78601 states have (on average 1.1603033040292108) internal successors, (91201), 78601 states have internal predecessors, (91201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:40:02,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78602 states to 78602 states and 91201 transitions. [2024-12-02 14:40:02,607 INFO L78 Accepts]: Start accepts. Automaton has 78602 states and 91201 transitions. Word has length 110 [2024-12-02 14:40:02,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:40:02,607 INFO L471 AbstractCegarLoop]: Abstraction has 78602 states and 91201 transitions. [2024-12-02 14:40:02,607 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:40:02,607 INFO L276 IsEmpty]: Start isEmpty. Operand 78602 states and 91201 transitions. [2024-12-02 14:40:02,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-12-02 14:40:02,610 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:40:02,610 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 14:40:02,610 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-12-02 14:40:02,610 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 14:40:02,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:40:02,611 INFO L85 PathProgramCache]: Analyzing trace with hash 1090914717, now seen corresponding path program 1 times [2024-12-02 14:40:02,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:40:02,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404735793] [2024-12-02 14:40:02,611 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:40:02,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:40:02,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:40:03,038 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:40:03,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:40:03,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404735793] [2024-12-02 14:40:03,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1404735793] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 14:40:03,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1123256395] [2024-12-02 14:40:03,038 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:40:03,038 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 14:40:03,038 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_deece62d-eb9a-4fa9-9dff-416e8fe1102f/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 14:40:03,040 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_deece62d-eb9a-4fa9-9dff-416e8fe1102f/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 14:40:03,041 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_deece62d-eb9a-4fa9-9dff-416e8fe1102f/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-12-02 14:40:03,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:40:03,178 INFO L256 TraceCheckSpWp]: Trace formula consists of 494 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-12-02 14:40:03,179 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 14:40:03,773 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:40:03,773 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-12-02 14:40:03,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1123256395] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 14:40:03,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-12-02 14:40:03,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [14] total 26 [2024-12-02 14:40:03,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424807563] [2024-12-02 14:40:03,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 14:40:03,774 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-12-02 14:40:03,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:40:03,774 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-12-02 14:40:03,775 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=581, Unknown=0, NotChecked=0, Total=650 [2024-12-02 14:40:03,775 INFO L87 Difference]: Start difference. First operand 78602 states and 91201 transitions. Second operand has 13 states, 13 states have (on average 8.461538461538462) internal successors, (110), 13 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:40:04,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:40:04,509 INFO L93 Difference]: Finished difference Result 124747 states and 145158 transitions. [2024-12-02 14:40:04,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-12-02 14:40:04,510 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 8.461538461538462) internal successors, (110), 13 states have internal predecessors, (110), 0 states have call successors, (0), 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 110 [2024-12-02 14:40:04,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:40:04,574 INFO L225 Difference]: With dead ends: 124747 [2024-12-02 14:40:04,574 INFO L226 Difference]: Without dead ends: 92601 [2024-12-02 14:40:04,596 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=99, Invalid=831, Unknown=0, NotChecked=0, Total=930 [2024-12-02 14:40:04,596 INFO L435 NwaCegarLoop]: 300 mSDtfsCounter, 265 mSDsluCounter, 2362 mSDsCounter, 0 mSdLazyCounter, 389 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 2662 SdHoareTripleChecker+Invalid, 391 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 389 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-12-02 14:40:04,597 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [265 Valid, 2662 Invalid, 391 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 389 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-12-02 14:40:04,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92601 states. [2024-12-02 14:40:05,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92601 to 92309. [2024-12-02 14:40:05,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92309 states, 92308 states have (on average 1.1591303028989903) internal successors, (106997), 92308 states have internal predecessors, (106997), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:40:05,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92309 states to 92309 states and 106997 transitions. [2024-12-02 14:40:05,368 INFO L78 Accepts]: Start accepts. Automaton has 92309 states and 106997 transitions. Word has length 110 [2024-12-02 14:40:05,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:40:05,368 INFO L471 AbstractCegarLoop]: Abstraction has 92309 states and 106997 transitions. [2024-12-02 14:40:05,368 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 8.461538461538462) internal successors, (110), 13 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:40:05,368 INFO L276 IsEmpty]: Start isEmpty. Operand 92309 states and 106997 transitions. [2024-12-02 14:40:05,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-12-02 14:40:05,371 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:40:05,371 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 14:40:05,377 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_deece62d-eb9a-4fa9-9dff-416e8fe1102f/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-12-02 14:40:05,572 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_deece62d-eb9a-4fa9-9dff-416e8fe1102f/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2024-12-02 14:40:05,572 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 14:40:05,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:40:05,573 INFO L85 PathProgramCache]: Analyzing trace with hash 681497265, now seen corresponding path program 1 times [2024-12-02 14:40:05,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:40:05,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041598473] [2024-12-02 14:40:05,573 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:40:05,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:40:05,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:40:06,009 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:40:06,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:40:06,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041598473] [2024-12-02 14:40:06,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041598473] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 14:40:06,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [330949052] [2024-12-02 14:40:06,009 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:40:06,009 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 14:40:06,009 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_deece62d-eb9a-4fa9-9dff-416e8fe1102f/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 14:40:06,011 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_deece62d-eb9a-4fa9-9dff-416e8fe1102f/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 14:40:06,012 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_deece62d-eb9a-4fa9-9dff-416e8fe1102f/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-12-02 14:40:06,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:40:06,150 INFO L256 TraceCheckSpWp]: Trace formula consists of 497 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-12-02 14:40:06,152 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 14:40:07,344 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:40:07,344 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 14:40:07,956 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:40:07,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [330949052] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 14:40:07,957 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 14:40:07,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 14] total 38 [2024-12-02 14:40:07,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180541898] [2024-12-02 14:40:07,957 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 14:40:07,957 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2024-12-02 14:40:07,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:40:07,958 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2024-12-02 14:40:07,958 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=1268, Unknown=0, NotChecked=0, Total=1406 [2024-12-02 14:40:07,958 INFO L87 Difference]: Start difference. First operand 92309 states and 106997 transitions. Second operand has 38 states, 38 states have (on average 7.315789473684211) internal successors, (278), 38 states have internal predecessors, (278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:40:09,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:40:09,212 INFO L93 Difference]: Finished difference Result 217762 states and 253316 transitions. [2024-12-02 14:40:09,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-12-02 14:40:09,212 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 7.315789473684211) internal successors, (278), 38 states have internal predecessors, (278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 111 [2024-12-02 14:40:09,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:40:09,363 INFO L225 Difference]: With dead ends: 217762 [2024-12-02 14:40:09,363 INFO L226 Difference]: Without dead ends: 193334 [2024-12-02 14:40:09,540 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 200 SyntacticMatches, 1 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 543 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=460, Invalid=2402, Unknown=0, NotChecked=0, Total=2862 [2024-12-02 14:40:09,541 INFO L435 NwaCegarLoop]: 290 mSDtfsCounter, 1852 mSDsluCounter, 4807 mSDsCounter, 0 mSdLazyCounter, 1171 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1852 SdHoareTripleChecker+Valid, 5097 SdHoareTripleChecker+Invalid, 1203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 1171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-12-02 14:40:09,541 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1852 Valid, 5097 Invalid, 1203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 1171 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-12-02 14:40:09,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193334 states. [2024-12-02 14:40:10,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193334 to 92345. [2024-12-02 14:40:10,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92345 states, 92344 states have (on average 1.1590682664818506) internal successors, (107033), 92344 states have internal predecessors, (107033), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:40:10,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92345 states to 92345 states and 107033 transitions. [2024-12-02 14:40:10,504 INFO L78 Accepts]: Start accepts. Automaton has 92345 states and 107033 transitions. Word has length 111 [2024-12-02 14:40:10,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:40:10,505 INFO L471 AbstractCegarLoop]: Abstraction has 92345 states and 107033 transitions. [2024-12-02 14:40:10,505 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 7.315789473684211) internal successors, (278), 38 states have internal predecessors, (278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:40:10,505 INFO L276 IsEmpty]: Start isEmpty. Operand 92345 states and 107033 transitions. [2024-12-02 14:40:10,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-12-02 14:40:10,508 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:40:10,508 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 14:40:10,517 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_deece62d-eb9a-4fa9-9dff-416e8fe1102f/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-12-02 14:40:10,708 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_deece62d-eb9a-4fa9-9dff-416e8fe1102f/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 14:40:10,708 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 14:40:10,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:40:10,709 INFO L85 PathProgramCache]: Analyzing trace with hash 205493406, now seen corresponding path program 1 times [2024-12-02 14:40:10,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:40:10,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459151576] [2024-12-02 14:40:10,709 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:40:10,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:40:10,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:40:11,023 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:40:11,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:40:11,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459151576] [2024-12-02 14:40:11,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [459151576] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 14:40:11,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 14:40:11,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-12-02 14:40:11,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547366665] [2024-12-02 14:40:11,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 14:40:11,024 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-12-02 14:40:11,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:40:11,025 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-12-02 14:40:11,025 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2024-12-02 14:40:11,025 INFO L87 Difference]: Start difference. First operand 92345 states and 107033 transitions. Second operand has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 11 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:40:11,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:40:11,807 INFO L93 Difference]: Finished difference Result 135815 states and 157817 transitions. [2024-12-02 14:40:11,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-12-02 14:40:11,807 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 11 states have internal predecessors, (112), 0 states have call successors, (0), 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 112 [2024-12-02 14:40:11,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:40:12,036 INFO L225 Difference]: With dead ends: 135815 [2024-12-02 14:40:12,036 INFO L226 Difference]: Without dead ends: 116685 [2024-12-02 14:40:12,046 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=131, Invalid=421, Unknown=0, NotChecked=0, Total=552 [2024-12-02 14:40:12,046 INFO L435 NwaCegarLoop]: 167 mSDtfsCounter, 738 mSDsluCounter, 898 mSDsCounter, 0 mSdLazyCounter, 810 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 738 SdHoareTripleChecker+Valid, 1065 SdHoareTripleChecker+Invalid, 829 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 810 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-12-02 14:40:12,046 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [738 Valid, 1065 Invalid, 829 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 810 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-12-02 14:40:12,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116685 states. [2024-12-02 14:40:13,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116685 to 92041. [2024-12-02 14:40:13,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92041 states, 92040 states have (on average 1.1592025206431986) internal successors, (106693), 92040 states have internal predecessors, (106693), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:40:13,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92041 states to 92041 states and 106693 transitions. [2024-12-02 14:40:13,105 INFO L78 Accepts]: Start accepts. Automaton has 92041 states and 106693 transitions. Word has length 112 [2024-12-02 14:40:13,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:40:13,106 INFO L471 AbstractCegarLoop]: Abstraction has 92041 states and 106693 transitions. [2024-12-02 14:40:13,106 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 11 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:40:13,106 INFO L276 IsEmpty]: Start isEmpty. Operand 92041 states and 106693 transitions. [2024-12-02 14:40:13,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-12-02 14:40:13,108 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:40:13,109 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 14:40:13,109 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-12-02 14:40:13,109 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 14:40:13,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:40:13,109 INFO L85 PathProgramCache]: Analyzing trace with hash -1597951393, now seen corresponding path program 1 times [2024-12-02 14:40:13,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:40:13,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681119028] [2024-12-02 14:40:13,109 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:40:13,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:40:13,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:40:13,525 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:40:13,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:40:13,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681119028] [2024-12-02 14:40:13,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [681119028] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 14:40:13,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [56395549] [2024-12-02 14:40:13,526 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:40:13,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 14:40:13,526 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_deece62d-eb9a-4fa9-9dff-416e8fe1102f/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 14:40:13,527 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_deece62d-eb9a-4fa9-9dff-416e8fe1102f/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 14:40:13,528 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_deece62d-eb9a-4fa9-9dff-416e8fe1102f/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-12-02 14:40:13,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:40:13,669 INFO L256 TraceCheckSpWp]: Trace formula consists of 496 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-12-02 14:40:13,671 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 14:40:15,241 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:40:15,241 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 14:40:16,160 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:40:16,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [56395549] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 14:40:16,160 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 14:40:16,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18, 16] total 46 [2024-12-02 14:40:16,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513527103] [2024-12-02 14:40:16,160 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 14:40:16,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2024-12-02 14:40:16,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:40:16,161 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2024-12-02 14:40:16,161 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=1898, Unknown=0, NotChecked=0, Total=2070 [2024-12-02 14:40:16,161 INFO L87 Difference]: Start difference. First operand 92041 states and 106693 transitions. Second operand has 46 states, 46 states have (on average 6.717391304347826) internal successors, (309), 46 states have internal predecessors, (309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:40:18,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:40:18,882 INFO L93 Difference]: Finished difference Result 264342 states and 307385 transitions. [2024-12-02 14:40:18,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2024-12-02 14:40:18,883 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 6.717391304347826) internal successors, (309), 46 states have internal predecessors, (309), 0 states have call successors, (0), 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 112 [2024-12-02 14:40:18,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:40:19,082 INFO L225 Difference]: With dead ends: 264342 [2024-12-02 14:40:19,083 INFO L226 Difference]: Without dead ends: 245080 [2024-12-02 14:40:19,126 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 196 SyntacticMatches, 1 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1229 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=816, Invalid=5036, Unknown=0, NotChecked=0, Total=5852 [2024-12-02 14:40:19,127 INFO L435 NwaCegarLoop]: 332 mSDtfsCounter, 4006 mSDsluCounter, 7462 mSDsCounter, 0 mSdLazyCounter, 2341 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4006 SdHoareTripleChecker+Valid, 7794 SdHoareTripleChecker+Invalid, 2384 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 2341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-12-02 14:40:19,127 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4006 Valid, 7794 Invalid, 2384 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 2341 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-12-02 14:40:19,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245080 states. [2024-12-02 14:40:20,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245080 to 92053. [2024-12-02 14:40:20,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92053 states, 92052 states have (on average 1.1591817668274453) internal successors, (106705), 92052 states have internal predecessors, (106705), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:40:20,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92053 states to 92053 states and 106705 transitions. [2024-12-02 14:40:20,496 INFO L78 Accepts]: Start accepts. Automaton has 92053 states and 106705 transitions. Word has length 112 [2024-12-02 14:40:20,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:40:20,496 INFO L471 AbstractCegarLoop]: Abstraction has 92053 states and 106705 transitions. [2024-12-02 14:40:20,497 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 6.717391304347826) internal successors, (309), 46 states have internal predecessors, (309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:40:20,497 INFO L276 IsEmpty]: Start isEmpty. Operand 92053 states and 106705 transitions. [2024-12-02 14:40:20,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-12-02 14:40:20,499 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:40:20,499 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 14:40:20,505 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_deece62d-eb9a-4fa9-9dff-416e8fe1102f/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-12-02 14:40:20,699 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_deece62d-eb9a-4fa9-9dff-416e8fe1102f/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 14:40:20,700 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 14:40:20,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:40:20,700 INFO L85 PathProgramCache]: Analyzing trace with hash -2130364509, now seen corresponding path program 1 times [2024-12-02 14:40:20,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:40:20,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054207154] [2024-12-02 14:40:20,700 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:40:20,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:40:20,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:40:21,152 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:40:21,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:40:21,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054207154] [2024-12-02 14:40:21,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2054207154] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 14:40:21,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1860479009] [2024-12-02 14:40:21,152 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:40:21,153 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 14:40:21,153 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_deece62d-eb9a-4fa9-9dff-416e8fe1102f/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 14:40:21,154 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_deece62d-eb9a-4fa9-9dff-416e8fe1102f/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 14:40:21,155 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_deece62d-eb9a-4fa9-9dff-416e8fe1102f/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-12-02 14:40:21,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:40:21,411 INFO L256 TraceCheckSpWp]: Trace formula consists of 496 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-12-02 14:40:21,413 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 14:40:22,567 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:40:22,567 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 14:40:23,424 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:40:23,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1860479009] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 14:40:23,425 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 14:40:23,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 19, 16] total 44 [2024-12-02 14:40:23,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234711117] [2024-12-02 14:40:23,425 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 14:40:23,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2024-12-02 14:40:23,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:40:23,426 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2024-12-02 14:40:23,426 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=1734, Unknown=0, NotChecked=0, Total=1892 [2024-12-02 14:40:23,426 INFO L87 Difference]: Start difference. First operand 92053 states and 106705 transitions. Second operand has 44 states, 44 states have (on average 6.4772727272727275) internal successors, (285), 44 states have internal predecessors, (285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:40:26,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:40:26,290 INFO L93 Difference]: Finished difference Result 299525 states and 348298 transitions. [2024-12-02 14:40:26,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-12-02 14:40:26,291 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 6.4772727272727275) internal successors, (285), 44 states have internal predecessors, (285), 0 states have call successors, (0), 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 112 [2024-12-02 14:40:26,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:40:26,531 INFO L225 Difference]: With dead ends: 299525 [2024-12-02 14:40:26,531 INFO L226 Difference]: Without dead ends: 280231 [2024-12-02 14:40:26,578 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 195 SyntacticMatches, 3 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1062 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=739, Invalid=4373, Unknown=0, NotChecked=0, Total=5112 [2024-12-02 14:40:26,578 INFO L435 NwaCegarLoop]: 359 mSDtfsCounter, 2864 mSDsluCounter, 7382 mSDsCounter, 0 mSdLazyCounter, 2329 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2864 SdHoareTripleChecker+Valid, 7741 SdHoareTripleChecker+Invalid, 2375 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 2329 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-12-02 14:40:26,579 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2864 Valid, 7741 Invalid, 2375 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 2329 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-12-02 14:40:26,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280231 states. [2024-12-02 14:40:28,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280231 to 92029. [2024-12-02 14:40:28,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92029 states, 92028 states have (on average 1.1591580823227714) internal successors, (106675), 92028 states have internal predecessors, (106675), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:40:28,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92029 states to 92029 states and 106675 transitions. [2024-12-02 14:40:28,225 INFO L78 Accepts]: Start accepts. Automaton has 92029 states and 106675 transitions. Word has length 112 [2024-12-02 14:40:28,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:40:28,225 INFO L471 AbstractCegarLoop]: Abstraction has 92029 states and 106675 transitions. [2024-12-02 14:40:28,225 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 6.4772727272727275) internal successors, (285), 44 states have internal predecessors, (285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:40:28,225 INFO L276 IsEmpty]: Start isEmpty. Operand 92029 states and 106675 transitions. [2024-12-02 14:40:28,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-12-02 14:40:28,228 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:40:28,228 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 14:40:28,235 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_deece62d-eb9a-4fa9-9dff-416e8fe1102f/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-12-02 14:40:28,428 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_deece62d-eb9a-4fa9-9dff-416e8fe1102f/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 14:40:28,429 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 14:40:28,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:40:28,429 INFO L85 PathProgramCache]: Analyzing trace with hash -1501849250, now seen corresponding path program 1 times [2024-12-02 14:40:28,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:40:28,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440578821] [2024-12-02 14:40:28,429 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:40:28,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:40:28,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:40:28,481 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:40:28,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:40:28,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440578821] [2024-12-02 14:40:28,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1440578821] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 14:40:28,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 14:40:28,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-02 14:40:28,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011840005] [2024-12-02 14:40:28,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 14:40:28,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 14:40:28,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:40:28,482 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 14:40:28,482 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 14:40:28,482 INFO L87 Difference]: Start difference. First operand 92029 states and 106675 transitions. Second operand has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:40:28,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:40:28,661 INFO L93 Difference]: Finished difference Result 135517 states and 157413 transitions. [2024-12-02 14:40:28,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 14:40:28,662 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 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 112 [2024-12-02 14:40:28,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:40:28,694 INFO L225 Difference]: With dead ends: 135517 [2024-12-02 14:40:28,694 INFO L226 Difference]: Without dead ends: 44569 [2024-12-02 14:40:28,722 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:40:28,723 INFO L435 NwaCegarLoop]: 179 mSDtfsCounter, 63 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 14:40:28,723 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 284 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 14:40:28,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44569 states. [2024-12-02 14:40:29,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44569 to 44567. [2024-12-02 14:40:29,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44567 states, 44566 states have (on average 1.145559395054526) internal successors, (51053), 44566 states have internal predecessors, (51053), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:40:29,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44567 states to 44567 states and 51053 transitions. [2024-12-02 14:40:29,215 INFO L78 Accepts]: Start accepts. Automaton has 44567 states and 51053 transitions. Word has length 112 [2024-12-02 14:40:29,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:40:29,215 INFO L471 AbstractCegarLoop]: Abstraction has 44567 states and 51053 transitions. [2024-12-02 14:40:29,215 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:40:29,215 INFO L276 IsEmpty]: Start isEmpty. Operand 44567 states and 51053 transitions. [2024-12-02 14:40:29,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-12-02 14:40:29,217 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:40:29,217 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 14:40:29,217 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-12-02 14:40:29,217 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 14:40:29,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:40:29,218 INFO L85 PathProgramCache]: Analyzing trace with hash -1564577086, now seen corresponding path program 1 times [2024-12-02 14:40:29,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:40:29,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319540176] [2024-12-02 14:40:29,218 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:40:29,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:40:29,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:40:29,523 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:40:29,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:40:29,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319540176] [2024-12-02 14:40:29,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1319540176] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 14:40:29,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 14:40:29,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-12-02 14:40:29,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326310853] [2024-12-02 14:40:29,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 14:40:29,524 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-12-02 14:40:29,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:40:29,524 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-12-02 14:40:29,524 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2024-12-02 14:40:29,524 INFO L87 Difference]: Start difference. First operand 44567 states and 51053 transitions. Second operand has 15 states, 15 states have (on average 7.466666666666667) internal successors, (112), 15 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:40:30,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:40:30,063 INFO L93 Difference]: Finished difference Result 71034 states and 81428 transitions. [2024-12-02 14:40:30,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-12-02 14:40:30,063 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 7.466666666666667) internal successors, (112), 15 states have internal predecessors, (112), 0 states have call successors, (0), 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 112 [2024-12-02 14:40:30,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:40:30,098 INFO L225 Difference]: With dead ends: 71034 [2024-12-02 14:40:30,098 INFO L226 Difference]: Without dead ends: 54834 [2024-12-02 14:40:30,110 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=131, Invalid=625, Unknown=0, NotChecked=0, Total=756 [2024-12-02 14:40:30,110 INFO L435 NwaCegarLoop]: 287 mSDtfsCounter, 461 mSDsluCounter, 2626 mSDsCounter, 0 mSdLazyCounter, 675 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 461 SdHoareTripleChecker+Valid, 2913 SdHoareTripleChecker+Invalid, 681 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 675 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-12-02 14:40:30,110 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [461 Valid, 2913 Invalid, 681 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 675 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-12-02 14:40:30,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54834 states. [2024-12-02 14:40:30,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54834 to 51547. [2024-12-02 14:40:30,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51547 states, 51546 states have (on average 1.14369689209638) internal successors, (58953), 51546 states have internal predecessors, (58953), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:40:30,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51547 states to 51547 states and 58953 transitions. [2024-12-02 14:40:30,610 INFO L78 Accepts]: Start accepts. Automaton has 51547 states and 58953 transitions. Word has length 112 [2024-12-02 14:40:30,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:40:30,610 INFO L471 AbstractCegarLoop]: Abstraction has 51547 states and 58953 transitions. [2024-12-02 14:40:30,610 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 7.466666666666667) internal successors, (112), 15 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:40:30,610 INFO L276 IsEmpty]: Start isEmpty. Operand 51547 states and 58953 transitions. [2024-12-02 14:40:30,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-12-02 14:40:30,613 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:40:30,613 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 14:40:30,613 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-12-02 14:40:30,613 INFO L396 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 14:40:30,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:40:30,613 INFO L85 PathProgramCache]: Analyzing trace with hash 711342060, now seen corresponding path program 1 times [2024-12-02 14:40:30,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:40:30,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510081817] [2024-12-02 14:40:30,614 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:40:30,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:40:30,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:40:31,123 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:40:31,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:40:31,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510081817] [2024-12-02 14:40:31,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [510081817] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 14:40:31,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [96847661] [2024-12-02 14:40:31,123 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:40:31,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 14:40:31,123 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_deece62d-eb9a-4fa9-9dff-416e8fe1102f/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 14:40:31,125 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_deece62d-eb9a-4fa9-9dff-416e8fe1102f/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 14:40:31,126 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_deece62d-eb9a-4fa9-9dff-416e8fe1102f/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-12-02 14:40:31,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:40:31,285 INFO L256 TraceCheckSpWp]: Trace formula consists of 499 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-12-02 14:40:31,286 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 14:40:31,891 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:40:31,892 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 14:40:33,199 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:40:33,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [96847661] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 14:40:33,199 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 14:40:33,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 11, 11] total 31 [2024-12-02 14:40:33,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006186646] [2024-12-02 14:40:33,199 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 14:40:33,200 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-12-02 14:40:33,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:40:33,200 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-12-02 14:40:33,200 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=877, Unknown=0, NotChecked=0, Total=992 [2024-12-02 14:40:33,200 INFO L87 Difference]: Start difference. First operand 51547 states and 58953 transitions. Second operand has 32 states, 32 states have (on average 8.375) internal successors, (268), 31 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:40:37,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:40:37,567 INFO L93 Difference]: Finished difference Result 113726 states and 130513 transitions. [2024-12-02 14:40:37,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2024-12-02 14:40:37,567 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 8.375) internal successors, (268), 31 states have internal predecessors, (268), 0 states have call successors, (0), 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 114 [2024-12-02 14:40:37,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:40:37,629 INFO L225 Difference]: With dead ends: 113726 [2024-12-02 14:40:37,629 INFO L226 Difference]: Without dead ends: 87539 [2024-12-02 14:40:37,650 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 213 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2200 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=1494, Invalid=6878, Unknown=0, NotChecked=0, Total=8372 [2024-12-02 14:40:37,650 INFO L435 NwaCegarLoop]: 236 mSDtfsCounter, 2687 mSDsluCounter, 3594 mSDsCounter, 0 mSdLazyCounter, 3892 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2687 SdHoareTripleChecker+Valid, 3830 SdHoareTripleChecker+Invalid, 3983 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 3892 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-12-02 14:40:37,650 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2687 Valid, 3830 Invalid, 3983 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 3892 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-12-02 14:40:37,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87539 states. [2024-12-02 14:40:38,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87539 to 51849. [2024-12-02 14:40:38,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51849 states, 51848 states have (on average 1.1431299182224965) internal successors, (59269), 51848 states have internal predecessors, (59269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:40:38,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51849 states to 51849 states and 59269 transitions. [2024-12-02 14:40:38,135 INFO L78 Accepts]: Start accepts. Automaton has 51849 states and 59269 transitions. Word has length 114 [2024-12-02 14:40:38,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:40:38,135 INFO L471 AbstractCegarLoop]: Abstraction has 51849 states and 59269 transitions. [2024-12-02 14:40:38,136 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 8.375) internal successors, (268), 31 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:40:38,136 INFO L276 IsEmpty]: Start isEmpty. Operand 51849 states and 59269 transitions. [2024-12-02 14:40:38,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-12-02 14:40:38,138 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:40:38,138 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 14:40:38,144 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_deece62d-eb9a-4fa9-9dff-416e8fe1102f/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-12-02 14:40:38,338 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_deece62d-eb9a-4fa9-9dff-416e8fe1102f/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 14:40:38,338 INFO L396 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 14:40:38,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:40:38,339 INFO L85 PathProgramCache]: Analyzing trace with hash 496197486, now seen corresponding path program 1 times [2024-12-02 14:40:38,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:40:38,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270734990] [2024-12-02 14:40:38,339 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:40:38,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:40:38,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:40:39,349 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:40:39,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:40:39,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270734990] [2024-12-02 14:40:39,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1270734990] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 14:40:39,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1310554829] [2024-12-02 14:40:39,350 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:40:39,350 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 14:40:39,350 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_deece62d-eb9a-4fa9-9dff-416e8fe1102f/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 14:40:39,351 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_deece62d-eb9a-4fa9-9dff-416e8fe1102f/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 14:40:39,352 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_deece62d-eb9a-4fa9-9dff-416e8fe1102f/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-12-02 14:40:39,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:40:39,530 INFO L256 TraceCheckSpWp]: Trace formula consists of 502 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-12-02 14:40:39,533 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 14:40:41,416 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:40:41,416 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 14:40:43,680 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:40:43,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1310554829] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 14:40:43,681 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 14:40:43,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 22, 19] total 61 [2024-12-02 14:40:43,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348073930] [2024-12-02 14:40:43,681 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 14:40:43,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 61 states [2024-12-02 14:40:43,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:40:43,682 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2024-12-02 14:40:43,682 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=214, Invalid=3446, Unknown=0, NotChecked=0, Total=3660 [2024-12-02 14:40:43,682 INFO L87 Difference]: Start difference. First operand 51849 states and 59269 transitions. Second operand has 61 states, 61 states have (on average 5.278688524590164) internal successors, (322), 61 states have internal predecessors, (322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:40:58,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:40:58,104 INFO L93 Difference]: Finished difference Result 152122 states and 174263 transitions. [2024-12-02 14:40:58,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2024-12-02 14:40:58,105 INFO L78 Accepts]: Start accepts. Automaton has has 61 states, 61 states have (on average 5.278688524590164) internal successors, (322), 61 states have internal predecessors, (322), 0 states have call successors, (0), 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 116 [2024-12-02 14:40:58,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:40:58,194 INFO L225 Difference]: With dead ends: 152122 [2024-12-02 14:40:58,195 INFO L226 Difference]: Without dead ends: 121564 [2024-12-02 14:40:58,220 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 345 GetRequests, 194 SyntacticMatches, 1 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5317 ImplicationChecksByTransitivity, 10.0s TimeCoverageRelationStatistics Valid=2319, Invalid=20633, Unknown=0, NotChecked=0, Total=22952 [2024-12-02 14:40:58,220 INFO L435 NwaCegarLoop]: 539 mSDtfsCounter, 3495 mSDsluCounter, 20598 mSDsCounter, 0 mSdLazyCounter, 11612 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3495 SdHoareTripleChecker+Valid, 21137 SdHoareTripleChecker+Invalid, 11679 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 11612 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.2s IncrementalHoareTripleChecker+Time [2024-12-02 14:40:58,220 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3495 Valid, 21137 Invalid, 11679 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [67 Valid, 11612 Invalid, 0 Unknown, 0 Unchecked, 6.2s Time] [2024-12-02 14:40:58,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121564 states. [2024-12-02 14:40:58,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121564 to 51137. [2024-12-02 14:40:58,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51137 states, 51136 states have (on average 1.1413485607008762) internal successors, (58364), 51136 states have internal predecessors, (58364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:40:58,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51137 states to 51137 states and 58364 transitions. [2024-12-02 14:40:58,804 INFO L78 Accepts]: Start accepts. Automaton has 51137 states and 58364 transitions. Word has length 116 [2024-12-02 14:40:58,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:40:58,804 INFO L471 AbstractCegarLoop]: Abstraction has 51137 states and 58364 transitions. [2024-12-02 14:40:58,804 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 61 states, 61 states have (on average 5.278688524590164) internal successors, (322), 61 states have internal predecessors, (322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:40:58,804 INFO L276 IsEmpty]: Start isEmpty. Operand 51137 states and 58364 transitions. [2024-12-02 14:40:58,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-12-02 14:40:58,805 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:40:58,806 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 14:40:58,812 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_deece62d-eb9a-4fa9-9dff-416e8fe1102f/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2024-12-02 14:40:59,006 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46,14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_deece62d-eb9a-4fa9-9dff-416e8fe1102f/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 14:40:59,006 INFO L396 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 14:40:59,006 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:40:59,006 INFO L85 PathProgramCache]: Analyzing trace with hash -1204108810, now seen corresponding path program 1 times [2024-12-02 14:40:59,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:40:59,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097909067] [2024-12-02 14:40:59,006 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:40:59,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:40:59,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:40:59,730 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:40:59,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:40:59,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097909067] [2024-12-02 14:40:59,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2097909067] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 14:40:59,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 14:40:59,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2024-12-02 14:40:59,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729520978] [2024-12-02 14:40:59,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 14:40:59,730 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-12-02 14:40:59,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:40:59,731 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-12-02 14:40:59,731 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=416, Unknown=0, NotChecked=0, Total=462 [2024-12-02 14:40:59,731 INFO L87 Difference]: Start difference. First operand 51137 states and 58364 transitions. Second operand has 22 states, 22 states have (on average 5.318181818181818) internal successors, (117), 22 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:41:01,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:41:01,720 INFO L93 Difference]: Finished difference Result 99881 states and 114717 transitions. [2024-12-02 14:41:01,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2024-12-02 14:41:01,721 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 5.318181818181818) internal successors, (117), 22 states have internal predecessors, (117), 0 states have call successors, (0), 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 117 [2024-12-02 14:41:01,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:41:01,784 INFO L225 Difference]: With dead ends: 99881 [2024-12-02 14:41:01,784 INFO L226 Difference]: Without dead ends: 94812 [2024-12-02 14:41:01,801 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 345 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=293, Invalid=1869, Unknown=0, NotChecked=0, Total=2162 [2024-12-02 14:41:01,801 INFO L435 NwaCegarLoop]: 355 mSDtfsCounter, 1112 mSDsluCounter, 4858 mSDsCounter, 0 mSdLazyCounter, 2356 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1112 SdHoareTripleChecker+Valid, 5213 SdHoareTripleChecker+Invalid, 2367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 2356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-12-02 14:41:01,802 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1112 Valid, 5213 Invalid, 2367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 2356 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-12-02 14:41:01,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94812 states. [2024-12-02 14:41:02,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94812 to 54440. [2024-12-02 14:41:02,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54440 states, 54439 states have (on average 1.1415161924355701) internal successors, (62143), 54439 states have internal predecessors, (62143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:41:02,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54440 states to 54440 states and 62143 transitions. [2024-12-02 14:41:02,489 INFO L78 Accepts]: Start accepts. Automaton has 54440 states and 62143 transitions. Word has length 117 [2024-12-02 14:41:02,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:41:02,489 INFO L471 AbstractCegarLoop]: Abstraction has 54440 states and 62143 transitions. [2024-12-02 14:41:02,489 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 5.318181818181818) internal successors, (117), 22 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:41:02,489 INFO L276 IsEmpty]: Start isEmpty. Operand 54440 states and 62143 transitions. [2024-12-02 14:41:02,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-12-02 14:41:02,491 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:41:02,491 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 14:41:02,491 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2024-12-02 14:41:02,491 INFO L396 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 14:41:02,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:41:02,491 INFO L85 PathProgramCache]: Analyzing trace with hash -862670560, now seen corresponding path program 1 times [2024-12-02 14:41:02,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:41:02,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610753485] [2024-12-02 14:41:02,492 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:41:02,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:41:02,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:41:03,142 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:41:03,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:41:03,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610753485] [2024-12-02 14:41:03,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [610753485] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 14:41:03,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1982463468] [2024-12-02 14:41:03,142 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:41:03,143 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 14:41:03,143 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_deece62d-eb9a-4fa9-9dff-416e8fe1102f/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 14:41:03,144 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_deece62d-eb9a-4fa9-9dff-416e8fe1102f/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 14:41:03,145 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_deece62d-eb9a-4fa9-9dff-416e8fe1102f/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-12-02 14:41:03,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:41:03,311 INFO L256 TraceCheckSpWp]: Trace formula consists of 501 conjuncts, 41 conjuncts are in the unsatisfiable core [2024-12-02 14:41:03,312 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 14:41:04,753 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:41:04,754 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 14:41:07,631 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:41:07,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1982463468] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 14:41:07,631 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 14:41:07,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 23, 23] total 63 [2024-12-02 14:41:07,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094710543] [2024-12-02 14:41:07,631 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 14:41:07,632 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 63 states [2024-12-02 14:41:07,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:41:07,632 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2024-12-02 14:41:07,633 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=279, Invalid=3627, Unknown=0, NotChecked=0, Total=3906 [2024-12-02 14:41:07,633 INFO L87 Difference]: Start difference. First operand 54440 states and 62143 transitions. Second operand has 63 states, 63 states have (on average 5.2063492063492065) internal successors, (328), 63 states have internal predecessors, (328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:41:38,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:41:38,120 INFO L93 Difference]: Finished difference Result 190922 states and 219692 transitions. [2024-12-02 14:41:38,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 175 states. [2024-12-02 14:41:38,120 INFO L78 Accepts]: Start accepts. Automaton has has 63 states, 63 states have (on average 5.2063492063492065) internal successors, (328), 63 states have internal predecessors, (328), 0 states have call successors, (0), 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 117 [2024-12-02 14:41:38,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:41:38,260 INFO L225 Difference]: With dead ends: 190922 [2024-12-02 14:41:38,260 INFO L226 Difference]: Without dead ends: 181700 [2024-12-02 14:41:38,291 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 420 GetRequests, 191 SyntacticMatches, 1 SemanticMatches, 228 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17290 ImplicationChecksByTransitivity, 23.1s TimeCoverageRelationStatistics Valid=6215, Invalid=46455, Unknown=0, NotChecked=0, Total=52670 [2024-12-02 14:41:38,292 INFO L435 NwaCegarLoop]: 711 mSDtfsCounter, 7098 mSDsluCounter, 25740 mSDsCounter, 0 mSdLazyCounter, 13930 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7098 SdHoareTripleChecker+Valid, 26451 SdHoareTripleChecker+Invalid, 14035 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 13930 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.6s IncrementalHoareTripleChecker+Time [2024-12-02 14:41:38,292 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7098 Valid, 26451 Invalid, 14035 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [105 Valid, 13930 Invalid, 0 Unknown, 0 Unchecked, 8.6s Time] [2024-12-02 14:41:38,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181700 states. [2024-12-02 14:41:39,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181700 to 52334. [2024-12-02 14:41:39,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52334 states, 52333 states have (on average 1.141937209791145) internal successors, (59761), 52333 states have internal predecessors, (59761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:41:39,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52334 states to 52334 states and 59761 transitions. [2024-12-02 14:41:39,215 INFO L78 Accepts]: Start accepts. Automaton has 52334 states and 59761 transitions. Word has length 117 [2024-12-02 14:41:39,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:41:39,215 INFO L471 AbstractCegarLoop]: Abstraction has 52334 states and 59761 transitions. [2024-12-02 14:41:39,215 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 63 states, 63 states have (on average 5.2063492063492065) internal successors, (328), 63 states have internal predecessors, (328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:41:39,215 INFO L276 IsEmpty]: Start isEmpty. Operand 52334 states and 59761 transitions. [2024-12-02 14:41:39,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-12-02 14:41:39,216 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:41:39,217 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 14:41:39,227 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_deece62d-eb9a-4fa9-9dff-416e8fe1102f/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2024-12-02 14:41:39,417 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_deece62d-eb9a-4fa9-9dff-416e8fe1102f/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable48 [2024-12-02 14:41:39,417 INFO L396 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 14:41:39,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:41:39,419 INFO L85 PathProgramCache]: Analyzing trace with hash 1280364082, now seen corresponding path program 1 times [2024-12-02 14:41:39,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:41:39,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28664279] [2024-12-02 14:41:39,419 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:41:39,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:41:39,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:41:40,121 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:41:40,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:41:40,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28664279] [2024-12-02 14:41:40,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [28664279] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 14:41:40,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 14:41:40,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2024-12-02 14:41:40,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525539003] [2024-12-02 14:41:40,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 14:41:40,121 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-12-02 14:41:40,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:41:40,122 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-12-02 14:41:40,122 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=417, Unknown=0, NotChecked=0, Total=462 [2024-12-02 14:41:40,122 INFO L87 Difference]: Start difference. First operand 52334 states and 59761 transitions. Second operand has 22 states, 22 states have (on average 5.363636363636363) internal successors, (118), 22 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:41:42,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:41:42,428 INFO L93 Difference]: Finished difference Result 94365 states and 108355 transitions. [2024-12-02 14:41:42,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2024-12-02 14:41:42,429 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 5.363636363636363) internal successors, (118), 22 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 118 [2024-12-02 14:41:42,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:41:42,486 INFO L225 Difference]: With dead ends: 94365 [2024-12-02 14:41:42,486 INFO L226 Difference]: Without dead ends: 91047 [2024-12-02 14:41:42,498 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 775 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=506, Invalid=3276, Unknown=0, NotChecked=0, Total=3782 [2024-12-02 14:41:42,499 INFO L435 NwaCegarLoop]: 351 mSDtfsCounter, 1063 mSDsluCounter, 4459 mSDsCounter, 0 mSdLazyCounter, 2323 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1063 SdHoareTripleChecker+Valid, 4810 SdHoareTripleChecker+Invalid, 2331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 2323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-12-02 14:41:42,499 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1063 Valid, 4810 Invalid, 2331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 2323 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-12-02 14:41:42,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91047 states. [2024-12-02 14:41:42,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91047 to 47294. [2024-12-02 14:41:42,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47294 states, 47293 states have (on average 1.1407819339014231) internal successors, (53951), 47293 states have internal predecessors, (53951), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:41:42,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47294 states to 47294 states and 53951 transitions. [2024-12-02 14:41:42,936 INFO L78 Accepts]: Start accepts. Automaton has 47294 states and 53951 transitions. Word has length 118 [2024-12-02 14:41:42,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:41:42,936 INFO L471 AbstractCegarLoop]: Abstraction has 47294 states and 53951 transitions. [2024-12-02 14:41:42,937 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 5.363636363636363) internal successors, (118), 22 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:41:42,937 INFO L276 IsEmpty]: Start isEmpty. Operand 47294 states and 53951 transitions. [2024-12-02 14:41:42,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-12-02 14:41:42,939 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:41:42,939 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 14:41:42,940 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2024-12-02 14:41:42,940 INFO L396 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 14:41:42,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:41:42,940 INFO L85 PathProgramCache]: Analyzing trace with hash 806917510, now seen corresponding path program 1 times [2024-12-02 14:41:42,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:41:42,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810376320] [2024-12-02 14:41:42,940 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:41:42,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:41:42,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:41:43,271 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2024-12-02 14:41:43,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:41:43,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810376320] [2024-12-02 14:41:43,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [810376320] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 14:41:43,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 14:41:43,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-12-02 14:41:43,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624126980] [2024-12-02 14:41:43,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 14:41:43,272 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-12-02 14:41:43,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:41:43,272 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-12-02 14:41:43,272 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2024-12-02 14:41:43,272 INFO L87 Difference]: Start difference. First operand 47294 states and 53951 transitions. Second operand has 12 states, 12 states have (on average 8.666666666666666) internal successors, (104), 12 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:41:43,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:41:43,994 INFO L93 Difference]: Finished difference Result 79863 states and 91202 transitions. [2024-12-02 14:41:43,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-12-02 14:41:43,995 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 8.666666666666666) internal successors, (104), 12 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 139 [2024-12-02 14:41:43,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:41:44,039 INFO L225 Difference]: With dead ends: 79863 [2024-12-02 14:41:44,039 INFO L226 Difference]: Without dead ends: 67046 [2024-12-02 14:41:44,054 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=141, Invalid=459, Unknown=0, NotChecked=0, Total=600 [2024-12-02 14:41:44,055 INFO L435 NwaCegarLoop]: 219 mSDtfsCounter, 1266 mSDsluCounter, 1492 mSDsCounter, 0 mSdLazyCounter, 582 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1266 SdHoareTripleChecker+Valid, 1711 SdHoareTripleChecker+Invalid, 591 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 582 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-12-02 14:41:44,055 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1266 Valid, 1711 Invalid, 591 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 582 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-12-02 14:41:44,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67046 states. [2024-12-02 14:41:44,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67046 to 46641. [2024-12-02 14:41:44,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46641 states, 46640 states have (on average 1.136663807890223) internal successors, (53014), 46640 states have internal predecessors, (53014), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:41:44,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46641 states to 46641 states and 53014 transitions. [2024-12-02 14:41:44,497 INFO L78 Accepts]: Start accepts. Automaton has 46641 states and 53014 transitions. Word has length 139 [2024-12-02 14:41:44,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:41:44,497 INFO L471 AbstractCegarLoop]: Abstraction has 46641 states and 53014 transitions. [2024-12-02 14:41:44,497 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.666666666666666) internal successors, (104), 12 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:41:44,497 INFO L276 IsEmpty]: Start isEmpty. Operand 46641 states and 53014 transitions. [2024-12-02 14:41:44,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-12-02 14:41:44,501 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:41:44,501 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 14:41:44,501 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2024-12-02 14:41:44,501 INFO L396 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 14:41:44,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:41:44,501 INFO L85 PathProgramCache]: Analyzing trace with hash -1861044612, now seen corresponding path program 1 times [2024-12-02 14:41:44,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:41:44,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591564192] [2024-12-02 14:41:44,501 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:41:44,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:41:44,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-02 14:41:44,539 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-12-02 14:41:44,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-02 14:41:44,609 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-12-02 14:41:44,610 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-12-02 14:41:44,610 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-12-02 14:41:44,611 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2024-12-02 14:41:44,614 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 14:41:44,753 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-12-02 14:41:44,755 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 02:41:44 BoogieIcfgContainer [2024-12-02 14:41:44,755 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-12-02 14:41:44,756 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-12-02 14:41:44,756 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-12-02 14:41:44,757 INFO L274 PluginConnector]: Witness Printer initialized [2024-12-02 14:41:44,758 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 02:38:56" (3/4) ... [2024-12-02 14:41:44,759 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2024-12-02 14:41:44,935 INFO L129 tionWitnessGenerator]: Generated YAML witness of length 92. [2024-12-02 14:41:45,028 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_deece62d-eb9a-4fa9-9dff-416e8fe1102f/bin/uautomizer-verify-84ZbGMXZE1/witness.graphml [2024-12-02 14:41:45,028 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_deece62d-eb9a-4fa9-9dff-416e8fe1102f/bin/uautomizer-verify-84ZbGMXZE1/witness.yml [2024-12-02 14:41:45,028 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-12-02 14:41:45,029 INFO L158 Benchmark]: Toolchain (without parser) took 169252.68ms. Allocated memory was 142.6MB in the beginning and 8.0GB in the end (delta: 7.8GB). Free memory was 116.4MB in the beginning and 5.4GB in the end (delta: -5.3GB). Peak memory consumption was 2.5GB. Max. memory is 16.1GB. [2024-12-02 14:41:45,029 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 142.6MB. Free memory is still 83.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-12-02 14:41:45,029 INFO L158 Benchmark]: CACSL2BoogieTranslator took 330.21ms. Allocated memory is still 142.6MB. Free memory was 116.4MB in the beginning and 98.1MB in the end (delta: 18.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-12-02 14:41:45,029 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.62ms. Allocated memory is still 142.6MB. Free memory was 98.1MB in the beginning and 95.0MB in the end (delta: 3.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-12-02 14:41:45,029 INFO L158 Benchmark]: Boogie Preprocessor took 45.01ms. Allocated memory is still 142.6MB. Free memory was 95.0MB in the beginning and 91.8MB in the end (delta: 3.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-12-02 14:41:45,030 INFO L158 Benchmark]: RCFGBuilder took 665.02ms. Allocated memory is still 142.6MB. Free memory was 91.8MB in the beginning and 111.4MB in the end (delta: -19.6MB). Peak memory consumption was 47.7MB. Max. memory is 16.1GB. [2024-12-02 14:41:45,030 INFO L158 Benchmark]: TraceAbstraction took 167896.49ms. Allocated memory was 142.6MB in the beginning and 8.0GB in the end (delta: 7.8GB). Free memory was 110.8MB in the beginning and 5.5GB in the end (delta: -5.3GB). Peak memory consumption was 2.5GB. Max. memory is 16.1GB. [2024-12-02 14:41:45,030 INFO L158 Benchmark]: Witness Printer took 271.89ms. Allocated memory is still 8.0GB. Free memory was 5.5GB in the beginning and 5.4GB in the end (delta: 37.7MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2024-12-02 14:41:45,031 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.27ms. Allocated memory is still 142.6MB. Free memory is still 83.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 330.21ms. Allocated memory is still 142.6MB. Free memory was 116.4MB in the beginning and 98.1MB in the end (delta: 18.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 38.62ms. Allocated memory is still 142.6MB. Free memory was 98.1MB in the beginning and 95.0MB in the end (delta: 3.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 45.01ms. Allocated memory is still 142.6MB. Free memory was 95.0MB in the beginning and 91.8MB in the end (delta: 3.1MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 665.02ms. Allocated memory is still 142.6MB. Free memory was 91.8MB in the beginning and 111.4MB in the end (delta: -19.6MB). Peak memory consumption was 47.7MB. Max. memory is 16.1GB. * TraceAbstraction took 167896.49ms. Allocated memory was 142.6MB in the beginning and 8.0GB in the end (delta: 7.8GB). Free memory was 110.8MB in the beginning and 5.5GB in the end (delta: -5.3GB). Peak memory consumption was 2.5GB. Max. memory is 16.1GB. * Witness Printer took 271.89ms. Allocated memory is still 8.0GB. Free memory was 5.5GB in the beginning and 5.4GB in the end (delta: 37.7MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 397]: 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_6144; [L60] int __return_6207; [L61] int __tmp_6234_0; [L62] int __return_6276; [L63] int __tmp_6277_0; [L64] int __return_6290; [L65] int __return_6445; VAL [__return_6067=0, __return_6144=0, __return_6207=0, __return_6276=0, __return_6290=0, __return_6445=0, __return_main=0, __tmp_6234_0=0, __tmp_6277_0=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] [L68] int main__c1; [L69] int main__i2; [L70] main__c1 = 0 [L71] r1 = __VERIFIER_nondet_char() [L72] id1 = __VERIFIER_nondet_char() [L73] st1 = __VERIFIER_nondet_char() [L74] send1 = __VERIFIER_nondet_char() [L75] mode1 = __VERIFIER_nondet_bool() [L76] alive1 = __VERIFIER_nondet_bool() [L77] id2 = __VERIFIER_nondet_char() [L78] st2 = __VERIFIER_nondet_char() [L79] send2 = __VERIFIER_nondet_char() [L80] mode2 = __VERIFIER_nondet_bool() [L81] alive2 = __VERIFIER_nondet_bool() [L82] id3 = __VERIFIER_nondet_char() [L83] st3 = __VERIFIER_nondet_char() [L84] send3 = __VERIFIER_nondet_char() [L85] mode3 = __VERIFIER_nondet_bool() [L86] alive3 = __VERIFIER_nondet_bool() [L88] int init__tmp; VAL [__return_6067=0, __return_6144=0, __return_6207=0, __return_6276=0, __return_6290=0, __return_6445=0, __return_main=0, __tmp_6234_0=0, __tmp_6277_0=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] [L89] COND TRUE ((int)r1) == 0 VAL [__return_6067=0, __return_6144=0, __return_6207=0, __return_6276=0, __return_6290=0, __return_6445=0, __return_main=0, __tmp_6234_0=0, __tmp_6277_0=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] [L91] COND TRUE ((((int)alive1) + ((int)alive2)) + ((int)alive3)) >= 1 VAL [__return_6067=0, __return_6144=0, __return_6207=0, __return_6276=0, __return_6290=0, __return_6445=0, __return_main=0, __tmp_6234_0=0, __tmp_6277_0=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] [L93] COND TRUE ((int)id1) >= 0 VAL [__return_6067=0, __return_6144=0, __return_6207=0, __return_6276=0, __return_6290=0, __return_6445=0, __return_main=0, __tmp_6234_0=0, __tmp_6277_0=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] [L95] COND TRUE ((int)st1) == 0 VAL [__return_6067=0, __return_6144=0, __return_6207=0, __return_6276=0, __return_6290=0, __return_6445=0, __return_main=0, __tmp_6234_0=0, __tmp_6277_0=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] [L97] COND TRUE ((int)send1) == ((int)id1) VAL [__return_6067=0, __return_6144=0, __return_6207=0, __return_6276=0, __return_6290=0, __return_6445=0, __return_main=0, __tmp_6234_0=0, __tmp_6277_0=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] [L99] COND TRUE ((int)mode1) == 0 VAL [__return_6067=0, __return_6144=0, __return_6207=0, __return_6276=0, __return_6290=0, __return_6445=0, __return_main=0, __tmp_6234_0=0, __tmp_6277_0=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] [L101] COND TRUE ((int)id2) >= 0 VAL [__return_6067=0, __return_6144=0, __return_6207=0, __return_6276=0, __return_6290=0, __return_6445=0, __return_main=0, __tmp_6234_0=0, __tmp_6277_0=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] [L103] COND TRUE ((int)st2) == 0 VAL [__return_6067=0, __return_6144=0, __return_6207=0, __return_6276=0, __return_6290=0, __return_6445=0, __return_main=0, __tmp_6234_0=0, __tmp_6277_0=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] [L105] COND TRUE ((int)send2) == ((int)id2) VAL [__return_6067=0, __return_6144=0, __return_6207=0, __return_6276=0, __return_6290=0, __return_6445=0, __return_main=0, __tmp_6234_0=0, __tmp_6277_0=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] [L107] COND TRUE ((int)mode2) == 0 VAL [__return_6067=0, __return_6144=0, __return_6207=0, __return_6276=0, __return_6290=0, __return_6445=0, __return_main=0, __tmp_6234_0=0, __tmp_6277_0=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] [L109] COND TRUE ((int)id3) >= 0 VAL [__return_6067=0, __return_6144=0, __return_6207=0, __return_6276=0, __return_6290=0, __return_6445=0, __return_main=0, __tmp_6234_0=0, __tmp_6277_0=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] [L111] COND TRUE ((int)st3) == 0 VAL [__return_6067=0, __return_6144=0, __return_6207=0, __return_6276=0, __return_6290=0, __return_6445=0, __return_main=0, __tmp_6234_0=0, __tmp_6277_0=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] [L113] COND TRUE ((int)send3) == ((int)id3) VAL [__return_6067=0, __return_6144=0, __return_6207=0, __return_6276=0, __return_6290=0, __return_6445=0, __return_main=0, __tmp_6234_0=0, __tmp_6277_0=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] [L115] COND TRUE ((int)mode3) == 0 VAL [__return_6067=0, __return_6144=0, __return_6207=0, __return_6276=0, __return_6290=0, __return_6445=0, __return_main=0, __tmp_6234_0=0, __tmp_6277_0=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] [L117] COND TRUE ((int)id1) != ((int)id2) VAL [__return_6067=0, __return_6144=0, __return_6207=0, __return_6276=0, __return_6290=0, __return_6445=0, __return_main=0, __tmp_6234_0=0, __tmp_6277_0=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] [L119] COND TRUE ((int)id1) != ((int)id3) VAL [__return_6067=0, __return_6144=0, __return_6207=0, __return_6276=0, __return_6290=0, __return_6445=0, __return_main=0, __tmp_6234_0=0, __tmp_6277_0=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] [L121] COND TRUE ((int)id2) != ((int)id3) [L123] init__tmp = 1 [L124] __return_6067 = init__tmp [L125] main__i2 = __return_6067 VAL [__return_6067=1, __return_6144=0, __return_6207=0, __return_6276=0, __return_6290=0, __return_6445=0, __return_main=0, __tmp_6234_0=0, __tmp_6277_0=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] [L126] COND TRUE main__i2 != 0 [L128] p1_old = nomsg [L129] p1_new = nomsg [L130] p2_old = nomsg [L131] p2_new = nomsg [L132] p3_old = nomsg [L133] p3_new = nomsg [L134] main__i2 = 0 VAL [__return_6067=1, __return_6144=0, __return_6207=0, __return_6276=0, __return_6290=0, __return_6445=0, __return_main=0, __tmp_6234_0=0, __tmp_6277_0=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] [L135] COND TRUE main__i2 < 6 [L138] msg_t node1__m1; [L139] node1__m1 = nomsg VAL [__return_6067=1, __return_6144=0, __return_6207=0, __return_6276=0, __return_6290=0, __return_6445=0, __return_main=0, __tmp_6234_0=0, __tmp_6277_0=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] [L140] COND FALSE !(!(mode1 == 0)) VAL [__return_6067=1, __return_6144=0, __return_6207=0, __return_6276=0, __return_6290=0, __return_6445=0, __return_main=0, __tmp_6234_0=0, __tmp_6277_0=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] [L146] COND FALSE !(!(alive1 == 0)) VAL [__return_6067=1, __return_6144=0, __return_6207=0, __return_6276=0, __return_6290=0, __return_6445=0, __return_main=0, __tmp_6234_0=0, __tmp_6277_0=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] [L157] mode1 = 1 [L159] msg_t node2__m2; [L160] node2__m2 = nomsg VAL [__return_6067=1, __return_6144=0, __return_6207=0, __return_6276=0, __return_6290=0, __return_6445=0, __return_main=0, __tmp_6234_0=0, __tmp_6277_0=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] [L161] COND FALSE !(!(mode2 == 0)) VAL [__return_6067=1, __return_6144=0, __return_6207=0, __return_6276=0, __return_6290=0, __return_6445=0, __return_main=0, __tmp_6234_0=0, __tmp_6277_0=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] [L167] COND FALSE !(!(alive2 == 0)) VAL [__return_6067=1, __return_6144=0, __return_6207=0, __return_6276=0, __return_6290=0, __return_6445=0, __return_main=0, __tmp_6234_0=0, __tmp_6277_0=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] [L934] COND FALSE !(((int)send2) != ((int)id2)) VAL [__return_6067=1, __return_6144=0, __return_6207=0, __return_6276=0, __return_6290=0, __return_6445=0, __return_main=0, __tmp_6234_0=0, __tmp_6277_0=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] [L178] mode2 = 1 [L180] msg_t node3__m3; [L181] node3__m3 = nomsg VAL [__return_6067=1, __return_6144=0, __return_6207=0, __return_6276=0, __return_6290=0, __return_6445=0, __return_main=0, __tmp_6234_0=0, __tmp_6277_0=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] [L182] COND FALSE !(!(mode3 == 0)) VAL [__return_6067=1, __return_6144=0, __return_6207=0, __return_6276=0, __return_6290=0, __return_6445=0, __return_main=0, __tmp_6234_0=0, __tmp_6277_0=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] [L188] COND TRUE !(alive3 == 0) [L190] int node3____CPAchecker_TMP_0; VAL [__return_6067=1, __return_6144=0, __return_6207=0, __return_6276=0, __return_6290=0, __return_6445=0, __return_main=0, __tmp_6234_0=0, __tmp_6277_0=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] [L191] COND TRUE send3 != nomsg VAL [__return_6067=1, __return_6144=0, __return_6207=0, __return_6276=0, __return_6290=0, __return_6445=0, __return_main=0, __tmp_6234_0=0, __tmp_6277_0=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] [L193] COND TRUE p3_new == nomsg [L195] node3____CPAchecker_TMP_0 = send3 VAL [__return_6067=1, __return_6144=0, __return_6207=0, __return_6276=0, __return_6290=0, __return_6445=0, __return_main=0, __tmp_6234_0=0, __tmp_6277_0=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] [L197] p3_new = node3____CPAchecker_TMP_0 VAL [__return_6067=1, __return_6144=0, __return_6207=0, __return_6276=0, __return_6290=0, __return_6445=0, __return_main=0, __tmp_6234_0=0, __tmp_6277_0=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] [L199] mode3 = 1 [L200] p1_old = p1_new [L201] p1_new = nomsg [L202] p2_old = p2_new [L203] p2_new = nomsg [L204] p3_old = p3_new [L205] p3_new = nomsg [L207] int check__tmp; VAL [__return_6067=1, __return_6144=0, __return_6207=0, __return_6276=0, __return_6290=0, __return_6445=0, __return_main=0, __tmp_6234_0=0, __tmp_6277_0=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] [L208] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) <= 1 VAL [__return_6067=1, __return_6144=0, __return_6207=0, __return_6276=0, __return_6290=0, __return_6445=0, __return_main=0, __tmp_6234_0=0, __tmp_6277_0=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] [L210] COND TRUE ((int)r1) < 3 [L212] check__tmp = 1 [L213] __return_6144 = check__tmp [L214] main__c1 = __return_6144 [L216] _Bool __tmp_1; [L217] __tmp_1 = main__c1 [L218] _Bool assert__arg; [L219] assert__arg = __tmp_1 VAL [__return_6067=1, __return_6144=1, __return_6207=0, __return_6276=0, __return_6290=0, __return_6445=0, __return_main=0, __tmp_6234_0=0, __tmp_6277_0=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] [L220] COND FALSE !(assert__arg == 0) [L226] int main____CPAchecker_TMP_0 = main__i2; [L227] main__i2 = main__i2 + 1 VAL [__return_6067=1, __return_6144=1, __return_6207=0, __return_6276=0, __return_6290=0, __return_6445=0, __return_main=0, __tmp_6234_0=0, __tmp_6277_0=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, main____CPAchecker_TMP_0=0, 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] [L228] COND TRUE main__i2 < 6 [L231] msg_t node1__m1; [L232] node1__m1 = nomsg VAL [__return_6067=1, __return_6144=1, __return_6207=0, __return_6276=0, __return_6290=0, __return_6445=0, __return_main=0, __tmp_6234_0=0, __tmp_6277_0=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, main____CPAchecker_TMP_0=0, 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] [L233] COND TRUE !(mode1 == 0) [L235] r1 = (char)(((int)r1) + 1) [L236] node1__m1 = p3_old [L237] p3_old = nomsg VAL [__return_6067=1, __return_6144=1, __return_6207=0, __return_6276=0, __return_6290=0, __return_6445=0, __return_main=0, __tmp_6234_0=0, __tmp_6277_0=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, main____CPAchecker_TMP_0=0, 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] [L238] COND TRUE ((int)node1__m1) != ((int)nomsg) VAL [__return_6067=1, __return_6144=1, __return_6207=0, __return_6276=0, __return_6290=0, __return_6445=0, __return_main=0, __tmp_6234_0=0, __tmp_6277_0=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, main____CPAchecker_TMP_0=0, 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] [L240] COND FALSE !(!(alive1 == 0)) [L844] send1 = node1__m1 VAL [__return_6067=1, __return_6144=1, __return_6207=0, __return_6276=0, __return_6290=0, __return_6445=0, __return_main=0, __tmp_6234_0=0, __tmp_6277_0=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, main____CPAchecker_TMP_0=0, 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] [L247] mode1 = 0 [L249] msg_t node2__m2; [L250] node2__m2 = nomsg VAL [__return_6067=1, __return_6144=1, __return_6207=0, __return_6276=0, __return_6290=0, __return_6445=0, __return_main=0, __tmp_6234_0=0, __tmp_6277_0=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, main____CPAchecker_TMP_0=0, 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] [L251] COND TRUE !(mode2 == 0) [L253] node2__m2 = p1_old [L254] p1_old = nomsg VAL [__return_6067=1, __return_6144=1, __return_6207=0, __return_6276=0, __return_6290=0, __return_6445=0, __return_main=0, __tmp_6234_0=0, __tmp_6277_0=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, main____CPAchecker_TMP_0=0, 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] [L255] COND FALSE !(((int)node2__m2) != ((int)nomsg)) VAL [__return_6067=1, __return_6144=1, __return_6207=0, __return_6276=0, __return_6290=0, __return_6445=0, __return_main=0, __tmp_6234_0=0, __tmp_6277_0=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, main____CPAchecker_TMP_0=0, 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] [L264] mode2 = 0 [L266] msg_t node3__m3; [L267] node3__m3 = nomsg VAL [__return_6067=1, __return_6144=1, __return_6207=0, __return_6276=0, __return_6290=0, __return_6445=0, __return_main=0, __tmp_6234_0=0, __tmp_6277_0=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, main____CPAchecker_TMP_0=0, 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] [L268] COND TRUE !(mode3 == 0) [L270] node3__m3 = p2_old [L271] p2_old = nomsg VAL [__return_6067=1, __return_6144=1, __return_6207=0, __return_6276=0, __return_6290=0, __return_6445=0, __return_main=0, __tmp_6234_0=0, __tmp_6277_0=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, main____CPAchecker_TMP_0=0, 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] [L272] COND FALSE !(((int)node3__m3) != ((int)nomsg)) VAL [__return_6067=1, __return_6144=1, __return_6207=0, __return_6276=0, __return_6290=0, __return_6445=0, __return_main=0, __tmp_6234_0=0, __tmp_6277_0=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, main____CPAchecker_TMP_0=0, 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] [L281] mode3 = 0 [L282] p1_old = p1_new [L283] p1_new = nomsg [L284] p2_old = p2_new [L285] p2_new = nomsg [L286] p3_old = p3_new [L287] p3_new = nomsg [L289] int check__tmp; VAL [__return_6067=1, __return_6144=1, __return_6207=0, __return_6276=0, __return_6290=0, __return_6445=0, __return_main=0, __tmp_6234_0=0, __tmp_6277_0=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, main____CPAchecker_TMP_0=0, 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] [L290] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) <= 1 VAL [__return_6067=1, __return_6144=1, __return_6207=0, __return_6276=0, __return_6290=0, __return_6445=0, __return_main=0, __tmp_6234_0=0, __tmp_6277_0=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, main____CPAchecker_TMP_0=0, 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] [L292] COND TRUE ((int)r1) < 3 [L294] check__tmp = 1 [L295] __return_6207 = check__tmp [L296] main__c1 = __return_6207 [L298] _Bool __tmp_2; [L299] __tmp_2 = main__c1 [L300] _Bool assert__arg; [L301] assert__arg = __tmp_2 VAL [__return_6067=1, __return_6144=1, __return_6207=1, __return_6276=0, __return_6290=0, __return_6445=0, __return_main=0, __tmp_6234_0=0, __tmp_6277_0=0, alive1=0, alive2=0, alive3=1, assert__arg=1, id1=0, id2=1, id3=127, main____CPAchecker_TMP_0=0, 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] [L302] COND FALSE !(assert__arg == 0) [L308] int main____CPAchecker_TMP_0 = main__i2; [L309] main__i2 = main__i2 + 1 VAL [__return_6067=1, __return_6144=1, __return_6207=1, __return_6276=0, __return_6290=0, __return_6445=0, __return_main=0, __tmp_6234_0=0, __tmp_6277_0=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=1, 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] [L310] COND TRUE main__i2 < 6 [L313] msg_t node1__m1; [L314] node1__m1 = nomsg VAL [__return_6067=1, __return_6144=1, __return_6207=1, __return_6276=0, __return_6290=0, __return_6445=0, __return_main=0, __tmp_6234_0=0, __tmp_6277_0=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=1, 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] [L315] COND FALSE !(!(mode1 == 0)) VAL [__return_6067=1, __return_6144=1, __return_6207=1, __return_6276=0, __return_6290=0, __return_6445=0, __return_main=0, __tmp_6234_0=0, __tmp_6277_0=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=1, 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] [L714] COND FALSE !(!(alive1 == 0)) VAL [__return_6067=1, __return_6144=1, __return_6207=1, __return_6276=0, __return_6290=0, __return_6445=0, __return_main=0, __tmp_6234_0=0, __tmp_6277_0=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=1, 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] [L725] mode1 = 1 VAL [__return_6067=1, __return_6144=1, __return_6207=1, __return_6276=0, __return_6290=0, __return_6445=0, __return_main=0, __tmp_6234_0=0, __tmp_6277_0=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=1, 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] [L331] __tmp_6234_0 = main____CPAchecker_TMP_0 VAL [__return_6067=1, __return_6144=1, __return_6207=1, __return_6276=0, __return_6290=0, __return_6445=0, __return_main=0, __tmp_6234_0=1, __tmp_6277_0=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, main____CPAchecker_TMP_0=0, 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] [L333] main____CPAchecker_TMP_0 = __tmp_6234_0 [L335] msg_t node2__m2; [L336] node2__m2 = nomsg VAL [__return_6067=1, __return_6144=1, __return_6207=1, __return_6276=0, __return_6290=0, __return_6445=0, __return_main=0, __tmp_6234_0=1, __tmp_6277_0=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=1, 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] [L337] COND FALSE !(!(mode2 == 0)) VAL [__return_6067=1, __return_6144=1, __return_6207=1, __return_6276=0, __return_6290=0, __return_6445=0, __return_main=0, __tmp_6234_0=1, __tmp_6277_0=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=1, 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] [L628] COND FALSE !(!(alive2 == 0)) VAL [__return_6067=1, __return_6144=1, __return_6207=1, __return_6276=0, __return_6290=0, __return_6445=0, __return_main=0, __tmp_6234_0=1, __tmp_6277_0=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=1, 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] [L656] COND FALSE !(((int)send2) != ((int)id2)) VAL [__return_6067=1, __return_6144=1, __return_6207=1, __return_6276=0, __return_6290=0, __return_6445=0, __return_main=0, __tmp_6234_0=1, __tmp_6277_0=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=1, 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] [L639] mode2 = 1 VAL [__return_6067=1, __return_6144=1, __return_6207=1, __return_6276=0, __return_6290=0, __return_6445=0, __return_main=0, __tmp_6234_0=1, __tmp_6277_0=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=1, 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] [L353] msg_t node3__m3; [L354] node3__m3 = nomsg VAL [__return_6067=1, __return_6144=1, __return_6207=1, __return_6276=0, __return_6290=0, __return_6445=0, __return_main=0, __tmp_6234_0=1, __tmp_6277_0=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=1, 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] [L355] COND FALSE !(!(mode3 == 0)) VAL [__return_6067=1, __return_6144=1, __return_6207=1, __return_6276=0, __return_6290=0, __return_6445=0, __return_main=0, __tmp_6234_0=1, __tmp_6277_0=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=1, 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] [L542] COND TRUE !(alive3 == 0) [L544] int node3____CPAchecker_TMP_0; VAL [__return_6067=1, __return_6144=1, __return_6207=1, __return_6276=0, __return_6290=0, __return_6445=0, __return_main=0, __tmp_6234_0=1, __tmp_6277_0=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=1, 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] [L545] COND TRUE send3 != nomsg VAL [__return_6067=1, __return_6144=1, __return_6207=1, __return_6276=0, __return_6290=0, __return_6445=0, __return_main=0, __tmp_6234_0=1, __tmp_6277_0=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=1, 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] [L547] COND TRUE p3_new == nomsg [L549] node3____CPAchecker_TMP_0 = send3 VAL [__return_6067=1, __return_6144=1, __return_6207=1, __return_6276=0, __return_6290=0, __return_6445=0, __return_main=0, __tmp_6234_0=1, __tmp_6277_0=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=1, 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] [L551] p3_new = node3____CPAchecker_TMP_0 VAL [__return_6067=1, __return_6144=1, __return_6207=1, __return_6276=0, __return_6290=0, __return_6445=0, __return_main=0, __tmp_6234_0=1, __tmp_6277_0=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=1, 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] [L553] mode3 = 1 VAL [__return_6067=1, __return_6144=1, __return_6207=1, __return_6276=0, __return_6290=0, __return_6445=0, __return_main=0, __tmp_6234_0=1, __tmp_6277_0=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=1, 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] [L370] p1_old = p1_new [L371] p1_new = nomsg [L372] p2_old = p2_new [L373] p2_new = nomsg [L374] p3_old = p3_new [L375] p3_new = nomsg [L377] int check__tmp; VAL [__return_6067=1, __return_6144=1, __return_6207=1, __return_6276=0, __return_6290=0, __return_6445=0, __return_main=0, __tmp_6234_0=1, __tmp_6277_0=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=1, 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] [L378] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) <= 1 VAL [__return_6067=1, __return_6144=1, __return_6207=1, __return_6276=0, __return_6290=0, __return_6445=0, __return_main=0, __tmp_6234_0=1, __tmp_6277_0=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=1, 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] [L380] COND TRUE ((int)r1) < 3 [L382] check__tmp = 1 VAL [__return_6067=1, __return_6144=1, __return_6207=1, __return_6276=0, __return_6290=0, __return_6445=0, __return_main=0, __tmp_6234_0=1, __tmp_6277_0=0, alive1=0, alive2=0, alive3=1, check__tmp=1, id1=0, id2=1, id3=127, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=1, 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] [L385] __return_6276 = check__tmp [L386] main__c1 = __return_6276 [L387] __tmp_6277_0 = main____CPAchecker_TMP_0 VAL [__return_6067=1, __return_6144=1, __return_6207=1, __return_6276=1, __return_6290=0, __return_6445=0, __return_main=0, __tmp_6234_0=1, __tmp_6277_0=1, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, main____CPAchecker_TMP_0=0, main__c1=1, 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] [L389] main____CPAchecker_TMP_0 = __tmp_6277_0 [L391] _Bool __tmp_3; [L392] __tmp_3 = main__c1 [L393] _Bool assert__arg; [L394] assert__arg = __tmp_3 VAL [__return_6067=1, __return_6144=1, __return_6207=1, __return_6276=1, __return_6290=0, __return_6445=0, __return_main=0, __tmp_6234_0=1, __tmp_6277_0=1, alive1=0, alive2=0, alive3=1, assert__arg=1, id1=0, id2=1, id3=127, main____CPAchecker_TMP_0=0, 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] [L395] COND FALSE !(assert__arg == 0) [L402] int main____CPAchecker_TMP_0 = main__i2; [L403] main__i2 = main__i2 + 1 VAL [__return_6067=1, __return_6144=1, __return_6207=1, __return_6276=1, __return_6290=0, __return_6445=0, __return_main=0, __tmp_6234_0=1, __tmp_6277_0=1, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=2, 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] [L404] COND TRUE main__i2 < 6 [L407] msg_t node1__m1; [L408] node1__m1 = nomsg VAL [__return_6067=1, __return_6144=1, __return_6207=1, __return_6276=1, __return_6290=0, __return_6445=0, __return_main=0, __tmp_6234_0=1, __tmp_6277_0=1, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=2, 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] [L409] COND TRUE !(mode1 == 0) [L411] r1 = (char)(((int)r1) + 1) [L412] node1__m1 = p3_old [L413] p3_old = nomsg VAL [__return_6067=1, __return_6144=1, __return_6207=1, __return_6276=1, __return_6290=0, __return_6445=0, __return_main=0, __tmp_6234_0=1, __tmp_6277_0=1, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=2, 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] [L414] COND TRUE ((int)node1__m1) != ((int)nomsg) VAL [__return_6067=1, __return_6144=1, __return_6207=1, __return_6276=1, __return_6290=0, __return_6445=0, __return_main=0, __tmp_6234_0=1, __tmp_6277_0=1, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=2, 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] [L416] COND FALSE !(!(alive1 == 0)) [L443] send1 = node1__m1 VAL [__return_6067=1, __return_6144=1, __return_6207=1, __return_6276=1, __return_6290=0, __return_6445=0, __return_main=0, __tmp_6234_0=1, __tmp_6277_0=1, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=2, 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] [L423] mode1 = 0 VAL [__return_6067=1, __return_6144=1, __return_6207=1, __return_6276=1, __return_6290=0, __return_6445=0, __return_main=0, __tmp_6234_0=1, __tmp_6277_0=1, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=2, 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] [L425] __tmp_6234_0 = main____CPAchecker_TMP_0 VAL [__return_6067=1, __return_6144=1, __return_6207=1, __return_6276=1, __return_6290=0, __return_6445=0, __return_main=0, __tmp_6234_0=2, __tmp_6277_0=1, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, main____CPAchecker_TMP_0=0, 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] [L333] main____CPAchecker_TMP_0 = __tmp_6234_0 [L335] msg_t node2__m2; [L336] node2__m2 = nomsg VAL [__return_6067=1, __return_6144=1, __return_6207=1, __return_6276=1, __return_6290=0, __return_6445=0, __return_main=0, __tmp_6234_0=2, __tmp_6277_0=1, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=2, 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] [L337] COND TRUE !(mode2 == 0) [L339] node2__m2 = p1_old [L340] p1_old = nomsg VAL [__return_6067=1, __return_6144=1, __return_6207=1, __return_6276=1, __return_6290=0, __return_6445=0, __return_main=0, __tmp_6234_0=2, __tmp_6277_0=1, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=2, 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] [L341] COND FALSE !(((int)node2__m2) != ((int)nomsg)) VAL [__return_6067=1, __return_6144=1, __return_6207=1, __return_6276=1, __return_6290=0, __return_6445=0, __return_main=0, __tmp_6234_0=2, __tmp_6277_0=1, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=2, 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] [L350] mode2 = 0 VAL [__return_6067=1, __return_6144=1, __return_6207=1, __return_6276=1, __return_6290=0, __return_6445=0, __return_main=0, __tmp_6234_0=2, __tmp_6277_0=1, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=2, 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] [L353] msg_t node3__m3; [L354] node3__m3 = nomsg VAL [__return_6067=1, __return_6144=1, __return_6207=1, __return_6276=1, __return_6290=0, __return_6445=0, __return_main=0, __tmp_6234_0=2, __tmp_6277_0=1, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=2, 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] [L355] COND TRUE !(mode3 == 0) [L357] node3__m3 = p2_old [L358] p2_old = nomsg VAL [__return_6067=1, __return_6144=1, __return_6207=1, __return_6276=1, __return_6290=0, __return_6445=0, __return_main=0, __tmp_6234_0=2, __tmp_6277_0=1, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=2, 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] [L359] COND FALSE !(((int)node3__m3) != ((int)nomsg)) VAL [__return_6067=1, __return_6144=1, __return_6207=1, __return_6276=1, __return_6290=0, __return_6445=0, __return_main=0, __tmp_6234_0=2, __tmp_6277_0=1, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=2, 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] [L368] mode3 = 0 VAL [__return_6067=1, __return_6144=1, __return_6207=1, __return_6276=1, __return_6290=0, __return_6445=0, __return_main=0, __tmp_6234_0=2, __tmp_6277_0=1, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=2, 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] [L370] p1_old = p1_new [L371] p1_new = nomsg [L372] p2_old = p2_new [L373] p2_new = nomsg [L374] p3_old = p3_new [L375] p3_new = nomsg [L377] int check__tmp; VAL [__return_6067=1, __return_6144=1, __return_6207=1, __return_6276=1, __return_6290=0, __return_6445=0, __return_main=0, __tmp_6234_0=2, __tmp_6277_0=1, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=2, 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] [L378] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) <= 1 VAL [__return_6067=1, __return_6144=1, __return_6207=1, __return_6276=1, __return_6290=0, __return_6445=0, __return_main=0, __tmp_6234_0=2, __tmp_6277_0=1, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=2, 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] [L380] COND TRUE ((int)r1) < 3 [L382] check__tmp = 1 VAL [__return_6067=1, __return_6144=1, __return_6207=1, __return_6276=1, __return_6290=0, __return_6445=0, __return_main=0, __tmp_6234_0=2, __tmp_6277_0=1, alive1=0, alive2=0, alive3=1, check__tmp=1, id1=0, id2=1, id3=127, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=2, 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] [L385] __return_6276 = check__tmp [L386] main__c1 = __return_6276 [L387] __tmp_6277_0 = main____CPAchecker_TMP_0 VAL [__return_6067=1, __return_6144=1, __return_6207=1, __return_6276=1, __return_6290=0, __return_6445=0, __return_main=0, __tmp_6234_0=2, __tmp_6277_0=2, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, main____CPAchecker_TMP_0=0, main__c1=1, 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] [L389] main____CPAchecker_TMP_0 = __tmp_6277_0 [L391] _Bool __tmp_3; [L392] __tmp_3 = main__c1 [L393] _Bool assert__arg; [L394] assert__arg = __tmp_3 VAL [__return_6067=1, __return_6144=1, __return_6207=1, __return_6276=1, __return_6290=0, __return_6445=0, __return_main=0, __tmp_6234_0=2, __tmp_6277_0=2, alive1=0, alive2=0, alive3=1, assert__arg=1, id1=0, id2=1, id3=127, main____CPAchecker_TMP_0=0, 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] [L395] COND FALSE !(assert__arg == 0) [L402] int main____CPAchecker_TMP_0 = main__i2; [L403] main__i2 = main__i2 + 1 VAL [__return_6067=1, __return_6144=1, __return_6207=1, __return_6276=1, __return_6290=0, __return_6445=0, __return_main=0, __tmp_6234_0=2, __tmp_6277_0=2, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=3, 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] [L404] COND TRUE main__i2 < 6 [L407] msg_t node1__m1; [L408] node1__m1 = nomsg VAL [__return_6067=1, __return_6144=1, __return_6207=1, __return_6276=1, __return_6290=0, __return_6445=0, __return_main=0, __tmp_6234_0=2, __tmp_6277_0=2, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=3, 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] [L409] COND FALSE !(!(mode1 == 0)) VAL [__return_6067=1, __return_6144=1, __return_6207=1, __return_6276=1, __return_6290=0, __return_6445=0, __return_main=0, __tmp_6234_0=2, __tmp_6277_0=2, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=3, 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] [L454] COND FALSE !(!(alive1 == 0)) VAL [__return_6067=1, __return_6144=1, __return_6207=1, __return_6276=1, __return_6290=0, __return_6445=0, __return_main=0, __tmp_6234_0=2, __tmp_6277_0=2, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=3, 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] [L465] mode1 = 1 VAL [__return_6067=1, __return_6144=1, __return_6207=1, __return_6276=1, __return_6290=0, __return_6445=0, __return_main=0, __tmp_6234_0=2, __tmp_6277_0=2, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=3, 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] [L425] __tmp_6234_0 = main____CPAchecker_TMP_0 VAL [__return_6067=1, __return_6144=1, __return_6207=1, __return_6276=1, __return_6290=0, __return_6445=0, __return_main=0, __tmp_6234_0=3, __tmp_6277_0=2, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, main____CPAchecker_TMP_0=0, 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] [L333] main____CPAchecker_TMP_0 = __tmp_6234_0 [L335] msg_t node2__m2; [L336] node2__m2 = nomsg VAL [__return_6067=1, __return_6144=1, __return_6207=1, __return_6276=1, __return_6290=0, __return_6445=0, __return_main=0, __tmp_6234_0=3, __tmp_6277_0=2, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=3, 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] [L337] COND FALSE !(!(mode2 == 0)) VAL [__return_6067=1, __return_6144=1, __return_6207=1, __return_6276=1, __return_6290=0, __return_6445=0, __return_main=0, __tmp_6234_0=3, __tmp_6277_0=2, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=3, 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] [L628] COND FALSE !(!(alive2 == 0)) VAL [__return_6067=1, __return_6144=1, __return_6207=1, __return_6276=1, __return_6290=0, __return_6445=0, __return_main=0, __tmp_6234_0=3, __tmp_6277_0=2, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=3, 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] [L656] COND FALSE !(((int)send2) != ((int)id2)) VAL [__return_6067=1, __return_6144=1, __return_6207=1, __return_6276=1, __return_6290=0, __return_6445=0, __return_main=0, __tmp_6234_0=3, __tmp_6277_0=2, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=3, 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] [L639] mode2 = 1 VAL [__return_6067=1, __return_6144=1, __return_6207=1, __return_6276=1, __return_6290=0, __return_6445=0, __return_main=0, __tmp_6234_0=3, __tmp_6277_0=2, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=3, 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] [L353] msg_t node3__m3; [L354] node3__m3 = nomsg VAL [__return_6067=1, __return_6144=1, __return_6207=1, __return_6276=1, __return_6290=0, __return_6445=0, __return_main=0, __tmp_6234_0=3, __tmp_6277_0=2, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=3, 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] [L355] COND FALSE !(!(mode3 == 0)) VAL [__return_6067=1, __return_6144=1, __return_6207=1, __return_6276=1, __return_6290=0, __return_6445=0, __return_main=0, __tmp_6234_0=3, __tmp_6277_0=2, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=3, 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] [L542] COND TRUE !(alive3 == 0) [L544] int node3____CPAchecker_TMP_0; VAL [__return_6067=1, __return_6144=1, __return_6207=1, __return_6276=1, __return_6290=0, __return_6445=0, __return_main=0, __tmp_6234_0=3, __tmp_6277_0=2, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=3, 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] [L545] COND TRUE send3 != nomsg VAL [__return_6067=1, __return_6144=1, __return_6207=1, __return_6276=1, __return_6290=0, __return_6445=0, __return_main=0, __tmp_6234_0=3, __tmp_6277_0=2, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=3, 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] [L547] COND TRUE p3_new == nomsg [L549] node3____CPAchecker_TMP_0 = send3 VAL [__return_6067=1, __return_6144=1, __return_6207=1, __return_6276=1, __return_6290=0, __return_6445=0, __return_main=0, __tmp_6234_0=3, __tmp_6277_0=2, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=3, 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] [L551] p3_new = node3____CPAchecker_TMP_0 VAL [__return_6067=1, __return_6144=1, __return_6207=1, __return_6276=1, __return_6290=0, __return_6445=0, __return_main=0, __tmp_6234_0=3, __tmp_6277_0=2, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=3, 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] [L553] mode3 = 1 VAL [__return_6067=1, __return_6144=1, __return_6207=1, __return_6276=1, __return_6290=0, __return_6445=0, __return_main=0, __tmp_6234_0=3, __tmp_6277_0=2, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=3, 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] [L370] p1_old = p1_new [L371] p1_new = nomsg [L372] p2_old = p2_new [L373] p2_new = nomsg [L374] p3_old = p3_new [L375] p3_new = nomsg [L377] int check__tmp; VAL [__return_6067=1, __return_6144=1, __return_6207=1, __return_6276=1, __return_6290=0, __return_6445=0, __return_main=0, __tmp_6234_0=3, __tmp_6277_0=2, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=3, 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] [L378] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) <= 1 VAL [__return_6067=1, __return_6144=1, __return_6207=1, __return_6276=1, __return_6290=0, __return_6445=0, __return_main=0, __tmp_6234_0=3, __tmp_6277_0=2, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=3, 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] [L380] COND TRUE ((int)r1) < 3 [L382] check__tmp = 1 VAL [__return_6067=1, __return_6144=1, __return_6207=1, __return_6276=1, __return_6290=0, __return_6445=0, __return_main=0, __tmp_6234_0=3, __tmp_6277_0=2, alive1=0, alive2=0, alive3=1, check__tmp=1, id1=0, id2=1, id3=127, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=3, 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] [L385] __return_6276 = check__tmp [L386] main__c1 = __return_6276 [L387] __tmp_6277_0 = main____CPAchecker_TMP_0 VAL [__return_6067=1, __return_6144=1, __return_6207=1, __return_6276=1, __return_6290=0, __return_6445=0, __return_main=0, __tmp_6234_0=3, __tmp_6277_0=3, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, main____CPAchecker_TMP_0=0, main__c1=1, 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] [L389] main____CPAchecker_TMP_0 = __tmp_6277_0 [L391] _Bool __tmp_3; [L392] __tmp_3 = main__c1 [L393] _Bool assert__arg; [L394] assert__arg = __tmp_3 VAL [__return_6067=1, __return_6144=1, __return_6207=1, __return_6276=1, __return_6290=0, __return_6445=0, __return_main=0, __tmp_6234_0=3, __tmp_6277_0=3, alive1=0, alive2=0, alive3=1, assert__arg=1, id1=0, id2=1, id3=127, main____CPAchecker_TMP_0=0, 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] [L395] COND FALSE !(assert__arg == 0) [L402] int main____CPAchecker_TMP_0 = main__i2; [L403] main__i2 = main__i2 + 1 VAL [__return_6067=1, __return_6144=1, __return_6207=1, __return_6276=1, __return_6290=0, __return_6445=0, __return_main=0, __tmp_6234_0=3, __tmp_6277_0=3, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=4, 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] [L404] COND TRUE main__i2 < 6 [L407] msg_t node1__m1; [L408] node1__m1 = nomsg VAL [__return_6067=1, __return_6144=1, __return_6207=1, __return_6276=1, __return_6290=0, __return_6445=0, __return_main=0, __tmp_6234_0=3, __tmp_6277_0=3, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=4, 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] [L409] COND TRUE !(mode1 == 0) [L411] r1 = (char)(((int)r1) + 1) [L412] node1__m1 = p3_old [L413] p3_old = nomsg VAL [__return_6067=1, __return_6144=1, __return_6207=1, __return_6276=1, __return_6290=0, __return_6445=0, __return_main=0, __tmp_6234_0=3, __tmp_6277_0=3, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=4, 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] [L414] COND TRUE ((int)node1__m1) != ((int)nomsg) VAL [__return_6067=1, __return_6144=1, __return_6207=1, __return_6276=1, __return_6290=0, __return_6445=0, __return_main=0, __tmp_6234_0=3, __tmp_6277_0=3, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=4, 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] [L416] COND FALSE !(!(alive1 == 0)) [L443] send1 = node1__m1 VAL [__return_6067=1, __return_6144=1, __return_6207=1, __return_6276=1, __return_6290=0, __return_6445=0, __return_main=0, __tmp_6234_0=3, __tmp_6277_0=3, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=4, 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] [L423] mode1 = 0 VAL [__return_6067=1, __return_6144=1, __return_6207=1, __return_6276=1, __return_6290=0, __return_6445=0, __return_main=0, __tmp_6234_0=3, __tmp_6277_0=3, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=4, 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] [L425] __tmp_6234_0 = main____CPAchecker_TMP_0 VAL [__return_6067=1, __return_6144=1, __return_6207=1, __return_6276=1, __return_6290=0, __return_6445=0, __return_main=0, __tmp_6234_0=4, __tmp_6277_0=3, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, main____CPAchecker_TMP_0=0, 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] [L333] main____CPAchecker_TMP_0 = __tmp_6234_0 [L335] msg_t node2__m2; [L336] node2__m2 = nomsg VAL [__return_6067=1, __return_6144=1, __return_6207=1, __return_6276=1, __return_6290=0, __return_6445=0, __return_main=0, __tmp_6234_0=4, __tmp_6277_0=3, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=4, 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] [L337] COND TRUE !(mode2 == 0) [L339] node2__m2 = p1_old [L340] p1_old = nomsg VAL [__return_6067=1, __return_6144=1, __return_6207=1, __return_6276=1, __return_6290=0, __return_6445=0, __return_main=0, __tmp_6234_0=4, __tmp_6277_0=3, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=4, 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] [L341] COND FALSE !(((int)node2__m2) != ((int)nomsg)) VAL [__return_6067=1, __return_6144=1, __return_6207=1, __return_6276=1, __return_6290=0, __return_6445=0, __return_main=0, __tmp_6234_0=4, __tmp_6277_0=3, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=4, 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] [L350] mode2 = 0 VAL [__return_6067=1, __return_6144=1, __return_6207=1, __return_6276=1, __return_6290=0, __return_6445=0, __return_main=0, __tmp_6234_0=4, __tmp_6277_0=3, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=4, 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] [L353] msg_t node3__m3; [L354] node3__m3 = nomsg VAL [__return_6067=1, __return_6144=1, __return_6207=1, __return_6276=1, __return_6290=0, __return_6445=0, __return_main=0, __tmp_6234_0=4, __tmp_6277_0=3, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=4, 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] [L355] COND TRUE !(mode3 == 0) [L357] node3__m3 = p2_old [L358] p2_old = nomsg VAL [__return_6067=1, __return_6144=1, __return_6207=1, __return_6276=1, __return_6290=0, __return_6445=0, __return_main=0, __tmp_6234_0=4, __tmp_6277_0=3, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=4, 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] [L359] COND FALSE !(((int)node3__m3) != ((int)nomsg)) VAL [__return_6067=1, __return_6144=1, __return_6207=1, __return_6276=1, __return_6290=0, __return_6445=0, __return_main=0, __tmp_6234_0=4, __tmp_6277_0=3, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=4, 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] [L368] mode3 = 0 VAL [__return_6067=1, __return_6144=1, __return_6207=1, __return_6276=1, __return_6290=0, __return_6445=0, __return_main=0, __tmp_6234_0=4, __tmp_6277_0=3, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=4, 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] [L370] p1_old = p1_new [L371] p1_new = nomsg [L372] p2_old = p2_new [L373] p2_new = nomsg [L374] p3_old = p3_new [L375] p3_new = nomsg [L377] int check__tmp; VAL [__return_6067=1, __return_6144=1, __return_6207=1, __return_6276=1, __return_6290=0, __return_6445=0, __return_main=0, __tmp_6234_0=4, __tmp_6277_0=3, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=4, 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] [L378] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) <= 1 VAL [__return_6067=1, __return_6144=1, __return_6207=1, __return_6276=1, __return_6290=0, __return_6445=0, __return_main=0, __tmp_6234_0=4, __tmp_6277_0=3, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=4, 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] [L380] COND FALSE !(((int)r1) < 3) VAL [__return_6067=1, __return_6144=1, __return_6207=1, __return_6276=1, __return_6290=0, __return_6445=0, __return_main=0, __tmp_6234_0=4, __tmp_6277_0=3, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=4, 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] [L497] COND FALSE !(((((int)st1) + ((int)st2)) + ((int)st3)) == 1) [L504] check__tmp = 0 VAL [__return_6067=1, __return_6144=1, __return_6207=1, __return_6276=1, __return_6290=0, __return_6445=0, __return_main=0, __tmp_6234_0=4, __tmp_6277_0=3, alive1=0, alive2=0, alive3=1, check__tmp=0, id1=0, id2=1, id3=127, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=4, 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] [L385] __return_6276 = check__tmp [L386] main__c1 = __return_6276 [L387] __tmp_6277_0 = main____CPAchecker_TMP_0 VAL [__return_6067=1, __return_6144=1, __return_6207=1, __return_6276=0, __return_6290=0, __return_6445=0, __return_main=0, __tmp_6234_0=4, __tmp_6277_0=4, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, main____CPAchecker_TMP_0=0, main__c1=0, 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] [L389] main____CPAchecker_TMP_0 = __tmp_6277_0 [L391] _Bool __tmp_3; [L392] __tmp_3 = main__c1 [L393] _Bool assert__arg; [L394] assert__arg = __tmp_3 VAL [__return_6067=1, __return_6144=1, __return_6207=1, __return_6276=0, __return_6290=0, __return_6445=0, __return_main=0, __tmp_6234_0=4, __tmp_6277_0=4, alive1=0, alive2=0, alive3=1, assert__arg=0, id1=0, id2=1, id3=127, main____CPAchecker_TMP_0=0, 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] [L395] COND TRUE assert__arg == 0 VAL [__return_6067=1, __return_6144=1, __return_6207=1, __return_6276=0, __return_6290=0, __return_6445=0, __return_main=0, __tmp_6234_0=4, __tmp_6277_0=4, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, main____CPAchecker_TMP_0=0, 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] [L397] reach_error() VAL [__return_6067=1, __return_6144=1, __return_6207=1, __return_6276=0, __return_6290=0, __return_6445=0, __return_main=0, __tmp_6234_0=4, __tmp_6277_0=4, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, main____CPAchecker_TMP_0=0, 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, 148 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 167.7s, OverallIterations: 52, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 102.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 65408 SdHoareTripleChecker+Valid, 34.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 65408 mSDsluCounter, 127132 SdHoareTripleChecker+Invalid, 30.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 114644 mSDsCounter, 1078 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 62011 IncrementalHoareTripleChecker+Invalid, 63089 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1078 mSolverCounterUnsat, 12488 mSDtfsCounter, 62011 mSolverCounterSat, 0.4s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 4199 GetRequests, 2591 SyntacticMatches, 10 SemanticMatches, 1598 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55893 ImplicationChecksByTransitivity, 67.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=122420occurred in iteration=32, InterpolantAutomatonStates: 1165, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 20.5s AutomataMinimizationTime, 51 MinimizatonAttempts, 1264963 StatesRemovedByMinimization, 50 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.7s SatisfiabilityAnalysisTime, 37.7s InterpolantComputationTime, 5899 NumberOfCodeBlocks, 5899 NumberOfCodeBlocksAsserted, 66 NumberOfCheckSat, 6987 ConstructedInterpolants, 0 QuantifiedInterpolants, 68146 SizeOfPredicates, 65 NumberOfNonLiveVariables, 6843 ConjunctsInSsa, 325 ConjunctsInUnsatCore, 77 InterpolantComputations, 39 PerfectInterpolantSequences, 419/533 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:41:45,060 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_deece62d-eb9a-4fa9-9dff-416e8fe1102f/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