./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.2.ufo.UNBOUNDED.pals.c.v+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_431199fd-7060-430a-960c-721b6172464a/bin/uautomizer-verify-84ZbGMXZE1/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_431199fd-7060-430a-960c-721b6172464a/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_431199fd-7060-430a-960c-721b6172464a/bin/uautomizer-verify-84ZbGMXZE1/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_431199fd-7060-430a-960c-721b6172464a/bin/uautomizer-verify-84ZbGMXZE1/config/AutomizerReach.xml -i ../../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_431199fd-7060-430a-960c-721b6172464a/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_431199fd-7060-430a-960c-721b6172464a/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 883ae562acbdc0ddaf57b9acda91c94407da87efc745325e9971c16b2e3730c3 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-12-02 06:50:24,651 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-12-02 06:50:24,707 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_431199fd-7060-430a-960c-721b6172464a/bin/uautomizer-verify-84ZbGMXZE1/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-12-02 06:50:24,712 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-12-02 06:50:24,712 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-12-02 06:50:24,732 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-12-02 06:50:24,733 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-12-02 06:50:24,733 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-12-02 06:50:24,733 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-12-02 06:50:24,733 INFO L153 SettingsManager]: * Use memory slicer=true [2024-12-02 06:50:24,733 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-12-02 06:50:24,734 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-12-02 06:50:24,734 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-12-02 06:50:24,734 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-12-02 06:50:24,734 INFO L153 SettingsManager]: * Use SBE=true [2024-12-02 06:50:24,734 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-12-02 06:50:24,735 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-12-02 06:50:24,735 INFO L153 SettingsManager]: * sizeof long=4 [2024-12-02 06:50:24,735 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-12-02 06:50:24,735 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-12-02 06:50:24,735 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-12-02 06:50:24,735 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-12-02 06:50:24,735 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-12-02 06:50:24,735 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-12-02 06:50:24,735 INFO L153 SettingsManager]: * sizeof long double=12 [2024-12-02 06:50:24,736 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-12-02 06:50:24,736 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-12-02 06:50:24,736 INFO L153 SettingsManager]: * Use constant arrays=true [2024-12-02 06:50:24,736 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-12-02 06:50:24,736 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-12-02 06:50:24,736 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-12-02 06:50:24,736 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-12-02 06:50:24,736 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-12-02 06:50:24,736 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-12-02 06:50:24,736 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-12-02 06:50:24,736 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-12-02 06:50:24,736 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-12-02 06:50:24,736 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-12-02 06:50:24,737 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-12-02 06:50:24,737 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-12-02 06:50:24,737 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-12-02 06:50:24,737 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-12-02 06:50:24,737 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-12-02 06:50:24,737 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-12-02 06:50:24,737 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-12-02 06:50:24,737 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-12-02 06:50:24,737 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-12-02 06:50:24,737 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-12-02 06:50:24,737 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_431199fd-7060-430a-960c-721b6172464a/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 -> 883ae562acbdc0ddaf57b9acda91c94407da87efc745325e9971c16b2e3730c3 [2024-12-02 06:50:24,958 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-12-02 06:50:24,966 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-12-02 06:50:24,968 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-12-02 06:50:24,969 INFO L270 PluginConnector]: Initializing CDTParser... [2024-12-02 06:50:24,970 INFO L274 PluginConnector]: CDTParser initialized [2024-12-02 06:50:24,971 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_431199fd-7060-430a-960c-721b6172464a/bin/uautomizer-verify-84ZbGMXZE1/../../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2024-12-02 06:50:27,692 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_431199fd-7060-430a-960c-721b6172464a/bin/uautomizer-verify-84ZbGMXZE1/data/59ffa4096/20de417f2a584ea7bd91e2f09690f941/FLAG4e9e971d6 [2024-12-02 06:50:27,906 INFO L384 CDTParser]: Found 1 translation units. [2024-12-02 06:50:27,906 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_431199fd-7060-430a-960c-721b6172464a/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2024-12-02 06:50:27,916 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_431199fd-7060-430a-960c-721b6172464a/bin/uautomizer-verify-84ZbGMXZE1/data/59ffa4096/20de417f2a584ea7bd91e2f09690f941/FLAG4e9e971d6 [2024-12-02 06:50:27,931 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_431199fd-7060-430a-960c-721b6172464a/bin/uautomizer-verify-84ZbGMXZE1/data/59ffa4096/20de417f2a584ea7bd91e2f09690f941 [2024-12-02 06:50:27,933 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-12-02 06:50:27,935 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-12-02 06:50:27,936 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-12-02 06:50:27,936 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-12-02 06:50:27,940 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-12-02 06:50:27,941 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 06:50:27" (1/1) ... [2024-12-02 06:50:27,941 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e328e03 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:50:27, skipping insertion in model container [2024-12-02 06:50:27,941 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 06:50:27" (1/1) ... [2024-12-02 06:50:27,970 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-12-02 06:50:28,164 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_431199fd-7060-430a-960c-721b6172464a/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c[7165,7178] [2024-12-02 06:50:28,196 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-02 06:50:28,208 INFO L200 MainTranslator]: Completed pre-run [2024-12-02 06:50:28,254 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_431199fd-7060-430a-960c-721b6172464a/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c[7165,7178] [2024-12-02 06:50:28,280 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-02 06:50:28,296 INFO L204 MainTranslator]: Completed translation [2024-12-02 06:50:28,296 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:50:28 WrapperNode [2024-12-02 06:50:28,296 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-12-02 06:50:28,297 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-12-02 06:50:28,297 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-12-02 06:50:28,297 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-12-02 06:50:28,304 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:50:28" (1/1) ... [2024-12-02 06:50:28,313 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:50:28" (1/1) ... [2024-12-02 06:50:28,342 INFO L138 Inliner]: procedures = 23, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 605 [2024-12-02 06:50:28,342 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-12-02 06:50:28,342 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-12-02 06:50:28,342 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-12-02 06:50:28,343 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-12-02 06:50:28,351 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:50:28" (1/1) ... [2024-12-02 06:50:28,352 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:50:28" (1/1) ... [2024-12-02 06:50:28,355 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:50:28" (1/1) ... [2024-12-02 06:50:28,371 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 06:50:28,371 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:50:28" (1/1) ... [2024-12-02 06:50:28,371 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:50:28" (1/1) ... [2024-12-02 06:50:28,380 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:50:28" (1/1) ... [2024-12-02 06:50:28,382 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:50:28" (1/1) ... [2024-12-02 06:50:28,386 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:50:28" (1/1) ... [2024-12-02 06:50:28,388 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:50:28" (1/1) ... [2024-12-02 06:50:28,390 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:50:28" (1/1) ... [2024-12-02 06:50:28,394 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-12-02 06:50:28,394 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-12-02 06:50:28,394 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-12-02 06:50:28,394 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-12-02 06:50:28,396 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:50:28" (1/1) ... [2024-12-02 06:50:28,401 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-12-02 06:50:28,413 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_431199fd-7060-430a-960c-721b6172464a/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 06:50:28,426 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_431199fd-7060-430a-960c-721b6172464a/bin/uautomizer-verify-84ZbGMXZE1/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-12-02 06:50:28,429 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_431199fd-7060-430a-960c-721b6172464a/bin/uautomizer-verify-84ZbGMXZE1/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-12-02 06:50:28,453 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-12-02 06:50:28,453 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-12-02 06:50:28,453 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-12-02 06:50:28,453 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-12-02 06:50:28,549 INFO L234 CfgBuilder]: Building ICFG [2024-12-02 06:50:28,550 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-12-02 06:50:29,074 INFO L? ?]: Removed 78 outVars from TransFormulas that were not future-live. [2024-12-02 06:50:29,074 INFO L283 CfgBuilder]: Performing block encoding [2024-12-02 06:50:29,087 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-12-02 06:50:29,087 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2024-12-02 06:50:29,087 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 06:50:29 BoogieIcfgContainer [2024-12-02 06:50:29,087 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-12-02 06:50:29,089 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-12-02 06:50:29,089 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-12-02 06:50:29,092 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-12-02 06:50:29,092 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 06:50:27" (1/3) ... [2024-12-02 06:50:29,093 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61d072d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 06:50:29, skipping insertion in model container [2024-12-02 06:50:29,093 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:50:28" (2/3) ... [2024-12-02 06:50:29,093 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61d072d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 06:50:29, skipping insertion in model container [2024-12-02 06:50:29,093 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 06:50:29" (3/3) ... [2024-12-02 06:50:29,094 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.3.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2024-12-02 06:50:29,109 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-12-02 06:50:29,110 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr-var-start-time.3.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c that has 1 procedures, 147 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2024-12-02 06:50:29,163 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-12-02 06:50:29,173 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;@30abafc0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-02 06:50:29,174 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-12-02 06:50:29,178 INFO L276 IsEmpty]: Start isEmpty. Operand has 147 states, 145 states have (on average 1.710344827586207) internal successors, (248), 146 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 06:50:29,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-12-02 06:50:29,184 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 06:50:29,185 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] [2024-12-02 06:50:29,185 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 06:50:29,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 06:50:29,189 INFO L85 PathProgramCache]: Analyzing trace with hash -235222256, now seen corresponding path program 1 times [2024-12-02 06:50:29,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 06:50:29,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832458958] [2024-12-02 06:50:29,196 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:50:29,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 06:50:29,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:50:29,607 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 06:50:29,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 06:50:29,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832458958] [2024-12-02 06:50:29,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [832458958] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 06:50:29,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 06:50:29,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-12-02 06:50:29,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718211130] [2024-12-02 06:50:29,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 06:50:29,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-02 06:50:29,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 06:50:29,631 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-02 06:50:29,631 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-12-02 06:50:29,634 INFO L87 Difference]: Start difference. First operand has 147 states, 145 states have (on average 1.710344827586207) internal successors, (248), 146 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) Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 06:50:29,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 06:50:29,824 INFO L93 Difference]: Finished difference Result 467 states and 755 transitions. [2024-12-02 06:50:29,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-02 06:50:29,827 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 0 states have call successors, (0), 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 48 [2024-12-02 06:50:29,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 06:50:29,839 INFO L225 Difference]: With dead ends: 467 [2024-12-02 06:50:29,839 INFO L226 Difference]: Without dead ends: 393 [2024-12-02 06:50:29,843 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 06:50:29,845 INFO L435 NwaCegarLoop]: 299 mSDtfsCounter, 824 mSDsluCounter, 566 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 824 SdHoareTripleChecker+Valid, 865 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 06:50:29,846 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [824 Valid, 865 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-12-02 06:50:29,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2024-12-02 06:50:29,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 231. [2024-12-02 06:50:29,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 230 states have (on average 1.508695652173913) internal successors, (347), 230 states have internal predecessors, (347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 06:50:29,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 347 transitions. [2024-12-02 06:50:29,894 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 347 transitions. Word has length 48 [2024-12-02 06:50:29,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 06:50:29,895 INFO L471 AbstractCegarLoop]: Abstraction has 231 states and 347 transitions. [2024-12-02 06:50:29,895 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 06:50:29,895 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 347 transitions. [2024-12-02 06:50:29,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-12-02 06:50:29,896 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 06:50:29,897 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] [2024-12-02 06:50:29,897 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-12-02 06:50:29,897 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 06:50:29,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 06:50:29,898 INFO L85 PathProgramCache]: Analyzing trace with hash 407331856, now seen corresponding path program 1 times [2024-12-02 06:50:29,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 06:50:29,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864771462] [2024-12-02 06:50:29,899 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:50:29,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 06:50:29,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:50:30,017 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 06:50:30,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 06:50:30,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864771462] [2024-12-02 06:50:30,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [864771462] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 06:50:30,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 06:50:30,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-02 06:50:30,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573562204] [2024-12-02 06:50:30,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 06:50:30,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 06:50:30,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 06:50:30,020 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 06:50:30,020 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 06:50:30,020 INFO L87 Difference]: Start difference. First operand 231 states and 347 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 06:50:30,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 06:50:30,059 INFO L93 Difference]: Finished difference Result 569 states and 875 transitions. [2024-12-02 06:50:30,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 06:50:30,059 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 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 51 [2024-12-02 06:50:30,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 06:50:30,062 INFO L225 Difference]: With dead ends: 569 [2024-12-02 06:50:30,062 INFO L226 Difference]: Without dead ends: 401 [2024-12-02 06:50:30,062 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 06:50:30,063 INFO L435 NwaCegarLoop]: 207 mSDtfsCounter, 143 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 392 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 06:50:30,064 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 392 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 06:50:30,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states. [2024-12-02 06:50:30,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 399. [2024-12-02 06:50:30,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 399 states, 398 states have (on average 1.5125628140703518) internal successors, (602), 398 states have internal predecessors, (602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 06:50:30,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 602 transitions. [2024-12-02 06:50:30,082 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 602 transitions. Word has length 51 [2024-12-02 06:50:30,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 06:50:30,082 INFO L471 AbstractCegarLoop]: Abstraction has 399 states and 602 transitions. [2024-12-02 06:50:30,082 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 06:50:30,082 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 602 transitions. [2024-12-02 06:50:30,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-12-02 06:50:30,084 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 06:50:30,084 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] [2024-12-02 06:50:30,084 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-12-02 06:50:30,084 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 06:50:30,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 06:50:30,084 INFO L85 PathProgramCache]: Analyzing trace with hash 738781713, now seen corresponding path program 1 times [2024-12-02 06:50:30,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 06:50:30,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247449520] [2024-12-02 06:50:30,085 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:50:30,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 06:50:30,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:50:30,169 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 06:50:30,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 06:50:30,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247449520] [2024-12-02 06:50:30,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247449520] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 06:50:30,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 06:50:30,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-02 06:50:30,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959611822] [2024-12-02 06:50:30,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 06:50:30,170 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 06:50:30,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 06:50:30,171 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 06:50:30,171 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 06:50:30,171 INFO L87 Difference]: Start difference. First operand 399 states and 602 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 06:50:30,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 06:50:30,206 INFO L93 Difference]: Finished difference Result 979 states and 1498 transitions. [2024-12-02 06:50:30,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 06:50:30,207 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 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 51 [2024-12-02 06:50:30,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 06:50:30,210 INFO L225 Difference]: With dead ends: 979 [2024-12-02 06:50:30,210 INFO L226 Difference]: Without dead ends: 691 [2024-12-02 06:50:30,211 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 06:50:30,212 INFO L435 NwaCegarLoop]: 207 mSDtfsCounter, 130 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 392 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 06:50:30,212 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 392 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 06:50:30,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 691 states. [2024-12-02 06:50:30,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 691 to 689. [2024-12-02 06:50:30,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 689 states, 688 states have (on average 1.502906976744186) internal successors, (1034), 688 states have internal predecessors, (1034), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 06:50:30,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 689 states to 689 states and 1034 transitions. [2024-12-02 06:50:30,237 INFO L78 Accepts]: Start accepts. Automaton has 689 states and 1034 transitions. Word has length 51 [2024-12-02 06:50:30,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 06:50:30,237 INFO L471 AbstractCegarLoop]: Abstraction has 689 states and 1034 transitions. [2024-12-02 06:50:30,237 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 06:50:30,237 INFO L276 IsEmpty]: Start isEmpty. Operand 689 states and 1034 transitions. [2024-12-02 06:50:30,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-12-02 06:50:30,239 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 06:50:30,239 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] [2024-12-02 06:50:30,239 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-12-02 06:50:30,239 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 06:50:30,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 06:50:30,240 INFO L85 PathProgramCache]: Analyzing trace with hash -865520847, now seen corresponding path program 1 times [2024-12-02 06:50:30,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 06:50:30,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854033108] [2024-12-02 06:50:30,240 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:50:30,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 06:50:30,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:50:30,320 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 06:50:30,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 06:50:30,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854033108] [2024-12-02 06:50:30,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1854033108] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 06:50:30,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 06:50:30,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-02 06:50:30,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500370372] [2024-12-02 06:50:30,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 06:50:30,321 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 06:50:30,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 06:50:30,321 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 06:50:30,321 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 06:50:30,321 INFO L87 Difference]: Start difference. First operand 689 states and 1034 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 06:50:30,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 06:50:30,368 INFO L93 Difference]: Finished difference Result 1811 states and 2729 transitions. [2024-12-02 06:50:30,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 06:50:30,370 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 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 51 [2024-12-02 06:50:30,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 06:50:30,374 INFO L225 Difference]: With dead ends: 1811 [2024-12-02 06:50:30,375 INFO L226 Difference]: Without dead ends: 1209 [2024-12-02 06:50:30,375 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 06:50:30,376 INFO L435 NwaCegarLoop]: 205 mSDtfsCounter, 139 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 400 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 06:50:30,376 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 400 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 06:50:30,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1209 states. [2024-12-02 06:50:30,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1209 to 1207. [2024-12-02 06:50:30,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1207 states, 1206 states have (on average 1.466832504145937) internal successors, (1769), 1206 states have internal predecessors, (1769), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 06:50:30,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1207 states to 1207 states and 1769 transitions. [2024-12-02 06:50:30,423 INFO L78 Accepts]: Start accepts. Automaton has 1207 states and 1769 transitions. Word has length 51 [2024-12-02 06:50:30,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 06:50:30,423 INFO L471 AbstractCegarLoop]: Abstraction has 1207 states and 1769 transitions. [2024-12-02 06:50:30,423 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 06:50:30,423 INFO L276 IsEmpty]: Start isEmpty. Operand 1207 states and 1769 transitions. [2024-12-02 06:50:30,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-12-02 06:50:30,425 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 06:50:30,425 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 06:50:30,425 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-12-02 06:50:30,425 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 06:50:30,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 06:50:30,426 INFO L85 PathProgramCache]: Analyzing trace with hash -1376619607, now seen corresponding path program 1 times [2024-12-02 06:50:30,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 06:50:30,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275533307] [2024-12-02 06:50:30,426 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:50:30,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 06:50:30,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:50:30,566 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 06:50:30,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 06:50:30,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275533307] [2024-12-02 06:50:30,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1275533307] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 06:50:30,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 06:50:30,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-12-02 06:50:30,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504714103] [2024-12-02 06:50:30,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 06:50:30,567 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-02 06:50:30,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 06:50:30,567 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-02 06:50:30,567 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-12-02 06:50:30,567 INFO L87 Difference]: Start difference. First operand 1207 states and 1769 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 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 06:50:30,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 06:50:30,671 INFO L93 Difference]: Finished difference Result 2347 states and 3506 transitions. [2024-12-02 06:50:30,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-02 06:50:30,672 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 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 06:50:30,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 06:50:30,679 INFO L225 Difference]: With dead ends: 2347 [2024-12-02 06:50:30,679 INFO L226 Difference]: Without dead ends: 2001 [2024-12-02 06:50:30,680 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 06:50:30,681 INFO L435 NwaCegarLoop]: 367 mSDtfsCounter, 562 mSDsluCounter, 527 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 562 SdHoareTripleChecker+Valid, 894 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 06:50:30,681 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [562 Valid, 894 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-12-02 06:50:30,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2001 states. [2024-12-02 06:50:30,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2001 to 1611. [2024-12-02 06:50:30,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1611 states, 1610 states have (on average 1.4745341614906833) internal successors, (2374), 1610 states have internal predecessors, (2374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 06:50:30,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1611 states to 1611 states and 2374 transitions. [2024-12-02 06:50:30,729 INFO L78 Accepts]: Start accepts. Automaton has 1611 states and 2374 transitions. Word has length 52 [2024-12-02 06:50:30,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 06:50:30,729 INFO L471 AbstractCegarLoop]: Abstraction has 1611 states and 2374 transitions. [2024-12-02 06:50:30,729 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 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 06:50:30,729 INFO L276 IsEmpty]: Start isEmpty. Operand 1611 states and 2374 transitions. [2024-12-02 06:50:30,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-12-02 06:50:30,731 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 06:50:30,731 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 06:50:30,731 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-12-02 06:50:30,731 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 06:50:30,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 06:50:30,732 INFO L85 PathProgramCache]: Analyzing trace with hash -1542318405, now seen corresponding path program 1 times [2024-12-02 06:50:30,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 06:50:30,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455489750] [2024-12-02 06:50:30,732 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:50:30,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 06:50:30,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:50:30,894 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 06:50:30,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 06:50:30,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455489750] [2024-12-02 06:50:30,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [455489750] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 06:50:30,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 06:50:30,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-12-02 06:50:30,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076698557] [2024-12-02 06:50:30,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 06:50:30,896 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-02 06:50:30,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 06:50:30,896 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-02 06:50:30,896 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-12-02 06:50:30,897 INFO L87 Difference]: Start difference. First operand 1611 states and 2374 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 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 06:50:31,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 06:50:31,011 INFO L93 Difference]: Finished difference Result 2721 states and 4066 transitions. [2024-12-02 06:50:31,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-02 06:50:31,011 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 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 06:50:31,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 06:50:31,020 INFO L225 Difference]: With dead ends: 2721 [2024-12-02 06:50:31,020 INFO L226 Difference]: Without dead ends: 2375 [2024-12-02 06:50:31,022 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 06:50:31,023 INFO L435 NwaCegarLoop]: 374 mSDtfsCounter, 568 mSDsluCounter, 496 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 568 SdHoareTripleChecker+Valid, 870 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 06:50:31,023 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [568 Valid, 870 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-12-02 06:50:31,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2375 states. [2024-12-02 06:50:31,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2375 to 1921. [2024-12-02 06:50:31,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1921 states, 1920 states have (on average 1.4802083333333333) internal successors, (2842), 1920 states have internal predecessors, (2842), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 06:50:31,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1921 states to 1921 states and 2842 transitions. [2024-12-02 06:50:31,091 INFO L78 Accepts]: Start accepts. Automaton has 1921 states and 2842 transitions. Word has length 52 [2024-12-02 06:50:31,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 06:50:31,091 INFO L471 AbstractCegarLoop]: Abstraction has 1921 states and 2842 transitions. [2024-12-02 06:50:31,092 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 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 06:50:31,092 INFO L276 IsEmpty]: Start isEmpty. Operand 1921 states and 2842 transitions. [2024-12-02 06:50:31,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-12-02 06:50:31,093 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 06:50:31,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 06:50:31,093 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-12-02 06:50:31,094 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 06:50:31,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 06:50:31,094 INFO L85 PathProgramCache]: Analyzing trace with hash -1268142435, now seen corresponding path program 1 times [2024-12-02 06:50:31,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 06:50:31,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510764440] [2024-12-02 06:50:31,094 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:50:31,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 06:50:31,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:50:31,242 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 06:50:31,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 06:50:31,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510764440] [2024-12-02 06:50:31,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [510764440] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 06:50:31,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 06:50:31,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-12-02 06:50:31,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526729127] [2024-12-02 06:50:31,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 06:50:31,243 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-02 06:50:31,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 06:50:31,244 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-02 06:50:31,244 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-12-02 06:50:31,244 INFO L87 Difference]: Start difference. First operand 1921 states and 2842 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 06:50:31,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 06:50:31,372 INFO L93 Difference]: Finished difference Result 3135 states and 4687 transitions. [2024-12-02 06:50:31,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-02 06:50:31,372 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 06:50:31,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 06:50:31,381 INFO L225 Difference]: With dead ends: 3135 [2024-12-02 06:50:31,381 INFO L226 Difference]: Without dead ends: 2789 [2024-12-02 06:50:31,382 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 06:50:31,383 INFO L435 NwaCegarLoop]: 395 mSDtfsCounter, 570 mSDsluCounter, 608 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 570 SdHoareTripleChecker+Valid, 1003 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-12-02 06:50:31,383 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [570 Valid, 1003 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-12-02 06:50:31,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2789 states. [2024-12-02 06:50:31,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2789 to 2216. [2024-12-02 06:50:31,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2216 states, 2215 states have (on average 1.4853273137697518) internal successors, (3290), 2215 states have internal predecessors, (3290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 06:50:31,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2216 states to 2216 states and 3290 transitions. [2024-12-02 06:50:31,459 INFO L78 Accepts]: Start accepts. Automaton has 2216 states and 3290 transitions. Word has length 53 [2024-12-02 06:50:31,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 06:50:31,459 INFO L471 AbstractCegarLoop]: Abstraction has 2216 states and 3290 transitions. [2024-12-02 06:50:31,459 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 06:50:31,459 INFO L276 IsEmpty]: Start isEmpty. Operand 2216 states and 3290 transitions. [2024-12-02 06:50:31,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-12-02 06:50:31,461 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 06:50:31,461 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] [2024-12-02 06:50:31,461 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-12-02 06:50:31,461 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 06:50:31,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 06:50:31,462 INFO L85 PathProgramCache]: Analyzing trace with hash 1868949312, now seen corresponding path program 1 times [2024-12-02 06:50:31,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 06:50:31,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219853795] [2024-12-02 06:50:31,462 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:50:31,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 06:50:31,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:50:31,598 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 06:50:31,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 06:50:31,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219853795] [2024-12-02 06:50:31,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [219853795] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 06:50:31,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 06:50:31,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-12-02 06:50:31,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203160955] [2024-12-02 06:50:31,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 06:50:31,599 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-02 06:50:31,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 06:50:31,599 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-02 06:50:31,599 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-12-02 06:50:31,599 INFO L87 Difference]: Start difference. First operand 2216 states and 3290 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 4 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 06:50:31,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 06:50:31,818 INFO L93 Difference]: Finished difference Result 5194 states and 7716 transitions. [2024-12-02 06:50:31,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-02 06:50:31,819 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 4 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 56 [2024-12-02 06:50:31,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 06:50:31,828 INFO L225 Difference]: With dead ends: 5194 [2024-12-02 06:50:31,828 INFO L226 Difference]: Without dead ends: 3055 [2024-12-02 06:50:31,831 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 06:50:31,831 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 774 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 774 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-12-02 06:50:31,832 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [774 Valid, 213 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-12-02 06:50:31,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3055 states. [2024-12-02 06:50:31,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3055 to 3037. [2024-12-02 06:50:31,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3037 states, 3036 states have (on average 1.4720026350461133) internal successors, (4469), 3036 states have internal predecessors, (4469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 06:50:31,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3037 states to 3037 states and 4469 transitions. [2024-12-02 06:50:31,908 INFO L78 Accepts]: Start accepts. Automaton has 3037 states and 4469 transitions. Word has length 56 [2024-12-02 06:50:31,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 06:50:31,908 INFO L471 AbstractCegarLoop]: Abstraction has 3037 states and 4469 transitions. [2024-12-02 06:50:31,908 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 4 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 06:50:31,908 INFO L276 IsEmpty]: Start isEmpty. Operand 3037 states and 4469 transitions. [2024-12-02 06:50:31,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-12-02 06:50:31,910 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 06:50:31,910 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 06:50:31,910 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-12-02 06:50:31,910 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 06:50:31,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 06:50:31,911 INFO L85 PathProgramCache]: Analyzing trace with hash -281542782, now seen corresponding path program 1 times [2024-12-02 06:50:31,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 06:50:31,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261104980] [2024-12-02 06:50:31,911 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:50:31,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 06:50:31,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:50:32,019 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 06:50:32,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 06:50:32,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261104980] [2024-12-02 06:50:32,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [261104980] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 06:50:32,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 06:50:32,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-12-02 06:50:32,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290954640] [2024-12-02 06:50:32,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 06:50:32,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-02 06:50:32,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 06:50:32,020 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-02 06:50:32,021 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-12-02 06:50:32,021 INFO L87 Difference]: Start difference. First operand 3037 states and 4469 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 06:50:32,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 06:50:32,233 INFO L93 Difference]: Finished difference Result 7096 states and 10425 transitions. [2024-12-02 06:50:32,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-02 06:50:32,234 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 06:50:32,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 06:50:32,246 INFO L225 Difference]: With dead ends: 7096 [2024-12-02 06:50:32,246 INFO L226 Difference]: Without dead ends: 4145 [2024-12-02 06:50:32,249 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 06:50:32,250 INFO L435 NwaCegarLoop]: 122 mSDtfsCounter, 806 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 806 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-12-02 06:50:32,250 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [806 Valid, 201 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-12-02 06:50:32,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4145 states. [2024-12-02 06:50:32,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4145 to 3037. [2024-12-02 06:50:32,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3037 states, 3036 states have (on average 1.4555335968379446) internal successors, (4419), 3036 states have internal predecessors, (4419), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 06:50:32,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3037 states to 3037 states and 4419 transitions. [2024-12-02 06:50:32,327 INFO L78 Accepts]: Start accepts. Automaton has 3037 states and 4419 transitions. Word has length 57 [2024-12-02 06:50:32,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 06:50:32,327 INFO L471 AbstractCegarLoop]: Abstraction has 3037 states and 4419 transitions. [2024-12-02 06:50:32,327 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 06:50:32,328 INFO L276 IsEmpty]: Start isEmpty. Operand 3037 states and 4419 transitions. [2024-12-02 06:50:32,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-12-02 06:50:32,329 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 06:50:32,329 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 06:50:32,329 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-12-02 06:50:32,330 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 06:50:32,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 06:50:32,330 INFO L85 PathProgramCache]: Analyzing trace with hash -1520651092, now seen corresponding path program 1 times [2024-12-02 06:50:32,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 06:50:32,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885497110] [2024-12-02 06:50:32,330 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:50:32,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 06:50:32,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:50:32,435 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 06:50:32,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 06:50:32,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885497110] [2024-12-02 06:50:32,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1885497110] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 06:50:32,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 06:50:32,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-12-02 06:50:32,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018560921] [2024-12-02 06:50:32,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 06:50:32,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-02 06:50:32,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 06:50:32,436 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-02 06:50:32,436 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-12-02 06:50:32,437 INFO L87 Difference]: Start difference. First operand 3037 states and 4419 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 06:50:32,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 06:50:32,631 INFO L93 Difference]: Finished difference Result 7242 states and 10532 transitions. [2024-12-02 06:50:32,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-02 06:50:32,632 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 06:50:32,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 06:50:32,641 INFO L225 Difference]: With dead ends: 7242 [2024-12-02 06:50:32,641 INFO L226 Difference]: Without dead ends: 4246 [2024-12-02 06:50:32,644 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 06:50:32,645 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 783 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 783 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-12-02 06:50:32,645 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [783 Valid, 211 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-12-02 06:50:32,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4246 states. [2024-12-02 06:50:32,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4246 to 4221. [2024-12-02 06:50:32,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4221 states, 4220 states have (on average 1.4417061611374407) internal successors, (6084), 4220 states have internal predecessors, (6084), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 06:50:32,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4221 states to 4221 states and 6084 transitions. [2024-12-02 06:50:32,737 INFO L78 Accepts]: Start accepts. Automaton has 4221 states and 6084 transitions. Word has length 57 [2024-12-02 06:50:32,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 06:50:32,737 INFO L471 AbstractCegarLoop]: Abstraction has 4221 states and 6084 transitions. [2024-12-02 06:50:32,737 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 06:50:32,737 INFO L276 IsEmpty]: Start isEmpty. Operand 4221 states and 6084 transitions. [2024-12-02 06:50:32,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-12-02 06:50:32,739 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 06:50:32,739 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 06:50:32,739 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-12-02 06:50:32,740 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 06:50:32,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 06:50:32,740 INFO L85 PathProgramCache]: Analyzing trace with hash -1438328999, now seen corresponding path program 1 times [2024-12-02 06:50:32,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 06:50:32,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287558412] [2024-12-02 06:50:32,740 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:50:32,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 06:50:32,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:50:32,883 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 06:50:32,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 06:50:32,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287558412] [2024-12-02 06:50:32,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [287558412] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 06:50:32,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 06:50:32,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-12-02 06:50:32,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984145013] [2024-12-02 06:50:32,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 06:50:32,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-12-02 06:50:32,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 06:50:32,885 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-12-02 06:50:32,885 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-12-02 06:50:32,885 INFO L87 Difference]: Start difference. First operand 4221 states and 6084 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 6 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 06:50:33,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 06:50:33,208 INFO L93 Difference]: Finished difference Result 10022 states and 14369 transitions. [2024-12-02 06:50:33,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-12-02 06:50:33,208 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 6 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 06:50:33,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 06:50:33,231 INFO L225 Difference]: With dead ends: 10022 [2024-12-02 06:50:33,231 INFO L226 Difference]: Without dead ends: 8652 [2024-12-02 06:50:33,234 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 06:50:33,235 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 1342 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 259 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1342 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-12-02 06:50:33,235 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1342 Valid, 368 Invalid, 278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 259 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-12-02 06:50:33,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8652 states. [2024-12-02 06:50:33,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8652 to 4233. [2024-12-02 06:50:33,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4233 states, 4232 states have (on average 1.4413988657844992) internal successors, (6100), 4232 states have internal predecessors, (6100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 06:50:33,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4233 states to 4233 states and 6100 transitions. [2024-12-02 06:50:33,330 INFO L78 Accepts]: Start accepts. Automaton has 4233 states and 6100 transitions. Word has length 58 [2024-12-02 06:50:33,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 06:50:33,330 INFO L471 AbstractCegarLoop]: Abstraction has 4233 states and 6100 transitions. [2024-12-02 06:50:33,330 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 6 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 06:50:33,330 INFO L276 IsEmpty]: Start isEmpty. Operand 4233 states and 6100 transitions. [2024-12-02 06:50:33,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-12-02 06:50:33,332 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 06:50:33,332 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 06:50:33,332 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-12-02 06:50:33,333 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 06:50:33,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 06:50:33,333 INFO L85 PathProgramCache]: Analyzing trace with hash -497478917, now seen corresponding path program 1 times [2024-12-02 06:50:33,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 06:50:33,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776011335] [2024-12-02 06:50:33,333 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:50:33,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 06:50:33,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:50:33,467 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 06:50:33,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 06:50:33,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776011335] [2024-12-02 06:50:33,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1776011335] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 06:50:33,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 06:50:33,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-12-02 06:50:33,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608576169] [2024-12-02 06:50:33,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 06:50:33,467 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-12-02 06:50:33,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 06:50:33,468 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-12-02 06:50:33,468 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-12-02 06:50:33,468 INFO L87 Difference]: Start difference. First operand 4233 states and 6100 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 06:50:33,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 06:50:33,757 INFO L93 Difference]: Finished difference Result 9517 states and 13618 transitions. [2024-12-02 06:50:33,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-12-02 06:50:33,758 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 06:50:33,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 06:50:33,773 INFO L225 Difference]: With dead ends: 9517 [2024-12-02 06:50:33,774 INFO L226 Difference]: Without dead ends: 7303 [2024-12-02 06:50:33,777 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 06:50:33,778 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 999 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 999 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-12-02 06:50:33,778 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [999 Valid, 318 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 215 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-12-02 06:50:33,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7303 states. [2024-12-02 06:50:33,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7303 to 4253. [2024-12-02 06:50:33,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4253 states, 4252 states have (on average 1.440263405456256) internal successors, (6124), 4252 states have internal predecessors, (6124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 06:50:33,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4253 states to 4253 states and 6124 transitions. [2024-12-02 06:50:33,865 INFO L78 Accepts]: Start accepts. Automaton has 4253 states and 6124 transitions. Word has length 59 [2024-12-02 06:50:33,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 06:50:33,865 INFO L471 AbstractCegarLoop]: Abstraction has 4253 states and 6124 transitions. [2024-12-02 06:50:33,865 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 06:50:33,866 INFO L276 IsEmpty]: Start isEmpty. Operand 4253 states and 6124 transitions. [2024-12-02 06:50:33,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-12-02 06:50:33,868 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 06:50:33,868 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 06:50:33,868 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-12-02 06:50:33,868 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 06:50:33,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 06:50:33,869 INFO L85 PathProgramCache]: Analyzing trace with hash -2094347044, now seen corresponding path program 1 times [2024-12-02 06:50:33,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 06:50:33,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198601198] [2024-12-02 06:50:33,869 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:50:33,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 06:50:33,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:50:34,010 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 06:50:34,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 06:50:34,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198601198] [2024-12-02 06:50:34,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1198601198] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 06:50:34,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 06:50:34,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-12-02 06:50:34,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913801767] [2024-12-02 06:50:34,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 06:50:34,011 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-12-02 06:50:34,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 06:50:34,011 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-12-02 06:50:34,011 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-12-02 06:50:34,012 INFO L87 Difference]: Start difference. First operand 4253 states and 6124 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 06:50:34,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 06:50:34,334 INFO L93 Difference]: Finished difference Result 11059 states and 15823 transitions. [2024-12-02 06:50:34,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-12-02 06:50:34,335 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 06:50:34,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 06:50:34,353 INFO L225 Difference]: With dead ends: 11059 [2024-12-02 06:50:34,353 INFO L226 Difference]: Without dead ends: 9017 [2024-12-02 06:50:34,356 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 06:50:34,357 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 1180 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 249 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1180 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-12-02 06:50:34,357 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1180 Valid, 352 Invalid, 268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 249 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-12-02 06:50:34,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9017 states. [2024-12-02 06:50:34,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9017 to 4331. [2024-12-02 06:50:34,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4331 states, 4330 states have (on average 1.4374133949191685) internal successors, (6224), 4330 states have internal predecessors, (6224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 06:50:34,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4331 states to 4331 states and 6224 transitions. [2024-12-02 06:50:34,441 INFO L78 Accepts]: Start accepts. Automaton has 4331 states and 6224 transitions. Word has length 59 [2024-12-02 06:50:34,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 06:50:34,441 INFO L471 AbstractCegarLoop]: Abstraction has 4331 states and 6224 transitions. [2024-12-02 06:50:34,442 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 06:50:34,442 INFO L276 IsEmpty]: Start isEmpty. Operand 4331 states and 6224 transitions. [2024-12-02 06:50:34,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-12-02 06:50:34,443 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 06:50:34,443 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] [2024-12-02 06:50:34,444 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-12-02 06:50:34,444 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 06:50:34,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 06:50:34,444 INFO L85 PathProgramCache]: Analyzing trace with hash 740296785, now seen corresponding path program 1 times [2024-12-02 06:50:34,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 06:50:34,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826804291] [2024-12-02 06:50:34,444 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:50:34,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 06:50:34,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:50:34,708 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 06:50:34,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 06:50:34,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826804291] [2024-12-02 06:50:34,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1826804291] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 06:50:34,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 06:50:34,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-12-02 06:50:34,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937901408] [2024-12-02 06:50:34,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 06:50:34,709 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-12-02 06:50:34,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 06:50:34,709 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-12-02 06:50:34,709 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-12-02 06:50:34,709 INFO L87 Difference]: Start difference. First operand 4331 states and 6224 transitions. Second operand has 10 states, 10 states have (on average 6.1) internal successors, (61), 9 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 06:50:35,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 06:50:35,171 INFO L93 Difference]: Finished difference Result 10446 states and 15050 transitions. [2024-12-02 06:50:35,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-12-02 06:50:35,171 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.1) internal successors, (61), 9 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2024-12-02 06:50:35,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 06:50:35,184 INFO L225 Difference]: With dead ends: 10446 [2024-12-02 06:50:35,184 INFO L226 Difference]: Without dead ends: 6869 [2024-12-02 06:50:35,186 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2024-12-02 06:50:35,187 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 505 mSDsluCounter, 525 mSDsCounter, 0 mSdLazyCounter, 502 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 505 SdHoareTripleChecker+Valid, 644 SdHoareTripleChecker+Invalid, 512 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 502 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-12-02 06:50:35,187 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [505 Valid, 644 Invalid, 512 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 502 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-12-02 06:50:35,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6869 states. [2024-12-02 06:50:35,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6869 to 4331. [2024-12-02 06:50:35,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4331 states, 4330 states have (on average 1.4360277136258661) internal successors, (6218), 4330 states have internal predecessors, (6218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 06:50:35,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4331 states to 4331 states and 6218 transitions. [2024-12-02 06:50:35,289 INFO L78 Accepts]: Start accepts. Automaton has 4331 states and 6218 transitions. Word has length 61 [2024-12-02 06:50:35,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 06:50:35,289 INFO L471 AbstractCegarLoop]: Abstraction has 4331 states and 6218 transitions. [2024-12-02 06:50:35,290 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.1) internal successors, (61), 9 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 06:50:35,290 INFO L276 IsEmpty]: Start isEmpty. Operand 4331 states and 6218 transitions. [2024-12-02 06:50:35,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-12-02 06:50:35,294 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 06:50:35,294 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] [2024-12-02 06:50:35,294 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-12-02 06:50:35,294 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 06:50:35,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 06:50:35,295 INFO L85 PathProgramCache]: Analyzing trace with hash 1120228239, now seen corresponding path program 1 times [2024-12-02 06:50:35,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 06:50:35,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301728883] [2024-12-02 06:50:35,295 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:50:35,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 06:50:35,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:50:35,605 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 06:50:35,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 06:50:35,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301728883] [2024-12-02 06:50:35,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1301728883] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 06:50:35,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 06:50:35,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-12-02 06:50:35,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441004869] [2024-12-02 06:50:35,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 06:50:35,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-12-02 06:50:35,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 06:50:35,606 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-12-02 06:50:35,606 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-12-02 06:50:35,607 INFO L87 Difference]: Start difference. First operand 4331 states and 6218 transitions. Second operand has 10 states, 10 states have (on average 6.1) internal successors, (61), 9 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 06:50:36,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 06:50:36,188 INFO L93 Difference]: Finished difference Result 10211 states and 14718 transitions. [2024-12-02 06:50:36,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-12-02 06:50:36,189 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.1) internal successors, (61), 9 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2024-12-02 06:50:36,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 06:50:36,199 INFO L225 Difference]: With dead ends: 10211 [2024-12-02 06:50:36,199 INFO L226 Difference]: Without dead ends: 6767 [2024-12-02 06:50:36,203 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 06:50:36,204 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 1184 mSDsluCounter, 559 mSDsCounter, 0 mSdLazyCounter, 563 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1184 SdHoareTripleChecker+Valid, 692 SdHoareTripleChecker+Invalid, 575 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 563 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-12-02 06:50:36,204 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1184 Valid, 692 Invalid, 575 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 563 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-12-02 06:50:36,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6767 states. [2024-12-02 06:50:36,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6767 to 4249. [2024-12-02 06:50:36,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4249 states, 4248 states have (on average 1.4324387947269304) internal successors, (6085), 4248 states have internal predecessors, (6085), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 06:50:36,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4249 states to 4249 states and 6085 transitions. [2024-12-02 06:50:36,305 INFO L78 Accepts]: Start accepts. Automaton has 4249 states and 6085 transitions. Word has length 61 [2024-12-02 06:50:36,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 06:50:36,305 INFO L471 AbstractCegarLoop]: Abstraction has 4249 states and 6085 transitions. [2024-12-02 06:50:36,306 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.1) internal successors, (61), 9 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 06:50:36,306 INFO L276 IsEmpty]: Start isEmpty. Operand 4249 states and 6085 transitions. [2024-12-02 06:50:36,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-12-02 06:50:36,308 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 06:50:36,308 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] [2024-12-02 06:50:36,309 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-12-02 06:50:36,309 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 06:50:36,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 06:50:36,309 INFO L85 PathProgramCache]: Analyzing trace with hash 1451678096, now seen corresponding path program 1 times [2024-12-02 06:50:36,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 06:50:36,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118999134] [2024-12-02 06:50:36,309 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:50:36,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 06:50:36,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:50:36,568 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 06:50:36,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 06:50:36,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118999134] [2024-12-02 06:50:36,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1118999134] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 06:50:36,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 06:50:36,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-12-02 06:50:36,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617970548] [2024-12-02 06:50:36,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 06:50:36,569 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-12-02 06:50:36,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 06:50:36,570 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-12-02 06:50:36,570 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-12-02 06:50:36,570 INFO L87 Difference]: Start difference. First operand 4249 states and 6085 transitions. Second operand has 10 states, 10 states have (on average 6.1) internal successors, (61), 9 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 06:50:37,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 06:50:37,222 INFO L93 Difference]: Finished difference Result 11244 states and 16202 transitions. [2024-12-02 06:50:37,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-12-02 06:50:37,223 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.1) internal successors, (61), 9 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2024-12-02 06:50:37,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 06:50:37,235 INFO L225 Difference]: With dead ends: 11244 [2024-12-02 06:50:37,235 INFO L226 Difference]: Without dead ends: 7672 [2024-12-02 06:50:37,239 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=103, Invalid=317, Unknown=0, NotChecked=0, Total=420 [2024-12-02 06:50:37,240 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 932 mSDsluCounter, 768 mSDsCounter, 0 mSdLazyCounter, 720 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 932 SdHoareTripleChecker+Valid, 915 SdHoareTripleChecker+Invalid, 731 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 720 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-12-02 06:50:37,240 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [932 Valid, 915 Invalid, 731 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 720 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-12-02 06:50:37,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7672 states. [2024-12-02 06:50:37,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7672 to 4074. [2024-12-02 06:50:37,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4074 states, 4073 states have (on average 1.4286766511171127) internal successors, (5819), 4073 states have internal predecessors, (5819), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 06:50:37,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4074 states to 4074 states and 5819 transitions. [2024-12-02 06:50:37,342 INFO L78 Accepts]: Start accepts. Automaton has 4074 states and 5819 transitions. Word has length 61 [2024-12-02 06:50:37,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 06:50:37,343 INFO L471 AbstractCegarLoop]: Abstraction has 4074 states and 5819 transitions. [2024-12-02 06:50:37,343 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.1) internal successors, (61), 9 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 06:50:37,343 INFO L276 IsEmpty]: Start isEmpty. Operand 4074 states and 5819 transitions. [2024-12-02 06:50:37,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-12-02 06:50:37,345 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 06:50:37,345 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 06:50:37,345 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-12-02 06:50:37,345 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 06:50:37,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 06:50:37,345 INFO L85 PathProgramCache]: Analyzing trace with hash 218587336, now seen corresponding path program 1 times [2024-12-02 06:50:37,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 06:50:37,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67677153] [2024-12-02 06:50:37,346 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:50:37,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 06:50:37,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:50:37,400 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 06:50:37,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 06:50:37,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67677153] [2024-12-02 06:50:37,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [67677153] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 06:50:37,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 06:50:37,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-02 06:50:37,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042169117] [2024-12-02 06:50:37,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 06:50:37,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 06:50:37,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 06:50:37,401 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 06:50:37,401 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 06:50:37,402 INFO L87 Difference]: Start difference. First operand 4074 states and 5819 transitions. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 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 06:50:37,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 06:50:37,434 INFO L93 Difference]: Finished difference Result 6080 states and 8710 transitions. [2024-12-02 06:50:37,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 06:50:37,435 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 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 06:50:37,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 06:50:37,442 INFO L225 Difference]: With dead ends: 6080 [2024-12-02 06:50:37,442 INFO L226 Difference]: Without dead ends: 3967 [2024-12-02 06:50:37,444 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 06:50:37,445 INFO L435 NwaCegarLoop]: 302 mSDtfsCounter, 132 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 476 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 06:50:37,445 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 476 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 06:50:37,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3967 states. [2024-12-02 06:50:37,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3967 to 3965. [2024-12-02 06:50:37,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3965 states, 3964 states have (on average 1.4129667003027244) internal successors, (5601), 3964 states have internal predecessors, (5601), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 06:50:37,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3965 states to 3965 states and 5601 transitions. [2024-12-02 06:50:37,496 INFO L78 Accepts]: Start accepts. Automaton has 3965 states and 5601 transitions. Word has length 62 [2024-12-02 06:50:37,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 06:50:37,497 INFO L471 AbstractCegarLoop]: Abstraction has 3965 states and 5601 transitions. [2024-12-02 06:50:37,497 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 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 06:50:37,497 INFO L276 IsEmpty]: Start isEmpty. Operand 3965 states and 5601 transitions. [2024-12-02 06:50:37,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-12-02 06:50:37,498 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 06:50:37,499 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 06:50:37,499 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-12-02 06:50:37,499 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 06:50:37,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 06:50:37,499 INFO L85 PathProgramCache]: Analyzing trace with hash -1004137309, now seen corresponding path program 1 times [2024-12-02 06:50:37,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 06:50:37,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803215012] [2024-12-02 06:50:37,499 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:50:37,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 06:50:37,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:50:37,551 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 06:50:37,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 06:50:37,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803215012] [2024-12-02 06:50:37,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1803215012] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 06:50:37,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 06:50:37,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-02 06:50:37,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849671432] [2024-12-02 06:50:37,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 06:50:37,552 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 06:50:37,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 06:50:37,552 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 06:50:37,552 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 06:50:37,552 INFO L87 Difference]: Start difference. First operand 3965 states and 5601 transitions. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 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 06:50:37,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 06:50:37,582 INFO L93 Difference]: Finished difference Result 5467 states and 7722 transitions. [2024-12-02 06:50:37,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 06:50:37,582 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 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 06:50:37,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 06:50:37,589 INFO L225 Difference]: With dead ends: 5467 [2024-12-02 06:50:37,589 INFO L226 Difference]: Without dead ends: 3372 [2024-12-02 06:50:37,591 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 06:50:37,591 INFO L435 NwaCegarLoop]: 291 mSDtfsCounter, 120 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 465 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 06:50:37,591 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 465 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 06:50:37,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3372 states. [2024-12-02 06:50:37,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3372 to 3370. [2024-12-02 06:50:37,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3370 states, 3369 states have (on average 1.3864648263579697) internal successors, (4671), 3369 states have internal predecessors, (4671), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 06:50:37,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3370 states to 3370 states and 4671 transitions. [2024-12-02 06:50:37,633 INFO L78 Accepts]: Start accepts. Automaton has 3370 states and 4671 transitions. Word has length 62 [2024-12-02 06:50:37,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 06:50:37,633 INFO L471 AbstractCegarLoop]: Abstraction has 3370 states and 4671 transitions. [2024-12-02 06:50:37,633 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 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 06:50:37,633 INFO L276 IsEmpty]: Start isEmpty. Operand 3370 states and 4671 transitions. [2024-12-02 06:50:37,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-12-02 06:50:37,635 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 06:50:37,635 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 06:50:37,635 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-12-02 06:50:37,635 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 06:50:37,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 06:50:37,636 INFO L85 PathProgramCache]: Analyzing trace with hash -17959571, now seen corresponding path program 1 times [2024-12-02 06:50:37,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 06:50:37,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303189934] [2024-12-02 06:50:37,636 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:50:37,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 06:50:37,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:50:37,684 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 06:50:37,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 06:50:37,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303189934] [2024-12-02 06:50:37,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [303189934] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 06:50:37,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 06:50:37,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-02 06:50:37,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868170016] [2024-12-02 06:50:37,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 06:50:37,685 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 06:50:37,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 06:50:37,685 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 06:50:37,686 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 06:50:37,686 INFO L87 Difference]: Start difference. First operand 3370 states and 4671 transitions. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 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 06:50:37,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 06:50:37,720 INFO L93 Difference]: Finished difference Result 4119 states and 5686 transitions. [2024-12-02 06:50:37,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 06:50:37,720 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 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 06:50:37,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 06:50:37,725 INFO L225 Difference]: With dead ends: 4119 [2024-12-02 06:50:37,726 INFO L226 Difference]: Without dead ends: 2782 [2024-12-02 06:50:37,727 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 06:50:37,728 INFO L435 NwaCegarLoop]: 323 mSDtfsCounter, 150 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 481 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 06:50:37,728 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 481 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 06:50:37,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2782 states. [2024-12-02 06:50:37,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2782 to 2780. [2024-12-02 06:50:37,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2780 states, 2779 states have (on average 1.3537243612810363) internal successors, (3762), 2779 states have internal predecessors, (3762), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 06:50:37,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2780 states to 2780 states and 3762 transitions. [2024-12-02 06:50:37,773 INFO L78 Accepts]: Start accepts. Automaton has 2780 states and 3762 transitions. Word has length 62 [2024-12-02 06:50:37,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 06:50:37,773 INFO L471 AbstractCegarLoop]: Abstraction has 2780 states and 3762 transitions. [2024-12-02 06:50:37,773 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 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 06:50:37,773 INFO L276 IsEmpty]: Start isEmpty. Operand 2780 states and 3762 transitions. [2024-12-02 06:50:37,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-12-02 06:50:37,775 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 06:50:37,775 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 06:50:37,775 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-12-02 06:50:37,775 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 06:50:37,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 06:50:37,776 INFO L85 PathProgramCache]: Analyzing trace with hash -467159905, now seen corresponding path program 1 times [2024-12-02 06:50:37,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 06:50:37,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006572073] [2024-12-02 06:50:37,776 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:50:37,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 06:50:37,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:50:38,454 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 06:50:38,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 06:50:38,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006572073] [2024-12-02 06:50:38,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2006572073] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 06:50:38,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 06:50:38,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-12-02 06:50:38,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545922955] [2024-12-02 06:50:38,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 06:50:38,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-12-02 06:50:38,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 06:50:38,456 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-12-02 06:50:38,456 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2024-12-02 06:50:38,456 INFO L87 Difference]: Start difference. First operand 2780 states and 3762 transitions. Second operand has 13 states, 13 states have (on average 4.846153846153846) internal successors, (63), 13 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 06:50:39,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 06:50:39,397 INFO L93 Difference]: Finished difference Result 7247 states and 9930 transitions. [2024-12-02 06:50:39,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-12-02 06:50:39,397 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.846153846153846) internal successors, (63), 13 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 06:50:39,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 06:50:39,410 INFO L225 Difference]: With dead ends: 7247 [2024-12-02 06:50:39,410 INFO L226 Difference]: Without dead ends: 6859 [2024-12-02 06:50:39,413 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=166, Invalid=434, Unknown=0, NotChecked=0, Total=600 [2024-12-02 06:50:39,413 INFO L435 NwaCegarLoop]: 234 mSDtfsCounter, 1632 mSDsluCounter, 1534 mSDsCounter, 0 mSdLazyCounter, 592 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1632 SdHoareTripleChecker+Valid, 1768 SdHoareTripleChecker+Invalid, 598 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 592 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-12-02 06:50:39,414 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1632 Valid, 1768 Invalid, 598 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 592 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-12-02 06:50:39,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6859 states. [2024-12-02 06:50:39,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6859 to 2691. [2024-12-02 06:50:39,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2691 states, 2690 states have (on average 1.3535315985130112) internal successors, (3641), 2690 states have internal predecessors, (3641), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 06:50:39,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2691 states to 2691 states and 3641 transitions. [2024-12-02 06:50:39,486 INFO L78 Accepts]: Start accepts. Automaton has 2691 states and 3641 transitions. Word has length 63 [2024-12-02 06:50:39,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 06:50:39,486 INFO L471 AbstractCegarLoop]: Abstraction has 2691 states and 3641 transitions. [2024-12-02 06:50:39,486 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.846153846153846) internal successors, (63), 13 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 06:50:39,486 INFO L276 IsEmpty]: Start isEmpty. Operand 2691 states and 3641 transitions. [2024-12-02 06:50:39,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-12-02 06:50:39,488 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 06:50:39,488 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 06:50:39,488 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-12-02 06:50:39,488 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 06:50:39,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 06:50:39,489 INFO L85 PathProgramCache]: Analyzing trace with hash 1791049563, now seen corresponding path program 1 times [2024-12-02 06:50:39,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 06:50:39,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940652825] [2024-12-02 06:50:39,489 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:50:39,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 06:50:39,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:50:40,093 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 06:50:40,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 06:50:40,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940652825] [2024-12-02 06:50:40,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [940652825] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 06:50:40,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 06:50:40,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-12-02 06:50:40,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373922108] [2024-12-02 06:50:40,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 06:50:40,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-12-02 06:50:40,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 06:50:40,094 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-12-02 06:50:40,094 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2024-12-02 06:50:40,094 INFO L87 Difference]: Start difference. First operand 2691 states and 3641 transitions. Second operand has 13 states, 13 states have (on average 4.846153846153846) internal successors, (63), 13 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 06:50:40,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 06:50:40,852 INFO L93 Difference]: Finished difference Result 4033 states and 5495 transitions. [2024-12-02 06:50:40,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-12-02 06:50:40,853 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.846153846153846) internal successors, (63), 13 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 06:50:40,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 06:50:40,857 INFO L225 Difference]: With dead ends: 4033 [2024-12-02 06:50:40,857 INFO L226 Difference]: Without dead ends: 3807 [2024-12-02 06:50:40,858 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 06:50:40,859 INFO L435 NwaCegarLoop]: 202 mSDtfsCounter, 1060 mSDsluCounter, 1404 mSDsCounter, 0 mSdLazyCounter, 435 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1060 SdHoareTripleChecker+Valid, 1606 SdHoareTripleChecker+Invalid, 440 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 435 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-12-02 06:50:40,859 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1060 Valid, 1606 Invalid, 440 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 435 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-12-02 06:50:40,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3807 states. [2024-12-02 06:50:40,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3807 to 2644. [2024-12-02 06:50:40,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2644 states, 2643 states have (on average 1.35262958758986) internal successors, (3575), 2643 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 06:50:40,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2644 states to 2644 states and 3575 transitions. [2024-12-02 06:50:40,895 INFO L78 Accepts]: Start accepts. Automaton has 2644 states and 3575 transitions. Word has length 63 [2024-12-02 06:50:40,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 06:50:40,895 INFO L471 AbstractCegarLoop]: Abstraction has 2644 states and 3575 transitions. [2024-12-02 06:50:40,895 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.846153846153846) internal successors, (63), 13 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 06:50:40,896 INFO L276 IsEmpty]: Start isEmpty. Operand 2644 states and 3575 transitions. [2024-12-02 06:50:40,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-12-02 06:50:40,897 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 06:50:40,897 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 06:50:40,897 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-12-02 06:50:40,897 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 06:50:40,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 06:50:40,897 INFO L85 PathProgramCache]: Analyzing trace with hash -37454644, now seen corresponding path program 1 times [2024-12-02 06:50:40,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 06:50:40,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419980653] [2024-12-02 06:50:40,898 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:50:40,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 06:50:40,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:50:40,940 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 06:50:40,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 06:50:40,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419980653] [2024-12-02 06:50:40,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1419980653] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 06:50:40,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 06:50:40,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-02 06:50:40,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455682137] [2024-12-02 06:50:40,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 06:50:40,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 06:50:40,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 06:50:40,942 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 06:50:40,942 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 06:50:40,942 INFO L87 Difference]: Start difference. First operand 2644 states and 3575 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 06:50:40,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 06:50:40,983 INFO L93 Difference]: Finished difference Result 4848 states and 6611 transitions. [2024-12-02 06:50:40,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 06:50:40,986 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 06:50:40,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 06:50:40,991 INFO L225 Difference]: With dead ends: 4848 [2024-12-02 06:50:40,991 INFO L226 Difference]: Without dead ends: 3502 [2024-12-02 06:50:40,993 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 06:50:40,994 INFO L435 NwaCegarLoop]: 192 mSDtfsCounter, 150 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 307 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 06:50:40,995 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 307 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 06:50:40,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3502 states. [2024-12-02 06:50:41,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3502 to 2474. [2024-12-02 06:50:41,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2474 states, 2473 states have (on average 1.3517994338859685) internal successors, (3343), 2473 states have internal predecessors, (3343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 06:50:41,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2474 states to 2474 states and 3343 transitions. [2024-12-02 06:50:41,027 INFO L78 Accepts]: Start accepts. Automaton has 2474 states and 3343 transitions. Word has length 63 [2024-12-02 06:50:41,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 06:50:41,027 INFO L471 AbstractCegarLoop]: Abstraction has 2474 states and 3343 transitions. [2024-12-02 06:50:41,027 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 06:50:41,027 INFO L276 IsEmpty]: Start isEmpty. Operand 2474 states and 3343 transitions. [2024-12-02 06:50:41,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-12-02 06:50:41,028 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 06:50:41,029 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] [2024-12-02 06:50:41,029 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-12-02 06:50:41,029 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 06:50:41,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 06:50:41,029 INFO L85 PathProgramCache]: Analyzing trace with hash 1695928295, now seen corresponding path program 1 times [2024-12-02 06:50:41,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 06:50:41,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596001914] [2024-12-02 06:50:41,030 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:50:41,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 06:50:41,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:50:41,118 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 06:50:41,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 06:50:41,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596001914] [2024-12-02 06:50:41,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1596001914] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 06:50:41,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 06:50:41,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-12-02 06:50:41,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941096263] [2024-12-02 06:50:41,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 06:50:41,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-02 06:50:41,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 06:50:41,119 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-02 06:50:41,119 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-12-02 06:50:41,119 INFO L87 Difference]: Start difference. First operand 2474 states and 3343 transitions. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 06:50:41,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 06:50:41,171 INFO L93 Difference]: Finished difference Result 2480 states and 3346 transitions. [2024-12-02 06:50:41,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-02 06:50:41,171 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2024-12-02 06:50:41,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 06:50:41,175 INFO L225 Difference]: With dead ends: 2480 [2024-12-02 06:50:41,175 INFO L226 Difference]: Without dead ends: 2265 [2024-12-02 06:50:41,176 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 06:50:41,176 INFO L435 NwaCegarLoop]: 306 mSDtfsCounter, 438 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 438 SdHoareTripleChecker+Valid, 558 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 06:50:41,177 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [438 Valid, 558 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 06:50:41,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2265 states. [2024-12-02 06:50:41,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2265 to 2261. [2024-12-02 06:50:41,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2261 states, 2260 states have (on average 1.3539823008849559) internal successors, (3060), 2260 states have internal predecessors, (3060), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 06:50:41,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2261 states to 2261 states and 3060 transitions. [2024-12-02 06:50:41,202 INFO L78 Accepts]: Start accepts. Automaton has 2261 states and 3060 transitions. Word has length 65 [2024-12-02 06:50:41,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 06:50:41,202 INFO L471 AbstractCegarLoop]: Abstraction has 2261 states and 3060 transitions. [2024-12-02 06:50:41,202 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 06:50:41,202 INFO L276 IsEmpty]: Start isEmpty. Operand 2261 states and 3060 transitions. [2024-12-02 06:50:41,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-12-02 06:50:41,203 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 06:50:41,203 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 06:50:41,203 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-12-02 06:50:41,204 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 06:50:41,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 06:50:41,204 INFO L85 PathProgramCache]: Analyzing trace with hash -1507814999, now seen corresponding path program 1 times [2024-12-02 06:50:41,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 06:50:41,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832940596] [2024-12-02 06:50:41,204 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:50:41,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 06:50:41,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:50:41,301 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 06:50:41,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 06:50:41,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832940596] [2024-12-02 06:50:41,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [832940596] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 06:50:41,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 06:50:41,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-02 06:50:41,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456018823] [2024-12-02 06:50:41,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 06:50:41,302 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 06:50:41,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 06:50:41,303 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 06:50:41,303 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 06:50:41,303 INFO L87 Difference]: Start difference. First operand 2261 states and 3060 transitions. Second operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 06:50:41,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 06:50:41,330 INFO L93 Difference]: Finished difference Result 5620 states and 7724 transitions. [2024-12-02 06:50:41,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 06:50:41,331 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2024-12-02 06:50:41,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 06:50:41,335 INFO L225 Difference]: With dead ends: 5620 [2024-12-02 06:50:41,336 INFO L226 Difference]: Without dead ends: 3863 [2024-12-02 06:50:41,338 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 06:50:41,338 INFO L435 NwaCegarLoop]: 256 mSDtfsCounter, 103 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 405 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 06:50:41,338 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 405 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 06:50:41,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3863 states. [2024-12-02 06:50:41,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3863 to 3595. [2024-12-02 06:50:41,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3595 states, 3594 states have (on average 1.3617139677239845) internal successors, (4894), 3594 states have internal predecessors, (4894), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 06:50:41,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3595 states to 3595 states and 4894 transitions. [2024-12-02 06:50:41,380 INFO L78 Accepts]: Start accepts. Automaton has 3595 states and 4894 transitions. Word has length 68 [2024-12-02 06:50:41,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 06:50:41,380 INFO L471 AbstractCegarLoop]: Abstraction has 3595 states and 4894 transitions. [2024-12-02 06:50:41,380 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 06:50:41,380 INFO L276 IsEmpty]: Start isEmpty. Operand 3595 states and 4894 transitions. [2024-12-02 06:50:41,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-12-02 06:50:41,381 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 06:50:41,381 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] [2024-12-02 06:50:41,382 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-12-02 06:50:41,382 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 06:50:41,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 06:50:41,382 INFO L85 PathProgramCache]: Analyzing trace with hash -1724760844, now seen corresponding path program 1 times [2024-12-02 06:50:41,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 06:50:41,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552050085] [2024-12-02 06:50:41,382 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:50:41,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 06:50:41,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:50:41,463 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 06:50:41,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 06:50:41,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552050085] [2024-12-02 06:50:41,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [552050085] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 06:50:41,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 06:50:41,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-02 06:50:41,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328589478] [2024-12-02 06:50:41,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 06:50:41,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 06:50:41,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 06:50:41,464 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 06:50:41,464 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 06:50:41,464 INFO L87 Difference]: Start difference. First operand 3595 states and 4894 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 06:50:41,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 06:50:41,498 INFO L93 Difference]: Finished difference Result 9467 states and 12988 transitions. [2024-12-02 06:50:41,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 06:50:41,499 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2024-12-02 06:50:41,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 06:50:41,507 INFO L225 Difference]: With dead ends: 9467 [2024-12-02 06:50:41,507 INFO L226 Difference]: Without dead ends: 6376 [2024-12-02 06:50:41,511 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 06:50:41,511 INFO L435 NwaCegarLoop]: 238 mSDtfsCounter, 92 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 397 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 06:50:41,511 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 397 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 06:50:41,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6376 states. [2024-12-02 06:50:41,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6376 to 5922. [2024-12-02 06:50:41,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5922 states, 5921 states have (on average 1.3622698868434386) internal successors, (8066), 5921 states have internal predecessors, (8066), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 06:50:41,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5922 states to 5922 states and 8066 transitions. [2024-12-02 06:50:41,584 INFO L78 Accepts]: Start accepts. Automaton has 5922 states and 8066 transitions. Word has length 69 [2024-12-02 06:50:41,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 06:50:41,584 INFO L471 AbstractCegarLoop]: Abstraction has 5922 states and 8066 transitions. [2024-12-02 06:50:41,584 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 06:50:41,584 INFO L276 IsEmpty]: Start isEmpty. Operand 5922 states and 8066 transitions. [2024-12-02 06:50:41,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-12-02 06:50:41,585 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 06:50:41,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 06:50:41,585 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-12-02 06:50:41,586 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 06:50:41,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 06:50:41,586 INFO L85 PathProgramCache]: Analyzing trace with hash 1274692746, now seen corresponding path program 1 times [2024-12-02 06:50:41,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 06:50:41,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376344141] [2024-12-02 06:50:41,586 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:50:41,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 06:50:41,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:50:41,791 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 06:50:41,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 06:50:41,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376344141] [2024-12-02 06:50:41,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [376344141] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 06:50:41,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 06:50:41,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-12-02 06:50:41,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286273443] [2024-12-02 06:50:41,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 06:50:41,792 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-12-02 06:50:41,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 06:50:41,792 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-12-02 06:50:41,793 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-12-02 06:50:41,793 INFO L87 Difference]: Start difference. First operand 5922 states and 8066 transitions. Second operand has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 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 06:50:41,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 06:50:41,838 INFO L93 Difference]: Finished difference Result 6416 states and 8723 transitions. [2024-12-02 06:50:41,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-12-02 06:50:41,839 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 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 06:50:41,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 06:50:41,847 INFO L225 Difference]: With dead ends: 6416 [2024-12-02 06:50:41,848 INFO L226 Difference]: Without dead ends: 6414 [2024-12-02 06:50:41,849 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 06:50:41,850 INFO L435 NwaCegarLoop]: 191 mSDtfsCounter, 0 mSDsluCounter, 754 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 945 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 06:50:41,850 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 945 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 06:50:41,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6414 states. [2024-12-02 06:50:41,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6414 to 6414. [2024-12-02 06:50:41,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6414 states, 6413 states have (on average 1.3344768439108061) internal successors, (8558), 6413 states have internal predecessors, (8558), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 06:50:41,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6414 states to 6414 states and 8558 transitions. [2024-12-02 06:50:41,920 INFO L78 Accepts]: Start accepts. Automaton has 6414 states and 8558 transitions. Word has length 72 [2024-12-02 06:50:41,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 06:50:41,921 INFO L471 AbstractCegarLoop]: Abstraction has 6414 states and 8558 transitions. [2024-12-02 06:50:41,921 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 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 06:50:41,921 INFO L276 IsEmpty]: Start isEmpty. Operand 6414 states and 8558 transitions. [2024-12-02 06:50:41,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-12-02 06:50:41,922 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 06:50:41,922 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] [2024-12-02 06:50:41,922 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-12-02 06:50:41,922 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 06:50:41,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 06:50:41,923 INFO L85 PathProgramCache]: Analyzing trace with hash -1392355153, now seen corresponding path program 1 times [2024-12-02 06:50:41,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 06:50:41,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028711757] [2024-12-02 06:50:41,923 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:50:41,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 06:50:41,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:50:41,971 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 06:50:41,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 06:50:41,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028711757] [2024-12-02 06:50:41,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2028711757] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 06:50:41,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 06:50:41,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-02 06:50:41,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51818552] [2024-12-02 06:50:41,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 06:50:41,972 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 06:50:41,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 06:50:41,972 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 06:50:41,972 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 06:50:41,973 INFO L87 Difference]: Start difference. First operand 6414 states and 8558 transitions. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 06:50:42,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 06:50:42,023 INFO L93 Difference]: Finished difference Result 16838 states and 22446 transitions. [2024-12-02 06:50:42,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 06:50:42,023 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 73 [2024-12-02 06:50:42,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 06:50:42,037 INFO L225 Difference]: With dead ends: 16838 [2024-12-02 06:50:42,037 INFO L226 Difference]: Without dead ends: 10848 [2024-12-02 06:50:42,043 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 06:50:42,043 INFO L435 NwaCegarLoop]: 190 mSDtfsCounter, 118 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 06:50:42,044 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 313 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 06:50:42,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10848 states. [2024-12-02 06:50:42,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10848 to 10682. [2024-12-02 06:50:42,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10682 states, 10681 states have (on average 1.2995037917797958) internal successors, (13880), 10681 states have internal predecessors, (13880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 06:50:42,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10682 states to 10682 states and 13880 transitions. [2024-12-02 06:50:42,158 INFO L78 Accepts]: Start accepts. Automaton has 10682 states and 13880 transitions. Word has length 73 [2024-12-02 06:50:42,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 06:50:42,158 INFO L471 AbstractCegarLoop]: Abstraction has 10682 states and 13880 transitions. [2024-12-02 06:50:42,158 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 06:50:42,158 INFO L276 IsEmpty]: Start isEmpty. Operand 10682 states and 13880 transitions. [2024-12-02 06:50:42,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-12-02 06:50:42,160 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 06:50:42,160 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 06:50:42,160 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-12-02 06:50:42,160 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 06:50:42,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 06:50:42,161 INFO L85 PathProgramCache]: Analyzing trace with hash 2638653, now seen corresponding path program 1 times [2024-12-02 06:50:42,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 06:50:42,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243672946] [2024-12-02 06:50:42,161 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:50:42,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 06:50:42,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:50:42,242 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 06:50:42,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 06:50:42,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243672946] [2024-12-02 06:50:42,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1243672946] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 06:50:42,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 06:50:42,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-02 06:50:42,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008547730] [2024-12-02 06:50:42,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 06:50:42,243 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 06:50:42,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 06:50:42,243 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 06:50:42,243 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 06:50:42,243 INFO L87 Difference]: Start difference. First operand 10682 states and 13880 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 06:50:42,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 06:50:42,356 INFO L93 Difference]: Finished difference Result 26998 states and 35062 transitions. [2024-12-02 06:50:42,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 06:50:42,356 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 06:50:42,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 06:50:42,376 INFO L225 Difference]: With dead ends: 26998 [2024-12-02 06:50:42,376 INFO L226 Difference]: Without dead ends: 16726 [2024-12-02 06:50:42,382 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 06:50:42,382 INFO L435 NwaCegarLoop]: 252 mSDtfsCounter, 97 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 391 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 06:50:42,382 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 391 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 06:50:42,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16726 states. [2024-12-02 06:50:42,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16726 to 15140. [2024-12-02 06:50:42,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15140 states, 15139 states have (on average 1.2876676134487086) internal successors, (19494), 15139 states have internal predecessors, (19494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 06:50:42,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15140 states to 15140 states and 19494 transitions. [2024-12-02 06:50:42,549 INFO L78 Accepts]: Start accepts. Automaton has 15140 states and 19494 transitions. Word has length 74 [2024-12-02 06:50:42,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 06:50:42,550 INFO L471 AbstractCegarLoop]: Abstraction has 15140 states and 19494 transitions. [2024-12-02 06:50:42,550 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 06:50:42,550 INFO L276 IsEmpty]: Start isEmpty. Operand 15140 states and 19494 transitions. [2024-12-02 06:50:42,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-12-02 06:50:42,553 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 06:50:42,554 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] [2024-12-02 06:50:42,554 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-12-02 06:50:42,554 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 06:50:42,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 06:50:42,554 INFO L85 PathProgramCache]: Analyzing trace with hash -786165995, now seen corresponding path program 1 times [2024-12-02 06:50:42,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 06:50:42,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568881278] [2024-12-02 06:50:42,555 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:50:42,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 06:50:42,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:50:42,893 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 06:50:42,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 06:50:42,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568881278] [2024-12-02 06:50:42,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [568881278] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 06:50:42,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2130629575] [2024-12-02 06:50:42,893 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:50:42,893 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 06:50:42,894 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_431199fd-7060-430a-960c-721b6172464a/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 06:50:42,896 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_431199fd-7060-430a-960c-721b6172464a/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 06:50:42,898 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_431199fd-7060-430a-960c-721b6172464a/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-12-02 06:50:43,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:50:43,050 INFO L256 TraceCheckSpWp]: Trace formula consists of 427 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-12-02 06:50:43,055 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 06:50:44,256 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 06:50:44,256 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 06:50:45,573 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 06:50:45,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2130629575] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 06:50:45,573 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 06:50:45,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 13, 14] total 30 [2024-12-02 06:50:45,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339063201] [2024-12-02 06:50:45,573 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 06:50:45,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-12-02 06:50:45,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 06:50:45,575 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-12-02 06:50:45,575 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=798, Unknown=0, NotChecked=0, Total=930 [2024-12-02 06:50:45,575 INFO L87 Difference]: Start difference. First operand 15140 states and 19494 transitions. Second operand has 31 states, 31 states have (on average 7.67741935483871) internal successors, (238), 30 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 06:51:01,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 06:51:01,161 INFO L93 Difference]: Finished difference Result 112668 states and 142940 transitions. [2024-12-02 06:51:01,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 232 states. [2024-12-02 06:51:01,161 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 7.67741935483871) internal successors, (238), 30 states have internal predecessors, (238), 0 states have call successors, (0), 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 92 [2024-12-02 06:51:01,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 06:51:01,260 INFO L225 Difference]: With dead ends: 112668 [2024-12-02 06:51:01,260 INFO L226 Difference]: Without dead ends: 105102 [2024-12-02 06:51:01,302 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 421 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 259 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28165 ImplicationChecksByTransitivity, 12.0s TimeCoverageRelationStatistics Valid=10707, Invalid=57153, Unknown=0, NotChecked=0, Total=67860 [2024-12-02 06:51:01,302 INFO L435 NwaCegarLoop]: 311 mSDtfsCounter, 6184 mSDsluCounter, 4951 mSDsCounter, 0 mSdLazyCounter, 5184 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6184 SdHoareTripleChecker+Valid, 5262 SdHoareTripleChecker+Invalid, 5301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 5184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2024-12-02 06:51:01,303 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6184 Valid, 5262 Invalid, 5301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 5184 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2024-12-02 06:51:01,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105102 states. [2024-12-02 06:51:01,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105102 to 31485. [2024-12-02 06:51:01,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31485 states, 31484 states have (on average 1.287288781603354) internal successors, (40529), 31484 states have internal predecessors, (40529), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 06:51:01,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31485 states to 31485 states and 40529 transitions. [2024-12-02 06:51:01,956 INFO L78 Accepts]: Start accepts. Automaton has 31485 states and 40529 transitions. Word has length 92 [2024-12-02 06:51:01,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 06:51:01,956 INFO L471 AbstractCegarLoop]: Abstraction has 31485 states and 40529 transitions. [2024-12-02 06:51:01,956 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 7.67741935483871) internal successors, (238), 30 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 06:51:01,956 INFO L276 IsEmpty]: Start isEmpty. Operand 31485 states and 40529 transitions. [2024-12-02 06:51:01,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-12-02 06:51:01,959 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 06:51:01,959 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] [2024-12-02 06:51:01,967 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_431199fd-7060-430a-960c-721b6172464a/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-12-02 06:51:02,160 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_431199fd-7060-430a-960c-721b6172464a/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2024-12-02 06:51:02,160 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 06:51:02,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 06:51:02,161 INFO L85 PathProgramCache]: Analyzing trace with hash 960217551, now seen corresponding path program 1 times [2024-12-02 06:51:02,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 06:51:02,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413837926] [2024-12-02 06:51:02,161 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:51:02,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 06:51:02,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:51:02,408 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 06:51:02,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 06:51:02,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413837926] [2024-12-02 06:51:02,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1413837926] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 06:51:02,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 06:51:02,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-12-02 06:51:02,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735628655] [2024-12-02 06:51:02,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 06:51:02,409 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-12-02 06:51:02,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 06:51:02,409 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-12-02 06:51:02,410 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-12-02 06:51:02,410 INFO L87 Difference]: Start difference. First operand 31485 states and 40529 transitions. Second operand has 10 states, 10 states have (on average 9.2) internal successors, (92), 9 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 06:51:02,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 06:51:02,989 INFO L93 Difference]: Finished difference Result 64864 states and 83177 transitions. [2024-12-02 06:51:02,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-12-02 06:51:02,990 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.2) internal successors, (92), 9 states have internal predecessors, (92), 0 states have call successors, (0), 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 92 [2024-12-02 06:51:02,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 06:51:03,026 INFO L225 Difference]: With dead ends: 64864 [2024-12-02 06:51:03,026 INFO L226 Difference]: Without dead ends: 52272 [2024-12-02 06:51:03,037 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=123, Invalid=339, Unknown=0, NotChecked=0, Total=462 [2024-12-02 06:51:03,038 INFO L435 NwaCegarLoop]: 154 mSDtfsCounter, 693 mSDsluCounter, 611 mSDsCounter, 0 mSdLazyCounter, 607 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 693 SdHoareTripleChecker+Valid, 765 SdHoareTripleChecker+Invalid, 617 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 607 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-12-02 06:51:03,038 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [693 Valid, 765 Invalid, 617 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 607 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-12-02 06:51:03,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52272 states. [2024-12-02 06:51:03,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52272 to 45922. [2024-12-02 06:51:03,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45922 states, 45921 states have (on average 1.2870582086627034) internal successors, (59103), 45921 states have internal predecessors, (59103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 06:51:03,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45922 states to 45922 states and 59103 transitions. [2024-12-02 06:51:03,449 INFO L78 Accepts]: Start accepts. Automaton has 45922 states and 59103 transitions. Word has length 92 [2024-12-02 06:51:03,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 06:51:03,449 INFO L471 AbstractCegarLoop]: Abstraction has 45922 states and 59103 transitions. [2024-12-02 06:51:03,449 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.2) internal successors, (92), 9 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 06:51:03,449 INFO L276 IsEmpty]: Start isEmpty. Operand 45922 states and 59103 transitions. [2024-12-02 06:51:03,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-12-02 06:51:03,452 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 06:51:03,453 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] [2024-12-02 06:51:03,453 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-12-02 06:51:03,453 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 06:51:03,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 06:51:03,453 INFO L85 PathProgramCache]: Analyzing trace with hash 504447511, now seen corresponding path program 1 times [2024-12-02 06:51:03,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 06:51:03,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376403434] [2024-12-02 06:51:03,453 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:51:03,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 06:51:03,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:51:03,509 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 06:51:03,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 06:51:03,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376403434] [2024-12-02 06:51:03,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1376403434] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 06:51:03,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 06:51:03,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-02 06:51:03,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629184348] [2024-12-02 06:51:03,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 06:51:03,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 06:51:03,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 06:51:03,510 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 06:51:03,511 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 06:51:03,511 INFO L87 Difference]: Start difference. First operand 45922 states and 59103 transitions. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 06:51:03,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 06:51:03,755 INFO L93 Difference]: Finished difference Result 91339 states and 117646 transitions. [2024-12-02 06:51:03,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 06:51:03,755 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 93 [2024-12-02 06:51:03,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 06:51:03,788 INFO L225 Difference]: With dead ends: 91339 [2024-12-02 06:51:03,788 INFO L226 Difference]: Without dead ends: 45924 [2024-12-02 06:51:03,799 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 06:51:03,800 INFO L435 NwaCegarLoop]: 205 mSDtfsCounter, 88 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 337 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 06:51:03,800 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 337 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 06:51:03,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45924 states. [2024-12-02 06:51:04,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45924 to 44265. [2024-12-02 06:51:04,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44265 states, 44264 states have (on average 1.2677570938008313) internal successors, (56116), 44264 states have internal predecessors, (56116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 06:51:04,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44265 states to 44265 states and 56116 transitions. [2024-12-02 06:51:04,262 INFO L78 Accepts]: Start accepts. Automaton has 44265 states and 56116 transitions. Word has length 93 [2024-12-02 06:51:04,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 06:51:04,262 INFO L471 AbstractCegarLoop]: Abstraction has 44265 states and 56116 transitions. [2024-12-02 06:51:04,262 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 06:51:04,262 INFO L276 IsEmpty]: Start isEmpty. Operand 44265 states and 56116 transitions. [2024-12-02 06:51:04,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-12-02 06:51:04,267 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 06:51:04,267 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] [2024-12-02 06:51:04,267 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-12-02 06:51:04,268 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 06:51:04,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 06:51:04,268 INFO L85 PathProgramCache]: Analyzing trace with hash -460824765, now seen corresponding path program 1 times [2024-12-02 06:51:04,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 06:51:04,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694762884] [2024-12-02 06:51:04,268 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:51:04,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 06:51:04,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:51:04,471 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 06:51:04,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 06:51:04,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694762884] [2024-12-02 06:51:04,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1694762884] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 06:51:04,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1351521102] [2024-12-02 06:51:04,471 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:51:04,471 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 06:51:04,471 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_431199fd-7060-430a-960c-721b6172464a/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 06:51:04,473 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_431199fd-7060-430a-960c-721b6172464a/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 06:51:04,475 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_431199fd-7060-430a-960c-721b6172464a/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-12-02 06:51:04,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:51:04,625 INFO L256 TraceCheckSpWp]: Trace formula consists of 430 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-12-02 06:51:04,629 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 06:51:05,060 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 06:51:05,060 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 06:51:05,519 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 06:51:05,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1351521102] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 06:51:05,519 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 06:51:05,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 10, 10] total 18 [2024-12-02 06:51:05,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371283951] [2024-12-02 06:51:05,520 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 06:51:05,520 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-12-02 06:51:05,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 06:51:05,521 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-12-02 06:51:05,521 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=214, Unknown=0, NotChecked=0, Total=306 [2024-12-02 06:51:05,521 INFO L87 Difference]: Start difference. First operand 44265 states and 56116 transitions. Second operand has 18 states, 18 states have (on average 12.0) internal successors, (216), 18 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 06:51:08,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 06:51:08,086 INFO L93 Difference]: Finished difference Result 262197 states and 329176 transitions. [2024-12-02 06:51:08,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2024-12-02 06:51:08,086 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 12.0) internal successors, (216), 18 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 93 [2024-12-02 06:51:08,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 06:51:08,297 INFO L225 Difference]: With dead ends: 262197 [2024-12-02 06:51:08,297 INFO L226 Difference]: Without dead ends: 218439 [2024-12-02 06:51:08,344 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 172 SyntacticMatches, 1 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1638 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1067, Invalid=3489, Unknown=0, NotChecked=0, Total=4556 [2024-12-02 06:51:08,345 INFO L435 NwaCegarLoop]: 802 mSDtfsCounter, 3772 mSDsluCounter, 4404 mSDsCounter, 0 mSdLazyCounter, 823 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3772 SdHoareTripleChecker+Valid, 5206 SdHoareTripleChecker+Invalid, 898 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 823 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-12-02 06:51:08,345 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3772 Valid, 5206 Invalid, 898 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 823 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-12-02 06:51:08,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218439 states. [2024-12-02 06:51:09,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218439 to 159421. [2024-12-02 06:51:10,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159421 states, 159420 states have (on average 1.2503763643206625) internal successors, (199335), 159420 states have internal predecessors, (199335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 06:51:10,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159421 states to 159421 states and 199335 transitions. [2024-12-02 06:51:10,369 INFO L78 Accepts]: Start accepts. Automaton has 159421 states and 199335 transitions. Word has length 93 [2024-12-02 06:51:10,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 06:51:10,369 INFO L471 AbstractCegarLoop]: Abstraction has 159421 states and 199335 transitions. [2024-12-02 06:51:10,369 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 12.0) internal successors, (216), 18 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 06:51:10,369 INFO L276 IsEmpty]: Start isEmpty. Operand 159421 states and 199335 transitions. [2024-12-02 06:51:10,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-12-02 06:51:10,378 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 06:51:10,378 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] [2024-12-02 06:51:10,387 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_431199fd-7060-430a-960c-721b6172464a/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-12-02 06:51:10,578 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_431199fd-7060-430a-960c-721b6172464a/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2024-12-02 06:51:10,579 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 06:51:10,579 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 06:51:10,579 INFO L85 PathProgramCache]: Analyzing trace with hash -1417910127, now seen corresponding path program 1 times [2024-12-02 06:51:10,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 06:51:10,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182692182] [2024-12-02 06:51:10,579 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:51:10,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 06:51:10,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:51:10,661 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 06:51:10,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 06:51:10,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182692182] [2024-12-02 06:51:10,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1182692182] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 06:51:10,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1459405106] [2024-12-02 06:51:10,661 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:51:10,661 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 06:51:10,661 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_431199fd-7060-430a-960c-721b6172464a/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 06:51:10,663 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_431199fd-7060-430a-960c-721b6172464a/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 06:51:10,664 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_431199fd-7060-430a-960c-721b6172464a/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-12-02 06:51:10,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:51:10,966 INFO L256 TraceCheckSpWp]: Trace formula consists of 440 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-12-02 06:51:10,968 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 06:51:11,198 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 06:51:11,199 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 06:51:11,361 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 06:51:11,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1459405106] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 06:51:11,362 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 06:51:11,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 14 [2024-12-02 06:51:11,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218348108] [2024-12-02 06:51:11,362 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 06:51:11,362 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-12-02 06:51:11,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 06:51:11,363 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-12-02 06:51:11,363 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2024-12-02 06:51:11,363 INFO L87 Difference]: Start difference. First operand 159421 states and 199335 transitions. Second operand has 14 states, 14 states have (on average 18.857142857142858) internal successors, (264), 14 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 06:51:12,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 06:51:12,410 INFO L93 Difference]: Finished difference Result 286825 states and 358993 transitions. [2024-12-02 06:51:12,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-12-02 06:51:12,411 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 18.857142857142858) internal successors, (264), 14 states have internal predecessors, (264), 0 states have call successors, (0), 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 100 [2024-12-02 06:51:12,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 06:51:12,523 INFO L225 Difference]: With dead ends: 286825 [2024-12-02 06:51:12,523 INFO L226 Difference]: Without dead ends: 127869 [2024-12-02 06:51:12,557 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 193 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 06:51:12,557 INFO L435 NwaCegarLoop]: 108 mSDtfsCounter, 1728 mSDsluCounter, 704 mSDsCounter, 0 mSdLazyCounter, 574 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1728 SdHoareTripleChecker+Valid, 812 SdHoareTripleChecker+Invalid, 608 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 574 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-12-02 06:51:12,558 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1728 Valid, 812 Invalid, 608 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 574 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-12-02 06:51:12,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127869 states. [2024-12-02 06:51:13,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127869 to 124542. [2024-12-02 06:51:13,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124542 states, 124541 states have (on average 1.2264153973390288) internal successors, (152739), 124541 states have internal predecessors, (152739), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 06:51:13,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124542 states to 124542 states and 152739 transitions. [2024-12-02 06:51:13,842 INFO L78 Accepts]: Start accepts. Automaton has 124542 states and 152739 transitions. Word has length 100 [2024-12-02 06:51:13,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 06:51:13,842 INFO L471 AbstractCegarLoop]: Abstraction has 124542 states and 152739 transitions. [2024-12-02 06:51:13,842 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 18.857142857142858) internal successors, (264), 14 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 06:51:13,842 INFO L276 IsEmpty]: Start isEmpty. Operand 124542 states and 152739 transitions. [2024-12-02 06:51:13,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-12-02 06:51:13,850 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 06:51:13,850 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] [2024-12-02 06:51:13,859 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_431199fd-7060-430a-960c-721b6172464a/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-12-02 06:51:14,050 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_431199fd-7060-430a-960c-721b6172464a/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2024-12-02 06:51:14,051 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 06:51:14,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 06:51:14,051 INFO L85 PathProgramCache]: Analyzing trace with hash 1736251826, now seen corresponding path program 1 times [2024-12-02 06:51:14,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 06:51:14,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914617840] [2024-12-02 06:51:14,051 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:51:14,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 06:51:14,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:51:14,132 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 06:51:14,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 06:51:14,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914617840] [2024-12-02 06:51:14,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1914617840] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 06:51:14,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 06:51:14,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-12-02 06:51:14,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833135391] [2024-12-02 06:51:14,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 06:51:14,133 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-02 06:51:14,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 06:51:14,133 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-02 06:51:14,133 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-12-02 06:51:14,133 INFO L87 Difference]: Start difference. First operand 124542 states and 152739 transitions. Second operand has 5 states, 5 states have (on average 20.6) internal successors, (103), 5 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 06:51:14,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 06:51:14,745 INFO L93 Difference]: Finished difference Result 242172 states and 296263 transitions. [2024-12-02 06:51:14,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-12-02 06:51:14,745 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.6) internal successors, (103), 5 states have internal predecessors, (103), 0 states have call successors, (0), 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 103 [2024-12-02 06:51:14,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 06:51:15,105 INFO L225 Difference]: With dead ends: 242172 [2024-12-02 06:51:15,105 INFO L226 Difference]: Without dead ends: 118123 [2024-12-02 06:51:15,136 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 06:51:15,137 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 325 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 325 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-12-02 06:51:15,137 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [325 Valid, 326 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-12-02 06:51:15,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118123 states. [2024-12-02 06:51:16,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118123 to 116326. [2024-12-02 06:51:16,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116326 states, 116325 states have (on average 1.1990629701267999) internal successors, (139481), 116325 states have internal predecessors, (139481), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 06:51:16,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116326 states to 116326 states and 139481 transitions. [2024-12-02 06:51:16,188 INFO L78 Accepts]: Start accepts. Automaton has 116326 states and 139481 transitions. Word has length 103 [2024-12-02 06:51:16,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 06:51:16,188 INFO L471 AbstractCegarLoop]: Abstraction has 116326 states and 139481 transitions. [2024-12-02 06:51:16,188 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.6) internal successors, (103), 5 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 06:51:16,188 INFO L276 IsEmpty]: Start isEmpty. Operand 116326 states and 139481 transitions. [2024-12-02 06:51:16,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-12-02 06:51:16,193 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 06:51:16,193 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] [2024-12-02 06:51:16,193 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-12-02 06:51:16,193 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 06:51:16,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 06:51:16,194 INFO L85 PathProgramCache]: Analyzing trace with hash -13984917, now seen corresponding path program 1 times [2024-12-02 06:51:16,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 06:51:16,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721424383] [2024-12-02 06:51:16,194 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:51:16,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 06:51:16,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:51:16,249 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 06:51:16,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 06:51:16,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721424383] [2024-12-02 06:51:16,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [721424383] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 06:51:16,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [238558961] [2024-12-02 06:51:16,249 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:51:16,249 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 06:51:16,249 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_431199fd-7060-430a-960c-721b6172464a/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 06:51:16,251 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_431199fd-7060-430a-960c-721b6172464a/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 06:51:16,251 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_431199fd-7060-430a-960c-721b6172464a/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-12-02 06:51:16,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:51:16,407 INFO L256 TraceCheckSpWp]: Trace formula consists of 450 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-12-02 06:51:16,410 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 06:51:16,656 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 06:51:16,656 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 06:51:16,779 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 06:51:16,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [238558961] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 06:51:16,779 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 06:51:16,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 14 [2024-12-02 06:51:16,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004937518] [2024-12-02 06:51:16,779 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 06:51:16,780 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-12-02 06:51:16,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 06:51:16,780 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-12-02 06:51:16,780 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2024-12-02 06:51:16,780 INFO L87 Difference]: Start difference. First operand 116326 states and 139481 transitions. Second operand has 14 states, 14 states have (on average 20.428571428571427) internal successors, (286), 14 states have internal predecessors, (286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 06:51:17,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 06:51:17,734 INFO L93 Difference]: Finished difference Result 251719 states and 301834 transitions. [2024-12-02 06:51:17,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-12-02 06:51:17,735 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 20.428571428571427) internal successors, (286), 14 states have internal predecessors, (286), 0 states have call successors, (0), 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 104 [2024-12-02 06:51:17,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 06:51:17,877 INFO L225 Difference]: With dead ends: 251719 [2024-12-02 06:51:17,877 INFO L226 Difference]: Without dead ends: 135886 [2024-12-02 06:51:17,931 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 201 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 06:51:17,931 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 1409 mSDsluCounter, 656 mSDsCounter, 0 mSdLazyCounter, 556 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1409 SdHoareTripleChecker+Valid, 780 SdHoareTripleChecker+Invalid, 589 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 556 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-12-02 06:51:17,931 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1409 Valid, 780 Invalid, 589 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 556 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-12-02 06:51:18,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135886 states. [2024-12-02 06:51:19,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135886 to 113859. [2024-12-02 06:51:19,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113859 states, 113858 states have (on average 1.1715557975724147) internal successors, (133391), 113858 states have internal predecessors, (133391), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 06:51:19,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113859 states to 113859 states and 133391 transitions. [2024-12-02 06:51:19,181 INFO L78 Accepts]: Start accepts. Automaton has 113859 states and 133391 transitions. Word has length 104 [2024-12-02 06:51:19,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 06:51:19,181 INFO L471 AbstractCegarLoop]: Abstraction has 113859 states and 133391 transitions. [2024-12-02 06:51:19,181 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 20.428571428571427) internal successors, (286), 14 states have internal predecessors, (286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 06:51:19,181 INFO L276 IsEmpty]: Start isEmpty. Operand 113859 states and 133391 transitions. [2024-12-02 06:51:19,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-12-02 06:51:19,185 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 06:51:19,185 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 06:51:19,191 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_431199fd-7060-430a-960c-721b6172464a/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-12-02 06:51:19,386 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_431199fd-7060-430a-960c-721b6172464a/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2024-12-02 06:51:19,386 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 06:51:19,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 06:51:19,387 INFO L85 PathProgramCache]: Analyzing trace with hash -536066972, now seen corresponding path program 1 times [2024-12-02 06:51:19,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 06:51:19,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846377608] [2024-12-02 06:51:19,387 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:51:19,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 06:51:19,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:51:19,637 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 06:51:19,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 06:51:19,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846377608] [2024-12-02 06:51:19,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [846377608] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 06:51:19,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [88932010] [2024-12-02 06:51:19,638 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:51:19,638 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 06:51:19,638 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_431199fd-7060-430a-960c-721b6172464a/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 06:51:19,639 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_431199fd-7060-430a-960c-721b6172464a/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 06:51:19,641 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_431199fd-7060-430a-960c-721b6172464a/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-12-02 06:51:19,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:51:19,802 INFO L256 TraceCheckSpWp]: Trace formula consists of 456 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-12-02 06:51:19,805 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 06:51:20,627 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 06:51:20,627 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 06:51:21,681 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 06:51:21,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [88932010] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 06:51:21,681 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 06:51:21,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12, 13] total 29 [2024-12-02 06:51:21,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951830918] [2024-12-02 06:51:21,682 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 06:51:21,682 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-12-02 06:51:21,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 06:51:21,683 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-12-02 06:51:21,683 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=721, Unknown=0, NotChecked=0, Total=870 [2024-12-02 06:51:21,683 INFO L87 Difference]: Start difference. First operand 113859 states and 133391 transitions. Second operand has 30 states, 30 states have (on average 8.7) internal successors, (261), 29 states have internal predecessors, (261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 06:51:24,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 06:51:24,265 INFO L93 Difference]: Finished difference Result 335215 states and 392738 transitions. [2024-12-02 06:51:24,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-12-02 06:51:24,265 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 8.7) internal successors, (261), 29 states have internal predecessors, (261), 0 states have call successors, (0), 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 06:51:24,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 06:51:24,519 INFO L225 Difference]: With dead ends: 335215 [2024-12-02 06:51:24,519 INFO L226 Difference]: Without dead ends: 239613 [2024-12-02 06:51:24,587 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 248 GetRequests, 191 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 675 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=820, Invalid=2602, Unknown=0, NotChecked=0, Total=3422 [2024-12-02 06:51:24,588 INFO L435 NwaCegarLoop]: 172 mSDtfsCounter, 2952 mSDsluCounter, 2087 mSDsCounter, 0 mSdLazyCounter, 1978 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2952 SdHoareTripleChecker+Valid, 2259 SdHoareTripleChecker+Invalid, 2026 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 1978 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-12-02 06:51:24,588 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2952 Valid, 2259 Invalid, 2026 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 1978 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-12-02 06:51:24,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239613 states. [2024-12-02 06:51:26,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239613 to 114858. [2024-12-02 06:51:26,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114858 states, 114857 states have (on average 1.1714479744377793) internal successors, (134549), 114857 states have internal predecessors, (134549), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 06:51:26,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114858 states to 114858 states and 134549 transitions. [2024-12-02 06:51:26,178 INFO L78 Accepts]: Start accepts. Automaton has 114858 states and 134549 transitions. Word has length 106 [2024-12-02 06:51:26,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 06:51:26,178 INFO L471 AbstractCegarLoop]: Abstraction has 114858 states and 134549 transitions. [2024-12-02 06:51:26,178 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 8.7) internal successors, (261), 29 states have internal predecessors, (261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 06:51:26,178 INFO L276 IsEmpty]: Start isEmpty. Operand 114858 states and 134549 transitions. [2024-12-02 06:51:26,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-12-02 06:51:26,182 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 06:51:26,182 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 06:51:26,187 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_431199fd-7060-430a-960c-721b6172464a/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-12-02 06:51:26,382 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_431199fd-7060-430a-960c-721b6172464a/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2024-12-02 06:51:26,382 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 06:51:26,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 06:51:26,383 INFO L85 PathProgramCache]: Analyzing trace with hash -184058337, now seen corresponding path program 1 times [2024-12-02 06:51:26,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 06:51:26,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896953121] [2024-12-02 06:51:26,383 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:51:26,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 06:51:26,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:51:27,055 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 06:51:27,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 06:51:27,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896953121] [2024-12-02 06:51:27,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [896953121] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 06:51:27,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1374596723] [2024-12-02 06:51:27,055 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:51:27,056 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 06:51:27,056 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_431199fd-7060-430a-960c-721b6172464a/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 06:51:27,057 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_431199fd-7060-430a-960c-721b6172464a/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 06:51:27,059 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_431199fd-7060-430a-960c-721b6172464a/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-12-02 06:51:27,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:51:27,237 INFO L256 TraceCheckSpWp]: Trace formula consists of 456 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-12-02 06:51:27,239 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 06:51:28,033 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 06:51:28,033 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 06:51:28,717 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 06:51:28,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1374596723] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 06:51:28,717 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 06:51:28,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 11] total 36 [2024-12-02 06:51:28,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389677284] [2024-12-02 06:51:28,717 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 06:51:28,718 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2024-12-02 06:51:28,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 06:51:28,718 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2024-12-02 06:51:28,719 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=1163, Unknown=0, NotChecked=0, Total=1260 [2024-12-02 06:51:28,719 INFO L87 Difference]: Start difference. First operand 114858 states and 134549 transitions. Second operand has 36 states, 36 states have (on average 8.36111111111111) internal successors, (301), 36 states have internal predecessors, (301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 06:51:44,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 06:51:44,044 INFO L93 Difference]: Finished difference Result 553840 states and 649862 transitions. [2024-12-02 06:51:44,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 201 states. [2024-12-02 06:51:44,045 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 8.36111111111111) internal successors, (301), 36 states have internal predecessors, (301), 0 states have call successors, (0), 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 06:51:44,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 06:51:44,503 INFO L225 Difference]: With dead ends: 553840 [2024-12-02 06:51:44,503 INFO L226 Difference]: Without dead ends: 481224 [2024-12-02 06:51:44,543 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 426 GetRequests, 193 SyntacticMatches, 0 SemanticMatches, 233 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19904 ImplicationChecksByTransitivity, 10.7s TimeCoverageRelationStatistics Valid=6946, Invalid=48044, Unknown=0, NotChecked=0, Total=54990 [2024-12-02 06:51:44,544 INFO L435 NwaCegarLoop]: 291 mSDtfsCounter, 6978 mSDsluCounter, 6687 mSDsCounter, 0 mSdLazyCounter, 7471 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6978 SdHoareTripleChecker+Valid, 6978 SdHoareTripleChecker+Invalid, 7573 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 7471 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2024-12-02 06:51:44,544 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6978 Valid, 6978 Invalid, 7573 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 7471 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2024-12-02 06:51:44,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 481224 states. [2024-12-02 06:51:47,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 481224 to 114802. [2024-12-02 06:51:47,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114802 states, 114801 states have (on average 1.1714009459847912) internal successors, (134478), 114801 states have internal predecessors, (134478), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 06:51:47,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114802 states to 114802 states and 134478 transitions. [2024-12-02 06:51:47,441 INFO L78 Accepts]: Start accepts. Automaton has 114802 states and 134478 transitions. Word has length 107 [2024-12-02 06:51:47,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 06:51:47,441 INFO L471 AbstractCegarLoop]: Abstraction has 114802 states and 134478 transitions. [2024-12-02 06:51:47,441 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 8.36111111111111) internal successors, (301), 36 states have internal predecessors, (301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 06:51:47,441 INFO L276 IsEmpty]: Start isEmpty. Operand 114802 states and 134478 transitions. [2024-12-02 06:51:47,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-12-02 06:51:47,447 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 06:51:47,447 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 06:51:47,457 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_431199fd-7060-430a-960c-721b6172464a/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-12-02 06:51:47,647 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_431199fd-7060-430a-960c-721b6172464a/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2024-12-02 06:51:47,648 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 06:51:47,649 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 06:51:47,649 INFO L85 PathProgramCache]: Analyzing trace with hash 355824038, now seen corresponding path program 1 times [2024-12-02 06:51:47,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 06:51:47,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692067849] [2024-12-02 06:51:47,649 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:51:47,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 06:51:47,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:51:48,451 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 06:51:48,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 06:51:48,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692067849] [2024-12-02 06:51:48,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [692067849] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 06:51:48,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1270834989] [2024-12-02 06:51:48,452 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:51:48,452 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 06:51:48,452 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_431199fd-7060-430a-960c-721b6172464a/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 06:51:48,454 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_431199fd-7060-430a-960c-721b6172464a/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 06:51:48,455 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_431199fd-7060-430a-960c-721b6172464a/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-12-02 06:51:48,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:51:48,608 INFO L256 TraceCheckSpWp]: Trace formula consists of 456 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-12-02 06:51:48,610 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 06:51:49,310 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 06:51:49,310 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-12-02 06:51:49,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1270834989] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 06:51:49,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-12-02 06:51:49,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [11] total 23 [2024-12-02 06:51:49,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663020144] [2024-12-02 06:51:49,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 06:51:49,311 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-12-02 06:51:49,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 06:51:49,311 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-12-02 06:51:49,311 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=446, Unknown=0, NotChecked=0, Total=506 [2024-12-02 06:51:49,311 INFO L87 Difference]: Start difference. First operand 114802 states and 134478 transitions. Second operand has 13 states, 13 states have (on average 8.23076923076923) internal successors, (107), 13 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 06:51:49,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 06:51:49,982 INFO L93 Difference]: Finished difference Result 189118 states and 221881 transitions. [2024-12-02 06:51:49,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-12-02 06:51:49,982 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 8.23076923076923) internal successors, (107), 13 states have internal predecessors, (107), 0 states have call successors, (0), 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 06:51:49,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 06:51:50,236 INFO L225 Difference]: With dead ends: 189118 [2024-12-02 06:51:50,237 INFO L226 Difference]: Without dead ends: 134732 [2024-12-02 06:51:50,257 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=92, Invalid=664, Unknown=0, NotChecked=0, Total=756 [2024-12-02 06:51:50,258 INFO L435 NwaCegarLoop]: 275 mSDtfsCounter, 530 mSDsluCounter, 2139 mSDsCounter, 0 mSdLazyCounter, 556 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 530 SdHoareTripleChecker+Valid, 2414 SdHoareTripleChecker+Invalid, 562 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 556 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-12-02 06:51:50,258 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [530 Valid, 2414 Invalid, 562 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 556 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-12-02 06:51:50,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134732 states. [2024-12-02 06:51:51,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134732 to 132427. [2024-12-02 06:51:51,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132427 states, 132426 states have (on average 1.170313986679353) internal successors, (154980), 132426 states have internal predecessors, (154980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 06:51:51,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132427 states to 132427 states and 154980 transitions. [2024-12-02 06:51:51,698 INFO L78 Accepts]: Start accepts. Automaton has 132427 states and 154980 transitions. Word has length 107 [2024-12-02 06:51:51,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 06:51:51,698 INFO L471 AbstractCegarLoop]: Abstraction has 132427 states and 154980 transitions. [2024-12-02 06:51:51,698 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 8.23076923076923) internal successors, (107), 13 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 06:51:51,698 INFO L276 IsEmpty]: Start isEmpty. Operand 132427 states and 154980 transitions. [2024-12-02 06:51:51,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-12-02 06:51:51,701 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 06:51:51,701 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] [2024-12-02 06:51:51,707 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_431199fd-7060-430a-960c-721b6172464a/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-12-02 06:51:51,902 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_431199fd-7060-430a-960c-721b6172464a/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2024-12-02 06:51:51,902 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 06:51:51,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 06:51:51,903 INFO L85 PathProgramCache]: Analyzing trace with hash -1891657573, now seen corresponding path program 1 times [2024-12-02 06:51:51,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 06:51:51,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167684693] [2024-12-02 06:51:51,903 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:51:51,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 06:51:51,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:51:52,322 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 06:51:52,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 06:51:52,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167684693] [2024-12-02 06:51:52,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1167684693] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 06:51:52,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1857500803] [2024-12-02 06:51:52,323 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:51:52,323 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 06:51:52,323 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_431199fd-7060-430a-960c-721b6172464a/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 06:51:52,324 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_431199fd-7060-430a-960c-721b6172464a/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 06:51:52,325 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_431199fd-7060-430a-960c-721b6172464a/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-12-02 06:51:52,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:51:52,476 INFO L256 TraceCheckSpWp]: Trace formula consists of 459 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-12-02 06:51:52,478 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 06:51:53,705 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 06:51:53,705 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 06:51:54,311 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 06:51:54,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1857500803] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 06:51:54,311 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 06:51:54,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 13] total 37 [2024-12-02 06:51:54,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062540807] [2024-12-02 06:51:54,311 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 06:51:54,312 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2024-12-02 06:51:54,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 06:51:54,312 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2024-12-02 06:51:54,313 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=1208, Unknown=0, NotChecked=0, Total=1332 [2024-12-02 06:51:54,313 INFO L87 Difference]: Start difference. First operand 132427 states and 154980 transitions. Second operand has 37 states, 37 states have (on average 7.108108108108108) internal successors, (263), 37 states have internal predecessors, (263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 06:51:56,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 06:51:56,374 INFO L93 Difference]: Finished difference Result 324546 states and 380324 transitions. [2024-12-02 06:51:56,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-12-02 06:51:56,375 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 7.108108108108108) internal successors, (263), 37 states have internal predecessors, (263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 108 [2024-12-02 06:51:56,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 06:51:56,643 INFO L225 Difference]: With dead ends: 324546 [2024-12-02 06:51:56,643 INFO L226 Difference]: Without dead ends: 289984 [2024-12-02 06:51:56,700 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 195 SyntacticMatches, 1 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 611 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=561, Invalid=2861, Unknown=0, NotChecked=0, Total=3422 [2024-12-02 06:51:56,700 INFO L435 NwaCegarLoop]: 353 mSDtfsCounter, 1355 mSDsluCounter, 6860 mSDsCounter, 0 mSdLazyCounter, 1515 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1355 SdHoareTripleChecker+Valid, 7213 SdHoareTripleChecker+Invalid, 1537 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 1515 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-12-02 06:51:56,701 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1355 Valid, 7213 Invalid, 1537 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 1515 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-12-02 06:51:56,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289984 states. [2024-12-02 06:51:59,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289984 to 132463. [2024-12-02 06:51:59,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132463 states, 132462 states have (on average 1.1702676994156815) internal successors, (155016), 132462 states have internal predecessors, (155016), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 06:51:59,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132463 states to 132463 states and 155016 transitions. [2024-12-02 06:51:59,224 INFO L78 Accepts]: Start accepts. Automaton has 132463 states and 155016 transitions. Word has length 108 [2024-12-02 06:51:59,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 06:51:59,224 INFO L471 AbstractCegarLoop]: Abstraction has 132463 states and 155016 transitions. [2024-12-02 06:51:59,225 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 7.108108108108108) internal successors, (263), 37 states have internal predecessors, (263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 06:51:59,225 INFO L276 IsEmpty]: Start isEmpty. Operand 132463 states and 155016 transitions. [2024-12-02 06:51:59,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-12-02 06:51:59,229 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 06:51:59,229 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 06:51:59,236 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_431199fd-7060-430a-960c-721b6172464a/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-12-02 06:51:59,429 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_431199fd-7060-430a-960c-721b6172464a/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2024-12-02 06:51:59,430 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 06:51:59,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 06:51:59,430 INFO L85 PathProgramCache]: Analyzing trace with hash 1228557629, now seen corresponding path program 1 times [2024-12-02 06:51:59,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 06:51:59,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604140679] [2024-12-02 06:51:59,430 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:51:59,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 06:51:59,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:51:59,854 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 06:51:59,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 06:51:59,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604140679] [2024-12-02 06:51:59,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1604140679] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 06:51:59,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1976001389] [2024-12-02 06:51:59,854 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:51:59,854 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 06:51:59,855 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_431199fd-7060-430a-960c-721b6172464a/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 06:51:59,856 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_431199fd-7060-430a-960c-721b6172464a/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 06:51:59,857 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_431199fd-7060-430a-960c-721b6172464a/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-12-02 06:51:59,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:51:59,996 INFO L256 TraceCheckSpWp]: Trace formula consists of 458 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-12-02 06:51:59,997 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 06:52:00,803 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 06:52:00,803 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 06:52:01,465 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 06:52:01,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1976001389] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 06:52:01,465 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 06:52:01,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12, 11] total 35 [2024-12-02 06:52:01,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466912658] [2024-12-02 06:52:01,465 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 06:52:01,465 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-12-02 06:52:01,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 06:52:01,466 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-12-02 06:52:01,466 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=1094, Unknown=0, NotChecked=0, Total=1190 [2024-12-02 06:52:01,466 INFO L87 Difference]: Start difference. First operand 132463 states and 155016 transitions. Second operand has 35 states, 35 states have (on average 8.542857142857143) internal successors, (299), 35 states have internal predecessors, (299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 06:52:13,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 06:52:13,390 INFO L93 Difference]: Finished difference Result 296343 states and 343077 transitions. [2024-12-02 06:52:13,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 126 states. [2024-12-02 06:52:13,391 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 8.542857142857143) internal successors, (299), 35 states have internal predecessors, (299), 0 states have call successors, (0), 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 06:52:13,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 06:52:13,759 INFO L225 Difference]: With dead ends: 296343 [2024-12-02 06:52:13,759 INFO L226 Difference]: Without dead ends: 249144 [2024-12-02 06:52:13,783 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 356 GetRequests, 199 SyntacticMatches, 0 SemanticMatches, 157 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7616 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=3464, Invalid=21658, Unknown=0, NotChecked=0, Total=25122 [2024-12-02 06:52:13,783 INFO L435 NwaCegarLoop]: 320 mSDtfsCounter, 4850 mSDsluCounter, 6285 mSDsCounter, 0 mSdLazyCounter, 7304 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4850 SdHoareTripleChecker+Valid, 6605 SdHoareTripleChecker+Invalid, 7405 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 7304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2024-12-02 06:52:13,783 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4850 Valid, 6605 Invalid, 7405 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 7304 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2024-12-02 06:52:13,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249144 states. [2024-12-02 06:52:15,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249144 to 139723. [2024-12-02 06:52:15,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139723 states, 139722 states have (on average 1.167990724438528) internal successors, (163194), 139722 states have internal predecessors, (163194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 06:52:15,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139723 states to 139723 states and 163194 transitions. [2024-12-02 06:52:15,527 INFO L78 Accepts]: Start accepts. Automaton has 139723 states and 163194 transitions. Word has length 109 [2024-12-02 06:52:15,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 06:52:15,527 INFO L471 AbstractCegarLoop]: Abstraction has 139723 states and 163194 transitions. [2024-12-02 06:52:15,527 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 8.542857142857143) internal successors, (299), 35 states have internal predecessors, (299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 06:52:15,527 INFO L276 IsEmpty]: Start isEmpty. Operand 139723 states and 163194 transitions. [2024-12-02 06:52:15,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-12-02 06:52:15,535 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 06:52:15,535 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 06:52:15,541 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_431199fd-7060-430a-960c-721b6172464a/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-12-02 06:52:15,735 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_431199fd-7060-430a-960c-721b6172464a/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2024-12-02 06:52:15,735 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 06:52:15,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 06:52:15,736 INFO L85 PathProgramCache]: Analyzing trace with hash -599077356, now seen corresponding path program 1 times [2024-12-02 06:52:15,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 06:52:15,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261219073] [2024-12-02 06:52:15,736 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:52:15,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 06:52:15,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:52:16,370 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 06:52:16,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 06:52:16,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261219073] [2024-12-02 06:52:16,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1261219073] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 06:52:16,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1234841961] [2024-12-02 06:52:16,371 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:52:16,371 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 06:52:16,371 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_431199fd-7060-430a-960c-721b6172464a/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 06:52:16,373 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_431199fd-7060-430a-960c-721b6172464a/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 06:52:16,373 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_431199fd-7060-430a-960c-721b6172464a/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-12-02 06:52:16,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:52:16,516 INFO L256 TraceCheckSpWp]: Trace formula consists of 458 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-12-02 06:52:16,518 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 06:52:18,204 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 06:52:18,204 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 06:52:19,189 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 06:52:19,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1234841961] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 06:52:19,190 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 06:52:19,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18, 16] total 46 [2024-12-02 06:52:19,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600309343] [2024-12-02 06:52:19,190 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 06:52:19,190 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2024-12-02 06:52:19,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 06:52:19,191 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2024-12-02 06:52:19,191 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=1898, Unknown=0, NotChecked=0, Total=2070 [2024-12-02 06:52:19,191 INFO L87 Difference]: Start difference. First operand 139723 states and 163194 transitions. Second operand has 46 states, 46 states have (on average 6.521739130434782) internal successors, (300), 46 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 06:52:22,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 06:52:22,377 INFO L93 Difference]: Finished difference Result 403441 states and 472324 transitions. [2024-12-02 06:52:22,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2024-12-02 06:52:22,377 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 6.521739130434782) internal successors, (300), 46 states have internal predecessors, (300), 0 states have call successors, (0), 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 06:52:22,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 06:52:22,890 INFO L225 Difference]: With dead ends: 403441 [2024-12-02 06:52:22,890 INFO L226 Difference]: Without dead ends: 373740 [2024-12-02 06:52:22,927 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 190 SyntacticMatches, 1 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1229 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=816, Invalid=5036, Unknown=0, NotChecked=0, Total=5852 [2024-12-02 06:52:22,927 INFO L435 NwaCegarLoop]: 320 mSDtfsCounter, 3808 mSDsluCounter, 7987 mSDsCounter, 0 mSdLazyCounter, 2554 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3808 SdHoareTripleChecker+Valid, 8307 SdHoareTripleChecker+Invalid, 2600 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 2554 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-12-02 06:52:22,927 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3808 Valid, 8307 Invalid, 2600 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 2554 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-12-02 06:52:23,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373740 states. [2024-12-02 06:52:24,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373740 to 139741. [2024-12-02 06:52:24,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139741 states, 139740 states have (on average 1.1679690854443967) internal successors, (163212), 139740 states have internal predecessors, (163212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 06:52:24,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139741 states to 139741 states and 163212 transitions. [2024-12-02 06:52:24,928 INFO L78 Accepts]: Start accepts. Automaton has 139741 states and 163212 transitions. Word has length 109 [2024-12-02 06:52:24,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 06:52:24,928 INFO L471 AbstractCegarLoop]: Abstraction has 139741 states and 163212 transitions. [2024-12-02 06:52:24,928 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 6.521739130434782) internal successors, (300), 46 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 06:52:24,928 INFO L276 IsEmpty]: Start isEmpty. Operand 139741 states and 163212 transitions. [2024-12-02 06:52:24,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-12-02 06:52:24,932 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 06:52:24,932 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 06:52:24,941 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_431199fd-7060-430a-960c-721b6172464a/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-12-02 06:52:25,132 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_431199fd-7060-430a-960c-721b6172464a/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 06:52:25,132 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 06:52:25,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 06:52:25,133 INFO L85 PathProgramCache]: Analyzing trace with hash -1865155624, now seen corresponding path program 1 times [2024-12-02 06:52:25,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 06:52:25,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308992355] [2024-12-02 06:52:25,133 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:52:25,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 06:52:25,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:52:25,662 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 06:52:25,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 06:52:25,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308992355] [2024-12-02 06:52:25,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308992355] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 06:52:25,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [789442726] [2024-12-02 06:52:25,663 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:52:25,663 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 06:52:25,663 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_431199fd-7060-430a-960c-721b6172464a/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 06:52:25,664 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_431199fd-7060-430a-960c-721b6172464a/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 06:52:25,665 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_431199fd-7060-430a-960c-721b6172464a/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-12-02 06:52:25,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:52:25,834 INFO L256 TraceCheckSpWp]: Trace formula consists of 458 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-12-02 06:52:25,837 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 06:52:26,625 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-12-02 06:52:26,625 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-12-02 06:52:26,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [789442726] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 06:52:26,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-12-02 06:52:26,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [15] total 28 [2024-12-02 06:52:26,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060089861] [2024-12-02 06:52:26,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 06:52:26,626 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-12-02 06:52:26,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 06:52:26,626 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-12-02 06:52:26,626 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=642, Unknown=0, NotChecked=0, Total=756 [2024-12-02 06:52:26,626 INFO L87 Difference]: Start difference. First operand 139741 states and 163212 transitions. Second operand has 15 states, 15 states have (on average 6.933333333333334) internal successors, (104), 15 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 06:52:27,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 06:52:27,989 INFO L93 Difference]: Finished difference Result 312632 states and 365980 transitions. [2024-12-02 06:52:27,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-12-02 06:52:27,989 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 6.933333333333334) internal successors, (104), 15 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 109 [2024-12-02 06:52:27,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 06:52:28,224 INFO L225 Difference]: With dead ends: 312632 [2024-12-02 06:52:28,224 INFO L226 Difference]: Without dead ends: 282722 [2024-12-02 06:52:28,255 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 172 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=243, Invalid=1017, Unknown=0, NotChecked=0, Total=1260 [2024-12-02 06:52:28,255 INFO L435 NwaCegarLoop]: 167 mSDtfsCounter, 1302 mSDsluCounter, 1012 mSDsCounter, 0 mSdLazyCounter, 585 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1302 SdHoareTripleChecker+Valid, 1179 SdHoareTripleChecker+Invalid, 598 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 585 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-12-02 06:52:28,255 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1302 Valid, 1179 Invalid, 598 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 585 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-12-02 06:52:28,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282722 states. [2024-12-02 06:52:29,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282722 to 139532. [2024-12-02 06:52:29,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139532 states, 139531 states have (on average 1.1680343436225642) internal successors, (162977), 139531 states have internal predecessors, (162977), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 06:52:29,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139532 states to 139532 states and 162977 transitions. [2024-12-02 06:52:29,943 INFO L78 Accepts]: Start accepts. Automaton has 139532 states and 162977 transitions. Word has length 109 [2024-12-02 06:52:29,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 06:52:29,943 INFO L471 AbstractCegarLoop]: Abstraction has 139532 states and 162977 transitions. [2024-12-02 06:52:29,943 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 6.933333333333334) internal successors, (104), 15 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 06:52:29,943 INFO L276 IsEmpty]: Start isEmpty. Operand 139532 states and 162977 transitions. [2024-12-02 06:52:29,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-12-02 06:52:29,947 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 06:52:29,947 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 06:52:29,955 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_431199fd-7060-430a-960c-721b6172464a/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-12-02 06:52:30,148 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_431199fd-7060-430a-960c-721b6172464a/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 06:52:30,148 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 06:52:30,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 06:52:30,149 INFO L85 PathProgramCache]: Analyzing trace with hash -458816551, now seen corresponding path program 1 times [2024-12-02 06:52:30,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 06:52:30,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804962821] [2024-12-02 06:52:30,149 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:52:30,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 06:52:30,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:52:30,607 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 06:52:30,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 06:52:30,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804962821] [2024-12-02 06:52:30,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1804962821] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 06:52:30,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 06:52:30,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2024-12-02 06:52:30,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517983572] [2024-12-02 06:52:30,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 06:52:30,607 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-12-02 06:52:30,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 06:52:30,608 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-12-02 06:52:30,608 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=269, Unknown=0, NotChecked=0, Total=306 [2024-12-02 06:52:30,608 INFO L87 Difference]: Start difference. First operand 139532 states and 162977 transitions. Second operand has 18 states, 18 states have (on average 6.055555555555555) internal successors, (109), 18 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 06:52:32,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 06:52:32,341 INFO L93 Difference]: Finished difference Result 253557 states and 296589 transitions. [2024-12-02 06:52:32,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-12-02 06:52:32,342 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 6.055555555555555) internal successors, (109), 18 states have internal predecessors, (109), 0 states have call successors, (0), 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 06:52:32,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 06:52:32,566 INFO L225 Difference]: With dead ends: 253557 [2024-12-02 06:52:32,566 INFO L226 Difference]: Without dead ends: 228504 [2024-12-02 06:52:32,612 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 310 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=309, Invalid=1413, Unknown=0, NotChecked=0, Total=1722 [2024-12-02 06:52:32,613 INFO L435 NwaCegarLoop]: 303 mSDtfsCounter, 1206 mSDsluCounter, 3414 mSDsCounter, 0 mSdLazyCounter, 962 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1206 SdHoareTripleChecker+Valid, 3717 SdHoareTripleChecker+Invalid, 970 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 962 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-12-02 06:52:32,613 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1206 Valid, 3717 Invalid, 970 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 962 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-12-02 06:52:32,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228504 states. [2024-12-02 06:52:34,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228504 to 130040. [2024-12-02 06:52:34,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130040 states, 130039 states have (on average 1.1656349249071432) internal successors, (151578), 130039 states have internal predecessors, (151578), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 06:52:34,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130040 states to 130040 states and 151578 transitions. [2024-12-02 06:52:34,408 INFO L78 Accepts]: Start accepts. Automaton has 130040 states and 151578 transitions. Word has length 109 [2024-12-02 06:52:34,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 06:52:34,409 INFO L471 AbstractCegarLoop]: Abstraction has 130040 states and 151578 transitions. [2024-12-02 06:52:34,409 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 6.055555555555555) internal successors, (109), 18 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 06:52:34,409 INFO L276 IsEmpty]: Start isEmpty. Operand 130040 states and 151578 transitions. [2024-12-02 06:52:34,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-12-02 06:52:34,414 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 06:52:34,414 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 06:52:34,414 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-12-02 06:52:34,414 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 06:52:34,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 06:52:34,415 INFO L85 PathProgramCache]: Analyzing trace with hash 953149600, now seen corresponding path program 1 times [2024-12-02 06:52:34,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 06:52:34,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701590488] [2024-12-02 06:52:34,415 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:52:34,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 06:52:34,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:52:34,748 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 06:52:34,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 06:52:34,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701590488] [2024-12-02 06:52:34,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [701590488] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 06:52:34,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 06:52:34,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-12-02 06:52:34,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858292910] [2024-12-02 06:52:34,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 06:52:34,748 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-12-02 06:52:34,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 06:52:34,749 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-12-02 06:52:34,749 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2024-12-02 06:52:34,749 INFO L87 Difference]: Start difference. First operand 130040 states and 151578 transitions. Second operand has 12 states, 12 states have (on average 9.25) internal successors, (111), 11 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 06:52:35,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 06:52:35,860 INFO L93 Difference]: Finished difference Result 203477 states and 237905 transitions. [2024-12-02 06:52:35,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-12-02 06:52:35,861 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 9.25) internal successors, (111), 11 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 111 [2024-12-02 06:52:35,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 06:52:35,995 INFO L225 Difference]: With dead ends: 203477 [2024-12-02 06:52:35,995 INFO L226 Difference]: Without dead ends: 163755 [2024-12-02 06:52:36,032 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=130, Invalid=422, Unknown=0, NotChecked=0, Total=552 [2024-12-02 06:52:36,032 INFO L435 NwaCegarLoop]: 155 mSDtfsCounter, 763 mSDsluCounter, 843 mSDsCounter, 0 mSdLazyCounter, 798 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 763 SdHoareTripleChecker+Valid, 998 SdHoareTripleChecker+Invalid, 817 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 798 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-12-02 06:52:36,033 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [763 Valid, 998 Invalid, 817 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 798 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-12-02 06:52:36,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163755 states. [2024-12-02 06:52:37,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163755 to 157242. [2024-12-02 06:52:37,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157242 states, 157241 states have (on average 1.1679523788324928) internal successors, (183650), 157241 states have internal predecessors, (183650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 06:52:38,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157242 states to 157242 states and 183650 transitions. [2024-12-02 06:52:38,022 INFO L78 Accepts]: Start accepts. Automaton has 157242 states and 183650 transitions. Word has length 111 [2024-12-02 06:52:38,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 06:52:38,022 INFO L471 AbstractCegarLoop]: Abstraction has 157242 states and 183650 transitions. [2024-12-02 06:52:38,022 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.25) internal successors, (111), 11 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 06:52:38,022 INFO L276 IsEmpty]: Start isEmpty. Operand 157242 states and 183650 transitions. [2024-12-02 06:52:38,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-12-02 06:52:38,026 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 06:52:38,026 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 06:52:38,026 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-12-02 06:52:38,026 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 06:52:38,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 06:52:38,027 INFO L85 PathProgramCache]: Analyzing trace with hash 347228457, now seen corresponding path program 1 times [2024-12-02 06:52:38,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 06:52:38,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169845010] [2024-12-02 06:52:38,027 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:52:38,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 06:52:38,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:52:38,102 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 06:52:38,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 06:52:38,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169845010] [2024-12-02 06:52:38,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [169845010] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 06:52:38,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 06:52:38,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-02 06:52:38,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624195188] [2024-12-02 06:52:38,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 06:52:38,103 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 06:52:38,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 06:52:38,103 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 06:52:38,103 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 06:52:38,103 INFO L87 Difference]: Start difference. First operand 157242 states and 183650 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 06:52:38,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 06:52:38,412 INFO L93 Difference]: Finished difference Result 183427 states and 214046 transitions. [2024-12-02 06:52:38,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 06:52:38,412 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 06:52:38,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 06:52:38,431 INFO L225 Difference]: With dead ends: 183427 [2024-12-02 06:52:38,431 INFO L226 Difference]: Without dead ends: 27584 [2024-12-02 06:52:38,470 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 06:52:38,470 INFO L435 NwaCegarLoop]: 179 mSDtfsCounter, 69 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 282 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 06:52:38,470 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 282 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 06:52:38,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27584 states. [2024-12-02 06:52:38,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27584 to 23728. [2024-12-02 06:52:38,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23728 states, 23727 states have (on average 1.1554768828760484) internal successors, (27416), 23727 states have internal predecessors, (27416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 06:52:38,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23728 states to 23728 states and 27416 transitions. [2024-12-02 06:52:38,930 INFO L78 Accepts]: Start accepts. Automaton has 23728 states and 27416 transitions. Word has length 112 [2024-12-02 06:52:38,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 06:52:38,930 INFO L471 AbstractCegarLoop]: Abstraction has 23728 states and 27416 transitions. [2024-12-02 06:52:38,930 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 06:52:38,930 INFO L276 IsEmpty]: Start isEmpty. Operand 23728 states and 27416 transitions. [2024-12-02 06:52:38,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-12-02 06:52:38,932 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 06:52:38,933 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] [2024-12-02 06:52:38,933 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-12-02 06:52:38,933 INFO L396 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 06:52:38,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 06:52:38,933 INFO L85 PathProgramCache]: Analyzing trace with hash -1129934223, now seen corresponding path program 1 times [2024-12-02 06:52:38,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 06:52:38,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302220948] [2024-12-02 06:52:38,933 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:52:38,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 06:52:38,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:52:39,582 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 06:52:39,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 06:52:39,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302220948] [2024-12-02 06:52:39,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [302220948] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 06:52:39,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [670429511] [2024-12-02 06:52:39,583 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:52:39,583 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 06:52:39,583 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_431199fd-7060-430a-960c-721b6172464a/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 06:52:39,584 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_431199fd-7060-430a-960c-721b6172464a/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 06:52:39,585 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_431199fd-7060-430a-960c-721b6172464a/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-12-02 06:52:39,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:52:39,730 INFO L256 TraceCheckSpWp]: Trace formula consists of 464 conjuncts, 47 conjuncts are in the unsatisfiable core [2024-12-02 06:52:39,732 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 06:52:42,531 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 06:52:42,531 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 06:52:46,006 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 06:52:46,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [670429511] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 06:52:46,006 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 06:52:46,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 23, 24] total 63 [2024-12-02 06:52:46,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595140138] [2024-12-02 06:52:46,006 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 06:52:46,007 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 63 states [2024-12-02 06:52:46,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 06:52:46,007 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2024-12-02 06:52:46,007 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=284, Invalid=3622, Unknown=0, NotChecked=0, Total=3906 [2024-12-02 06:52:46,008 INFO L87 Difference]: Start difference. First operand 23728 states and 27416 transitions. Second operand has 63 states, 63 states have (on average 5.063492063492063) internal successors, (319), 63 states have internal predecessors, (319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 06:53:05,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 06:53:05,074 INFO L93 Difference]: Finished difference Result 77967 states and 89769 transitions. [2024-12-02 06:53:05,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 138 states. [2024-12-02 06:53:05,074 INFO L78 Accepts]: Start accepts. Automaton has has 63 states, 63 states have (on average 5.063492063492063) internal successors, (319), 63 states have internal predecessors, (319), 0 states have call successors, (0), 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 113 [2024-12-02 06:53:05,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 06:53:05,122 INFO L225 Difference]: With dead ends: 77967 [2024-12-02 06:53:05,122 INFO L226 Difference]: Without dead ends: 71942 [2024-12-02 06:53:05,137 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 376 GetRequests, 183 SyntacticMatches, 1 SemanticMatches, 192 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10081 ImplicationChecksByTransitivity, 14.8s TimeCoverageRelationStatistics Valid=4028, Invalid=33414, Unknown=0, NotChecked=0, Total=37442 [2024-12-02 06:53:05,137 INFO L435 NwaCegarLoop]: 496 mSDtfsCounter, 3936 mSDsluCounter, 16984 mSDsCounter, 0 mSdLazyCounter, 9147 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3936 SdHoareTripleChecker+Valid, 17480 SdHoareTripleChecker+Invalid, 9215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 9147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.4s IncrementalHoareTripleChecker+Time [2024-12-02 06:53:05,137 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3936 Valid, 17480 Invalid, 9215 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [68 Valid, 9147 Invalid, 0 Unknown, 0 Unchecked, 6.4s Time] [2024-12-02 06:53:05,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71942 states. [2024-12-02 06:53:05,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71942 to 25497. [2024-12-02 06:53:05,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25497 states, 25496 states have (on average 1.1539849388139316) internal successors, (29422), 25496 states have internal predecessors, (29422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 06:53:05,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25497 states to 25497 states and 29422 transitions. [2024-12-02 06:53:05,499 INFO L78 Accepts]: Start accepts. Automaton has 25497 states and 29422 transitions. Word has length 113 [2024-12-02 06:53:05,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 06:53:05,499 INFO L471 AbstractCegarLoop]: Abstraction has 25497 states and 29422 transitions. [2024-12-02 06:53:05,499 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 63 states, 63 states have (on average 5.063492063492063) internal successors, (319), 63 states have internal predecessors, (319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 06:53:05,499 INFO L276 IsEmpty]: Start isEmpty. Operand 25497 states and 29422 transitions. [2024-12-02 06:53:05,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-12-02 06:53:05,501 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 06:53:05,501 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] [2024-12-02 06:53:05,508 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_431199fd-7060-430a-960c-721b6172464a/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-12-02 06:53:05,702 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_431199fd-7060-430a-960c-721b6172464a/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable45 [2024-12-02 06:53:05,703 INFO L396 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 06:53:05,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 06:53:05,706 INFO L85 PathProgramCache]: Analyzing trace with hash 1106093940, now seen corresponding path program 1 times [2024-12-02 06:53:05,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 06:53:05,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053241399] [2024-12-02 06:53:05,707 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:53:05,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 06:53:05,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:53:05,772 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-12-02 06:53:05,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 06:53:05,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053241399] [2024-12-02 06:53:05,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2053241399] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 06:53:05,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 06:53:05,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-02 06:53:05,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696157351] [2024-12-02 06:53:05,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 06:53:05,773 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 06:53:05,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 06:53:05,773 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 06:53:05,773 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 06:53:05,773 INFO L87 Difference]: Start difference. First operand 25497 states and 29422 transitions. Second operand has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 06:53:05,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 06:53:05,846 INFO L93 Difference]: Finished difference Result 36910 states and 42683 transitions. [2024-12-02 06:53:05,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 06:53:05,847 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 0 states have call successors, (0), 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 113 [2024-12-02 06:53:05,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 06:53:05,863 INFO L225 Difference]: With dead ends: 36910 [2024-12-02 06:53:05,863 INFO L226 Difference]: Without dead ends: 27254 [2024-12-02 06:53:05,870 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 06:53:05,871 INFO L435 NwaCegarLoop]: 169 mSDtfsCounter, 128 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 266 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 06:53:05,871 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 266 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 06:53:05,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27254 states. [2024-12-02 06:53:06,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27254 to 24288. [2024-12-02 06:53:06,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24288 states, 24287 states have (on average 1.1506567299378267) internal successors, (27946), 24287 states have internal predecessors, (27946), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 06:53:06,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24288 states to 24288 states and 27946 transitions. [2024-12-02 06:53:06,057 INFO L78 Accepts]: Start accepts. Automaton has 24288 states and 27946 transitions. Word has length 113 [2024-12-02 06:53:06,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 06:53:06,058 INFO L471 AbstractCegarLoop]: Abstraction has 24288 states and 27946 transitions. [2024-12-02 06:53:06,058 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 06:53:06,058 INFO L276 IsEmpty]: Start isEmpty. Operand 24288 states and 27946 transitions. [2024-12-02 06:53:06,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-12-02 06:53:06,059 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 06:53:06,059 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 06:53:06,059 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2024-12-02 06:53:06,060 INFO L396 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 06:53:06,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 06:53:06,060 INFO L85 PathProgramCache]: Analyzing trace with hash -331283712, now seen corresponding path program 1 times [2024-12-02 06:53:06,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 06:53:06,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816509282] [2024-12-02 06:53:06,060 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:53:06,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 06:53:06,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:53:06,644 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 06:53:06,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 06:53:06,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816509282] [2024-12-02 06:53:06,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [816509282] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 06:53:06,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 06:53:06,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2024-12-02 06:53:06,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370406932] [2024-12-02 06:53:06,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 06:53:06,645 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-12-02 06:53:06,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 06:53:06,645 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-12-02 06:53:06,645 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=365, Unknown=0, NotChecked=0, Total=420 [2024-12-02 06:53:06,645 INFO L87 Difference]: Start difference. First operand 24288 states and 27946 transitions. Second operand has 21 states, 21 states have (on average 5.428571428571429) internal successors, (114), 21 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 06:53:08,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 06:53:08,264 INFO L93 Difference]: Finished difference Result 44529 states and 51451 transitions. [2024-12-02 06:53:08,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-12-02 06:53:08,265 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 5.428571428571429) internal successors, (114), 21 states have internal predecessors, (114), 0 states have call successors, (0), 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 06:53:08,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 06:53:08,290 INFO L225 Difference]: With dead ends: 44529 [2024-12-02 06:53:08,290 INFO L226 Difference]: Without dead ends: 42109 [2024-12-02 06:53:08,298 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 294 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=241, Invalid=1565, Unknown=0, NotChecked=0, Total=1806 [2024-12-02 06:53:08,298 INFO L435 NwaCegarLoop]: 343 mSDtfsCounter, 1000 mSDsluCounter, 4834 mSDsCounter, 0 mSdLazyCounter, 2309 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1000 SdHoareTripleChecker+Valid, 5177 SdHoareTripleChecker+Invalid, 2317 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 2309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-12-02 06:53:08,298 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1000 Valid, 5177 Invalid, 2317 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 2309 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-12-02 06:53:08,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42109 states. [2024-12-02 06:53:08,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42109 to 21849. [2024-12-02 06:53:08,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21849 states, 21848 states have (on average 1.1499450750640792) internal successors, (25124), 21848 states have internal predecessors, (25124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 06:53:08,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21849 states to 21849 states and 25124 transitions. [2024-12-02 06:53:08,516 INFO L78 Accepts]: Start accepts. Automaton has 21849 states and 25124 transitions. Word has length 114 [2024-12-02 06:53:08,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 06:53:08,516 INFO L471 AbstractCegarLoop]: Abstraction has 21849 states and 25124 transitions. [2024-12-02 06:53:08,516 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 5.428571428571429) internal successors, (114), 21 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 06:53:08,516 INFO L276 IsEmpty]: Start isEmpty. Operand 21849 states and 25124 transitions. [2024-12-02 06:53:08,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-12-02 06:53:08,517 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 06:53:08,517 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 06:53:08,517 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2024-12-02 06:53:08,518 INFO L396 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 06:53:08,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 06:53:08,518 INFO L85 PathProgramCache]: Analyzing trace with hash 1459777320, now seen corresponding path program 1 times [2024-12-02 06:53:08,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 06:53:08,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911671226] [2024-12-02 06:53:08,518 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:53:08,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 06:53:08,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:53:09,303 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 06:53:09,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 06:53:09,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911671226] [2024-12-02 06:53:09,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911671226] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 06:53:09,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [861607171] [2024-12-02 06:53:09,303 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:53:09,303 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 06:53:09,303 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_431199fd-7060-430a-960c-721b6172464a/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 06:53:09,304 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_431199fd-7060-430a-960c-721b6172464a/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 06:53:09,305 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_431199fd-7060-430a-960c-721b6172464a/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-12-02 06:53:09,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:53:09,461 INFO L256 TraceCheckSpWp]: Trace formula consists of 463 conjuncts, 50 conjuncts are in the unsatisfiable core [2024-12-02 06:53:09,462 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 06:53:11,096 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 06:53:11,096 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-12-02 06:53:11,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [861607171] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 06:53:11,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-12-02 06:53:11,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [24] total 45 [2024-12-02 06:53:11,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21020815] [2024-12-02 06:53:11,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 06:53:11,096 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-12-02 06:53:11,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 06:53:11,097 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-12-02 06:53:11,097 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=251, Invalid=1729, Unknown=0, NotChecked=0, Total=1980 [2024-12-02 06:53:11,097 INFO L87 Difference]: Start difference. First operand 21849 states and 25124 transitions. Second operand has 23 states, 23 states have (on average 4.956521739130435) internal successors, (114), 23 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 06:53:12,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 06:53:12,095 INFO L93 Difference]: Finished difference Result 25809 states and 29688 transitions. [2024-12-02 06:53:12,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-12-02 06:53:12,096 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 4.956521739130435) internal successors, (114), 23 states have internal predecessors, (114), 0 states have call successors, (0), 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 06:53:12,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 06:53:12,110 INFO L225 Difference]: With dead ends: 25809 [2024-12-02 06:53:12,110 INFO L226 Difference]: Without dead ends: 24981 [2024-12-02 06:53:12,114 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 555 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=426, Invalid=2544, Unknown=0, NotChecked=0, Total=2970 [2024-12-02 06:53:12,115 INFO L435 NwaCegarLoop]: 209 mSDtfsCounter, 349 mSDsluCounter, 2708 mSDsCounter, 0 mSdLazyCounter, 1420 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 349 SdHoareTripleChecker+Valid, 2917 SdHoareTripleChecker+Invalid, 1425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1420 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-12-02 06:53:12,115 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [349 Valid, 2917 Invalid, 1425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1420 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-12-02 06:53:12,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24981 states. [2024-12-02 06:53:12,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24981 to 21819. [2024-12-02 06:53:12,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21819 states, 21818 states have (on average 1.1498762489687413) internal successors, (25088), 21818 states have internal predecessors, (25088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 06:53:12,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21819 states to 21819 states and 25088 transitions. [2024-12-02 06:53:12,268 INFO L78 Accepts]: Start accepts. Automaton has 21819 states and 25088 transitions. Word has length 114 [2024-12-02 06:53:12,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 06:53:12,268 INFO L471 AbstractCegarLoop]: Abstraction has 21819 states and 25088 transitions. [2024-12-02 06:53:12,268 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 4.956521739130435) internal successors, (114), 23 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 06:53:12,268 INFO L276 IsEmpty]: Start isEmpty. Operand 21819 states and 25088 transitions. [2024-12-02 06:53:12,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-12-02 06:53:12,269 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 06:53:12,270 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] [2024-12-02 06:53:12,277 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_431199fd-7060-430a-960c-721b6172464a/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2024-12-02 06:53:12,470 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48,14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_431199fd-7060-430a-960c-721b6172464a/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 06:53:12,471 INFO L396 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 06:53:12,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 06:53:12,472 INFO L85 PathProgramCache]: Analyzing trace with hash -1402668983, now seen corresponding path program 1 times [2024-12-02 06:53:12,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 06:53:12,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657381883] [2024-12-02 06:53:12,472 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:53:12,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 06:53:12,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:53:13,072 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 06:53:13,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 06:53:13,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657381883] [2024-12-02 06:53:13,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1657381883] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 06:53:13,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1530895588] [2024-12-02 06:53:13,072 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:53:13,072 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 06:53:13,072 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_431199fd-7060-430a-960c-721b6172464a/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 06:53:13,074 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_431199fd-7060-430a-960c-721b6172464a/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 06:53:13,074 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_431199fd-7060-430a-960c-721b6172464a/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-12-02 06:53:13,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:53:13,243 INFO L256 TraceCheckSpWp]: Trace formula consists of 462 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-12-02 06:53:13,244 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 06:53:14,902 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 06:53:14,903 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 06:53:15,761 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 06:53:15,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1530895588] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 06:53:15,762 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 06:53:15,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 14] total 40 [2024-12-02 06:53:15,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089989405] [2024-12-02 06:53:15,762 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 06:53:15,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2024-12-02 06:53:15,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 06:53:15,763 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2024-12-02 06:53:15,763 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=1386, Unknown=0, NotChecked=0, Total=1560 [2024-12-02 06:53:15,763 INFO L87 Difference]: Start difference. First operand 21819 states and 25088 transitions. Second operand has 40 states, 40 states have (on average 7.425) internal successors, (297), 40 states have internal predecessors, (297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 06:53:17,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 06:53:17,637 INFO L93 Difference]: Finished difference Result 27169 states and 31222 transitions. [2024-12-02 06:53:17,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-12-02 06:53:17,637 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 7.425) internal successors, (297), 40 states have internal predecessors, (297), 0 states have call successors, (0), 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 115 [2024-12-02 06:53:17,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 06:53:17,650 INFO L225 Difference]: With dead ends: 27169 [2024-12-02 06:53:17,650 INFO L226 Difference]: Without dead ends: 23189 [2024-12-02 06:53:17,654 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 276 GetRequests, 208 SyntacticMatches, 1 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 953 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=887, Invalid=3805, Unknown=0, NotChecked=0, Total=4692 [2024-12-02 06:53:17,654 INFO L435 NwaCegarLoop]: 308 mSDtfsCounter, 2310 mSDsluCounter, 5206 mSDsCounter, 0 mSdLazyCounter, 1674 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2310 SdHoareTripleChecker+Valid, 5514 SdHoareTripleChecker+Invalid, 1716 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 1674 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-12-02 06:53:17,655 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2310 Valid, 5514 Invalid, 1716 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 1674 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-12-02 06:53:17,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23189 states. [2024-12-02 06:53:17,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23189 to 21285. [2024-12-02 06:53:17,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21285 states, 21284 states have (on average 1.1486092839691788) internal successors, (24447), 21284 states have internal predecessors, (24447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 06:53:17,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21285 states to 21285 states and 24447 transitions. [2024-12-02 06:53:17,797 INFO L78 Accepts]: Start accepts. Automaton has 21285 states and 24447 transitions. Word has length 115 [2024-12-02 06:53:17,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 06:53:17,797 INFO L471 AbstractCegarLoop]: Abstraction has 21285 states and 24447 transitions. [2024-12-02 06:53:17,797 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 7.425) internal successors, (297), 40 states have internal predecessors, (297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 06:53:17,797 INFO L276 IsEmpty]: Start isEmpty. Operand 21285 states and 24447 transitions. [2024-12-02 06:53:17,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-12-02 06:53:17,800 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 06:53:17,800 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 06:53:17,805 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_431199fd-7060-430a-960c-721b6172464a/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2024-12-02 06:53:18,000 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_431199fd-7060-430a-960c-721b6172464a/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable49 [2024-12-02 06:53:18,000 INFO L396 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 06:53:18,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 06:53:18,001 INFO L85 PathProgramCache]: Analyzing trace with hash 1967441841, now seen corresponding path program 1 times [2024-12-02 06:53:18,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 06:53:18,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281780963] [2024-12-02 06:53:18,001 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:53:18,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 06:53:18,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:53:18,392 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2024-12-02 06:53:18,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 06:53:18,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281780963] [2024-12-02 06:53:18,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1281780963] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 06:53:18,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 06:53:18,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-12-02 06:53:18,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139218232] [2024-12-02 06:53:18,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 06:53:18,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-12-02 06:53:18,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 06:53:18,393 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-12-02 06:53:18,393 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2024-12-02 06:53:18,393 INFO L87 Difference]: Start difference. First operand 21285 states and 24447 transitions. Second operand has 12 states, 12 states have (on average 8.416666666666666) internal successors, (101), 12 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 06:53:19,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 06:53:19,063 INFO L93 Difference]: Finished difference Result 31752 states and 36546 transitions. [2024-12-02 06:53:19,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-12-02 06:53:19,064 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 8.416666666666666) internal successors, (101), 12 states have internal predecessors, (101), 0 states have call successors, (0), 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 134 [2024-12-02 06:53:19,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 06:53:19,082 INFO L225 Difference]: With dead ends: 31752 [2024-12-02 06:53:19,083 INFO L226 Difference]: Without dead ends: 25350 [2024-12-02 06:53:19,089 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=140, Invalid=460, Unknown=0, NotChecked=0, Total=600 [2024-12-02 06:53:19,089 INFO L435 NwaCegarLoop]: 239 mSDtfsCounter, 1411 mSDsluCounter, 1585 mSDsCounter, 0 mSdLazyCounter, 552 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1411 SdHoareTripleChecker+Valid, 1824 SdHoareTripleChecker+Invalid, 562 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 552 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-12-02 06:53:19,089 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1411 Valid, 1824 Invalid, 562 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 552 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-12-02 06:53:19,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25350 states. [2024-12-02 06:53:19,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25350 to 21116. [2024-12-02 06:53:19,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21116 states, 21115 states have (on average 1.1442102770542268) internal successors, (24160), 21115 states have internal predecessors, (24160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 06:53:19,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21116 states to 21116 states and 24160 transitions. [2024-12-02 06:53:19,268 INFO L78 Accepts]: Start accepts. Automaton has 21116 states and 24160 transitions. Word has length 134 [2024-12-02 06:53:19,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 06:53:19,268 INFO L471 AbstractCegarLoop]: Abstraction has 21116 states and 24160 transitions. [2024-12-02 06:53:19,268 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.416666666666666) internal successors, (101), 12 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 06:53:19,268 INFO L276 IsEmpty]: Start isEmpty. Operand 21116 states and 24160 transitions. [2024-12-02 06:53:19,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-12-02 06:53:19,270 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 06:53:19,270 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 06:53:19,271 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2024-12-02 06:53:19,271 INFO L396 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 06:53:19,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 06:53:19,271 INFO L85 PathProgramCache]: Analyzing trace with hash 383813799, now seen corresponding path program 1 times [2024-12-02 06:53:19,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 06:53:19,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777485228] [2024-12-02 06:53:19,271 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:53:19,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 06:53:19,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-02 06:53:19,301 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-12-02 06:53:19,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-02 06:53:19,394 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-12-02 06:53:19,395 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-12-02 06:53:19,396 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-12-02 06:53:19,397 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2024-12-02 06:53:19,400 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 06:53:19,504 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-12-02 06:53:19,506 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 06:53:19 BoogieIcfgContainer [2024-12-02 06:53:19,506 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-12-02 06:53:19,507 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-12-02 06:53:19,507 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-12-02 06:53:19,507 INFO L274 PluginConnector]: Witness Printer initialized [2024-12-02 06:53:19,508 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 06:50:29" (3/4) ... [2024-12-02 06:53:19,509 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2024-12-02 06:53:19,660 INFO L129 tionWitnessGenerator]: Generated YAML witness of length 89. [2024-12-02 06:53:19,745 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_431199fd-7060-430a-960c-721b6172464a/bin/uautomizer-verify-84ZbGMXZE1/witness.graphml [2024-12-02 06:53:19,746 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_431199fd-7060-430a-960c-721b6172464a/bin/uautomizer-verify-84ZbGMXZE1/witness.yml [2024-12-02 06:53:19,746 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-12-02 06:53:19,746 INFO L158 Benchmark]: Toolchain (without parser) took 171812.00ms. Allocated memory was 142.6MB in the beginning and 13.3GB in the end (delta: 13.2GB). Free memory was 115.8MB in the beginning and 6.4GB in the end (delta: -6.3GB). Peak memory consumption was 6.9GB. Max. memory is 16.1GB. [2024-12-02 06:53:19,747 INFO L158 Benchmark]: CDTParser took 0.33ms. Allocated memory is still 142.6MB. Free memory was 83.2MB in the beginning and 83.2MB in the end (delta: 33.2kB). There was no memory consumed. Max. memory is 16.1GB. [2024-12-02 06:53:19,747 INFO L158 Benchmark]: CACSL2BoogieTranslator took 361.15ms. Allocated memory is still 142.6MB. Free memory was 115.8MB in the beginning and 97.6MB in the end (delta: 18.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-12-02 06:53:19,747 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.68ms. Allocated memory is still 142.6MB. Free memory was 97.6MB in the beginning and 94.4MB in the end (delta: 3.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-12-02 06:53:19,747 INFO L158 Benchmark]: Boogie Preprocessor took 51.31ms. Allocated memory is still 142.6MB. Free memory was 94.4MB in the beginning and 91.3MB in the end (delta: 3.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-12-02 06:53:19,747 INFO L158 Benchmark]: RCFGBuilder took 693.20ms. Allocated memory is still 142.6MB. Free memory was 91.3MB in the beginning and 111.2MB in the end (delta: -19.9MB). Peak memory consumption was 47.6MB. Max. memory is 16.1GB. [2024-12-02 06:53:19,748 INFO L158 Benchmark]: TraceAbstraction took 170417.65ms. Allocated memory was 142.6MB in the beginning and 13.3GB in the end (delta: 13.2GB). Free memory was 110.6MB in the beginning and 6.4GB in the end (delta: -6.3GB). Peak memory consumption was 6.9GB. Max. memory is 16.1GB. [2024-12-02 06:53:19,748 INFO L158 Benchmark]: Witness Printer took 238.80ms. Allocated memory is still 13.3GB. Free memory was 6.4GB in the beginning and 6.4GB in the end (delta: 33.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2024-12-02 06:53:19,749 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.33ms. Allocated memory is still 142.6MB. Free memory was 83.2MB in the beginning and 83.2MB in the end (delta: 33.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 361.15ms. Allocated memory is still 142.6MB. Free memory was 115.8MB in the beginning and 97.6MB in the end (delta: 18.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 44.68ms. Allocated memory is still 142.6MB. Free memory was 97.6MB in the beginning and 94.4MB in the end (delta: 3.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 51.31ms. Allocated memory is still 142.6MB. Free memory was 94.4MB in the beginning and 91.3MB in the end (delta: 3.1MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 693.20ms. Allocated memory is still 142.6MB. Free memory was 91.3MB in the beginning and 111.2MB in the end (delta: -19.9MB). Peak memory consumption was 47.6MB. Max. memory is 16.1GB. * TraceAbstraction took 170417.65ms. Allocated memory was 142.6MB in the beginning and 13.3GB in the end (delta: 13.2GB). Free memory was 110.6MB in the beginning and 6.4GB in the end (delta: -6.3GB). Peak memory consumption was 6.9GB. Max. memory is 16.1GB. * Witness Printer took 238.80ms. Allocated memory is still 13.3GB. Free memory was 6.4GB in the beginning and 6.4GB in the end (delta: 33.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 391]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L10] int __return_main; [L26] msg_t nomsg = (msg_t )-1; [L27] unsigned char r1 = '\x0'; [L28] port_t p1 = 0; [L29] char p1_old = '\x0'; [L30] char p1_new = '\x0'; [L31] char id1 = '\x0'; [L32] char st1 = '\x0'; [L33] msg_t send1 = '\x0'; [L34] _Bool mode1 = 0; [L35] _Bool alive1 = 0; [L36] port_t p2 = 0; [L37] char p2_old = '\x0'; [L38] char p2_new = '\x0'; [L39] char id2 = '\x0'; [L40] char st2 = '\x0'; [L41] msg_t send2 = '\x0'; [L42] _Bool mode2 = 0; [L43] _Bool alive2 = 0; [L44] port_t p3 = 0; [L45] char p3_old = '\x0'; [L46] char p3_new = '\x0'; [L47] char id3 = '\x0'; [L48] char st3 = '\x0'; [L49] msg_t send3 = '\x0'; [L50] _Bool mode3 = 0; [L51] _Bool alive3 = 0; [L55] void (*nodes[3])() = { &node1, &node2, &node3 }; [L59] int __return_5979; [L60] int __return_6056; [L61] int __return_6117; [L62] int __return_6183; [L63] int __return_6353; VAL [__return_5979=0, __return_6056=0, __return_6117=0, __return_6183=0, __return_6353=0, __return_main=0, alive1=0, alive2=0, alive3=0, id1=0, id2=0, id3=0, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=0, send2=0, send3=0, st1=0, st2=0, st3=0] [L66] int main__c1; [L67] int main__i2; [L68] main__c1 = 0 [L69] r1 = __VERIFIER_nondet_uchar() [L70] id1 = __VERIFIER_nondet_char() [L71] st1 = __VERIFIER_nondet_char() [L72] send1 = __VERIFIER_nondet_char() [L73] mode1 = __VERIFIER_nondet_bool() [L74] alive1 = __VERIFIER_nondet_bool() [L75] id2 = __VERIFIER_nondet_char() [L76] st2 = __VERIFIER_nondet_char() [L77] send2 = __VERIFIER_nondet_char() [L78] mode2 = __VERIFIER_nondet_bool() [L79] alive2 = __VERIFIER_nondet_bool() [L80] id3 = __VERIFIER_nondet_char() [L81] st3 = __VERIFIER_nondet_char() [L82] send3 = __VERIFIER_nondet_char() [L83] mode3 = __VERIFIER_nondet_bool() [L84] alive3 = __VERIFIER_nondet_bool() [L86] int init__tmp; VAL [__return_5979=0, __return_6056=0, __return_6117=0, __return_6183=0, __return_6353=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L87] COND TRUE ((int)r1) == 0 VAL [__return_5979=0, __return_6056=0, __return_6117=0, __return_6183=0, __return_6353=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L89] COND TRUE ((((int)alive1) + ((int)alive2)) + ((int)alive3)) >= 1 VAL [__return_5979=0, __return_6056=0, __return_6117=0, __return_6183=0, __return_6353=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L91] COND TRUE ((int)id1) >= 0 VAL [__return_5979=0, __return_6056=0, __return_6117=0, __return_6183=0, __return_6353=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L93] COND TRUE ((int)st1) == 0 VAL [__return_5979=0, __return_6056=0, __return_6117=0, __return_6183=0, __return_6353=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L95] COND TRUE ((int)send1) == ((int)id1) VAL [__return_5979=0, __return_6056=0, __return_6117=0, __return_6183=0, __return_6353=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L97] COND TRUE ((int)mode1) == 0 VAL [__return_5979=0, __return_6056=0, __return_6117=0, __return_6183=0, __return_6353=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L99] COND TRUE ((int)id2) >= 0 VAL [__return_5979=0, __return_6056=0, __return_6117=0, __return_6183=0, __return_6353=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L101] COND TRUE ((int)st2) == 0 VAL [__return_5979=0, __return_6056=0, __return_6117=0, __return_6183=0, __return_6353=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L103] COND TRUE ((int)send2) == ((int)id2) VAL [__return_5979=0, __return_6056=0, __return_6117=0, __return_6183=0, __return_6353=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L105] COND TRUE ((int)mode2) == 0 VAL [__return_5979=0, __return_6056=0, __return_6117=0, __return_6183=0, __return_6353=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L107] COND TRUE ((int)id3) >= 0 VAL [__return_5979=0, __return_6056=0, __return_6117=0, __return_6183=0, __return_6353=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L109] COND TRUE ((int)st3) == 0 VAL [__return_5979=0, __return_6056=0, __return_6117=0, __return_6183=0, __return_6353=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L111] COND TRUE ((int)send3) == ((int)id3) VAL [__return_5979=0, __return_6056=0, __return_6117=0, __return_6183=0, __return_6353=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L113] COND TRUE ((int)mode3) == 0 VAL [__return_5979=0, __return_6056=0, __return_6117=0, __return_6183=0, __return_6353=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L115] COND TRUE ((int)id1) != ((int)id2) VAL [__return_5979=0, __return_6056=0, __return_6117=0, __return_6183=0, __return_6353=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L117] COND TRUE ((int)id1) != ((int)id3) VAL [__return_5979=0, __return_6056=0, __return_6117=0, __return_6183=0, __return_6353=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L119] COND TRUE ((int)id2) != ((int)id3) [L121] init__tmp = 1 [L122] __return_5979 = init__tmp [L123] main__i2 = __return_5979 VAL [__return_5979=1, __return_6056=0, __return_6117=0, __return_6183=0, __return_6353=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, main__i2=1, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L124] COND TRUE main__i2 != 0 [L126] p1_old = nomsg [L127] p1_new = nomsg [L128] p2_old = nomsg [L129] p2_new = nomsg [L130] p3_old = nomsg [L131] p3_new = nomsg [L132] main__i2 = 0 [L134] msg_t node1__m1; [L135] node1__m1 = nomsg VAL [__return_5979=1, __return_6056=0, __return_6117=0, __return_6183=0, __return_6353=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L136] COND FALSE !(!(mode1 == 0)) VAL [__return_5979=1, __return_6056=0, __return_6117=0, __return_6183=0, __return_6353=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L142] COND FALSE !(!(alive1 == 0)) VAL [__return_5979=1, __return_6056=0, __return_6117=0, __return_6183=0, __return_6353=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L153] mode1 = 1 [L155] msg_t node2__m2; [L156] node2__m2 = nomsg VAL [__return_5979=1, __return_6056=0, __return_6117=0, __return_6183=0, __return_6353=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L157] COND FALSE !(!(mode2 == 0)) VAL [__return_5979=1, __return_6056=0, __return_6117=0, __return_6183=0, __return_6353=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L163] COND FALSE !(!(alive2 == 0)) VAL [__return_5979=1, __return_6056=0, __return_6117=0, __return_6183=0, __return_6353=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L921] COND FALSE !(((int)send2) != ((int)id2)) VAL [__return_5979=1, __return_6056=0, __return_6117=0, __return_6183=0, __return_6353=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L174] mode2 = 1 [L176] msg_t node3__m3; [L177] node3__m3 = nomsg VAL [__return_5979=1, __return_6056=0, __return_6117=0, __return_6183=0, __return_6353=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L178] COND FALSE !(!(mode3 == 0)) VAL [__return_5979=1, __return_6056=0, __return_6117=0, __return_6183=0, __return_6353=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L184] COND TRUE !(alive3 == 0) [L186] int node3____CPAchecker_TMP_0; VAL [__return_5979=1, __return_6056=0, __return_6117=0, __return_6183=0, __return_6353=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L187] COND TRUE send3 != nomsg VAL [__return_5979=1, __return_6056=0, __return_6117=0, __return_6183=0, __return_6353=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L189] COND TRUE p3_new == nomsg [L191] node3____CPAchecker_TMP_0 = send3 VAL [__return_5979=1, __return_6056=0, __return_6117=0, __return_6183=0, __return_6353=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=0, node3____CPAchecker_TMP_0=127, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L193] p3_new = node3____CPAchecker_TMP_0 VAL [__return_5979=1, __return_6056=0, __return_6117=0, __return_6183=0, __return_6353=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=127, p3_old=-1, r1=0, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L195] mode3 = 1 [L196] p1_old = p1_new [L197] p1_new = nomsg [L198] p2_old = p2_new [L199] p2_new = nomsg [L200] p3_old = p3_new [L201] p3_new = nomsg [L203] int check__tmp; VAL [__return_5979=1, __return_6056=0, __return_6117=0, __return_6183=0, __return_6353=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=127, r1=0, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L204] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) <= 1 VAL [__return_5979=1, __return_6056=0, __return_6117=0, __return_6183=0, __return_6353=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=127, r1=0, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L206] COND TRUE ((int)r1) < 3 [L208] check__tmp = 1 [L209] __return_6056 = check__tmp [L210] main__c1 = __return_6056 [L212] _Bool __tmp_1; [L213] __tmp_1 = main__c1 [L214] _Bool assert__arg; [L215] assert__arg = __tmp_1 VAL [__return_5979=1, __return_6056=1, __return_6117=0, __return_6183=0, __return_6353=0, __return_main=0, alive1=0, alive2=0, alive3=1, assert__arg=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=127, r1=0, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L216] COND FALSE !(assert__arg == 0) [L223] msg_t node1__m1; [L224] node1__m1 = nomsg VAL [__return_5979=1, __return_6056=1, __return_6117=0, __return_6183=0, __return_6353=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=127, r1=0, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L225] COND TRUE !(mode1 == 0) VAL [__return_5979=1, __return_6056=1, __return_6117=0, __return_6183=0, __return_6353=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=127, r1=0, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L227] COND FALSE !(r1 == 255) [L233] r1 = r1 + 1 [L234] node1__m1 = p3_old [L235] p3_old = nomsg VAL [__return_5979=1, __return_6056=1, __return_6117=0, __return_6183=0, __return_6353=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=1, node1__m1=127, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L236] COND TRUE ((int)node1__m1) != ((int)nomsg) VAL [__return_5979=1, __return_6056=1, __return_6117=0, __return_6183=0, __return_6353=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=1, node1__m1=127, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L238] COND FALSE !(!(alive1 == 0)) [L835] send1 = node1__m1 VAL [__return_5979=1, __return_6056=1, __return_6117=0, __return_6183=0, __return_6353=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L245] mode1 = 0 [L247] msg_t node2__m2; [L248] node2__m2 = nomsg VAL [__return_5979=1, __return_6056=1, __return_6117=0, __return_6183=0, __return_6353=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L249] COND TRUE !(mode2 == 0) [L251] node2__m2 = p1_old [L252] p1_old = nomsg VAL [__return_5979=1, __return_6056=1, __return_6117=0, __return_6183=0, __return_6353=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=1, mode3=1, node2__m2=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L253] COND FALSE !(((int)node2__m2) != ((int)nomsg)) VAL [__return_5979=1, __return_6056=1, __return_6117=0, __return_6183=0, __return_6353=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L262] mode2 = 0 [L264] msg_t node3__m3; [L265] node3__m3 = nomsg VAL [__return_5979=1, __return_6056=1, __return_6117=0, __return_6183=0, __return_6353=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L266] COND TRUE !(mode3 == 0) [L268] node3__m3 = p2_old [L269] p2_old = nomsg VAL [__return_5979=1, __return_6056=1, __return_6117=0, __return_6183=0, __return_6353=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L270] COND FALSE !(((int)node3__m3) != ((int)nomsg)) VAL [__return_5979=1, __return_6056=1, __return_6117=0, __return_6183=0, __return_6353=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L279] mode3 = 0 [L280] p1_old = p1_new [L281] p1_new = nomsg [L282] p2_old = p2_new [L283] p2_new = nomsg [L284] p3_old = p3_new [L285] p3_new = nomsg [L287] int check__tmp; VAL [__return_5979=1, __return_6056=1, __return_6117=0, __return_6183=0, __return_6353=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L288] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) <= 1 VAL [__return_5979=1, __return_6056=1, __return_6117=0, __return_6183=0, __return_6353=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L290] COND TRUE ((int)r1) < 3 [L292] check__tmp = 1 [L293] __return_6117 = check__tmp [L294] main__c1 = __return_6117 [L296] _Bool __tmp_2; [L297] __tmp_2 = main__c1 [L298] _Bool assert__arg; [L299] assert__arg = __tmp_2 VAL [__return_5979=1, __return_6056=1, __return_6117=1, __return_6183=0, __return_6353=0, __return_main=0, alive1=0, alive2=0, alive3=1, assert__arg=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L300] COND FALSE !(assert__arg == 0) [L307] msg_t node1__m1; [L308] node1__m1 = nomsg VAL [__return_5979=1, __return_6056=1, __return_6117=1, __return_6183=0, __return_6353=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L309] COND FALSE !(!(mode1 == 0)) VAL [__return_5979=1, __return_6056=1, __return_6117=1, __return_6183=0, __return_6353=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L711] COND FALSE !(!(alive1 == 0)) VAL [__return_5979=1, __return_6056=1, __return_6117=1, __return_6183=0, __return_6353=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L722] mode1 = 1 VAL [__return_5979=1, __return_6056=1, __return_6117=1, __return_6183=0, __return_6353=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L331] msg_t node2__m2; [L332] node2__m2 = nomsg VAL [__return_5979=1, __return_6056=1, __return_6117=1, __return_6183=0, __return_6353=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L333] COND FALSE !(!(mode2 == 0)) VAL [__return_5979=1, __return_6056=1, __return_6117=1, __return_6183=0, __return_6353=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L620] COND FALSE !(!(alive2 == 0)) VAL [__return_5979=1, __return_6056=1, __return_6117=1, __return_6183=0, __return_6353=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L648] COND FALSE !(((int)send2) != ((int)id2)) VAL [__return_5979=1, __return_6056=1, __return_6117=1, __return_6183=0, __return_6353=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L631] mode2 = 1 VAL [__return_5979=1, __return_6056=1, __return_6117=1, __return_6183=0, __return_6353=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L349] msg_t node3__m3; [L350] node3__m3 = nomsg VAL [__return_5979=1, __return_6056=1, __return_6117=1, __return_6183=0, __return_6353=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L351] COND FALSE !(!(mode3 == 0)) VAL [__return_5979=1, __return_6056=1, __return_6117=1, __return_6183=0, __return_6353=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L534] COND TRUE !(alive3 == 0) [L536] int node3____CPAchecker_TMP_0; VAL [__return_5979=1, __return_6056=1, __return_6117=1, __return_6183=0, __return_6353=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L537] COND TRUE send3 != nomsg VAL [__return_5979=1, __return_6056=1, __return_6117=1, __return_6183=0, __return_6353=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L539] COND TRUE p3_new == nomsg [L541] node3____CPAchecker_TMP_0 = send3 VAL [__return_5979=1, __return_6056=1, __return_6117=1, __return_6183=0, __return_6353=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=0, node3____CPAchecker_TMP_0=127, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L543] p3_new = node3____CPAchecker_TMP_0 VAL [__return_5979=1, __return_6056=1, __return_6117=1, __return_6183=0, __return_6353=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=127, p3_old=-1, r1=1, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L545] mode3 = 1 VAL [__return_5979=1, __return_6056=1, __return_6117=1, __return_6183=0, __return_6353=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=127, p3_old=-1, r1=1, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L366] p1_old = p1_new [L367] p1_new = nomsg [L368] p2_old = p2_new [L369] p2_new = nomsg [L370] p3_old = p3_new [L371] p3_new = nomsg [L373] int check__tmp; VAL [__return_5979=1, __return_6056=1, __return_6117=1, __return_6183=0, __return_6353=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=127, r1=1, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L374] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) <= 1 VAL [__return_5979=1, __return_6056=1, __return_6117=1, __return_6183=0, __return_6353=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=127, r1=1, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L376] COND TRUE ((int)r1) < 3 [L378] check__tmp = 1 VAL [__return_5979=1, __return_6056=1, __return_6117=1, __return_6183=0, __return_6353=0, __return_main=0, alive1=0, alive2=0, alive3=1, check__tmp=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=127, r1=1, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L381] __return_6183 = check__tmp [L382] main__c1 = __return_6183 VAL [__return_5979=1, __return_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, main__c1=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=1, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L385] _Bool __tmp_3; [L386] __tmp_3 = main__c1 [L387] _Bool assert__arg; [L388] assert__arg = __tmp_3 VAL [__return_5979=1, __return_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, alive1=0, alive2=0, alive3=1, assert__arg=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=127, r1=1, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L389] COND FALSE !(assert__arg == 0) [L397] msg_t node1__m1; [L398] node1__m1 = nomsg VAL [__return_5979=1, __return_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=127, r1=1, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L399] COND TRUE !(mode1 == 0) VAL [__return_5979=1, __return_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=127, r1=1, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L401] COND FALSE !(r1 == 255) VAL [__return_5979=1, __return_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=127, r1=1, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L405] r1 = r1 + 1 [L406] node1__m1 = p3_old [L407] p3_old = nomsg VAL [__return_5979=1, __return_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=1, node1__m1=127, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L408] COND TRUE ((int)node1__m1) != ((int)nomsg) VAL [__return_5979=1, __return_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=1, node1__m1=127, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L410] COND FALSE !(!(alive1 == 0)) [L436] send1 = node1__m1 VAL [__return_5979=1, __return_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L417] mode1 = 0 VAL [__return_5979=1, __return_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L331] msg_t node2__m2; [L332] node2__m2 = nomsg VAL [__return_5979=1, __return_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L333] COND TRUE !(mode2 == 0) [L335] node2__m2 = p1_old [L336] p1_old = nomsg VAL [__return_5979=1, __return_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=1, mode3=1, node2__m2=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L337] COND FALSE !(((int)node2__m2) != ((int)nomsg)) VAL [__return_5979=1, __return_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L346] mode2 = 0 VAL [__return_5979=1, __return_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L349] msg_t node3__m3; [L350] node3__m3 = nomsg VAL [__return_5979=1, __return_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L351] COND TRUE !(mode3 == 0) [L353] node3__m3 = p2_old [L354] p2_old = nomsg VAL [__return_5979=1, __return_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L355] COND FALSE !(((int)node3__m3) != ((int)nomsg)) VAL [__return_5979=1, __return_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L364] mode3 = 0 VAL [__return_5979=1, __return_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L366] p1_old = p1_new [L367] p1_new = nomsg [L368] p2_old = p2_new [L369] p2_new = nomsg [L370] p3_old = p3_new [L371] p3_new = nomsg [L373] int check__tmp; VAL [__return_5979=1, __return_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L374] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) <= 1 VAL [__return_5979=1, __return_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L376] COND TRUE ((int)r1) < 3 [L378] check__tmp = 1 VAL [__return_5979=1, __return_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, alive1=0, alive2=0, alive3=1, check__tmp=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L381] __return_6183 = check__tmp [L382] main__c1 = __return_6183 VAL [__return_5979=1, __return_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, main__c1=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=2, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L385] _Bool __tmp_3; [L386] __tmp_3 = main__c1 [L387] _Bool assert__arg; [L388] assert__arg = __tmp_3 VAL [__return_5979=1, __return_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, alive1=0, alive2=0, alive3=1, assert__arg=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L389] COND FALSE !(assert__arg == 0) [L397] msg_t node1__m1; [L398] node1__m1 = nomsg VAL [__return_5979=1, __return_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L399] COND FALSE !(!(mode1 == 0)) VAL [__return_5979=1, __return_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L452] COND FALSE !(!(alive1 == 0)) VAL [__return_5979=1, __return_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L463] mode1 = 1 VAL [__return_5979=1, __return_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L331] msg_t node2__m2; [L332] node2__m2 = nomsg VAL [__return_5979=1, __return_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L333] COND FALSE !(!(mode2 == 0)) VAL [__return_5979=1, __return_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L620] COND FALSE !(!(alive2 == 0)) VAL [__return_5979=1, __return_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L648] COND FALSE !(((int)send2) != ((int)id2)) VAL [__return_5979=1, __return_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L631] mode2 = 1 VAL [__return_5979=1, __return_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L349] msg_t node3__m3; [L350] node3__m3 = nomsg VAL [__return_5979=1, __return_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L351] COND FALSE !(!(mode3 == 0)) VAL [__return_5979=1, __return_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L534] COND TRUE !(alive3 == 0) [L536] int node3____CPAchecker_TMP_0; VAL [__return_5979=1, __return_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L537] COND TRUE send3 != nomsg VAL [__return_5979=1, __return_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L539] COND TRUE p3_new == nomsg [L541] node3____CPAchecker_TMP_0 = send3 VAL [__return_5979=1, __return_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=0, node3____CPAchecker_TMP_0=127, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L543] p3_new = node3____CPAchecker_TMP_0 VAL [__return_5979=1, __return_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=127, p3_old=-1, r1=2, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L545] mode3 = 1 VAL [__return_5979=1, __return_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=127, p3_old=-1, r1=2, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L366] p1_old = p1_new [L367] p1_new = nomsg [L368] p2_old = p2_new [L369] p2_new = nomsg [L370] p3_old = p3_new [L371] p3_new = nomsg [L373] int check__tmp; VAL [__return_5979=1, __return_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=127, r1=2, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L374] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) <= 1 VAL [__return_5979=1, __return_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=127, r1=2, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L376] COND TRUE ((int)r1) < 3 [L378] check__tmp = 1 VAL [__return_5979=1, __return_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, alive1=0, alive2=0, alive3=1, check__tmp=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=127, r1=2, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L381] __return_6183 = check__tmp [L382] main__c1 = __return_6183 VAL [__return_5979=1, __return_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, main__c1=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=2, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L385] _Bool __tmp_3; [L386] __tmp_3 = main__c1 [L387] _Bool assert__arg; [L388] assert__arg = __tmp_3 VAL [__return_5979=1, __return_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, alive1=0, alive2=0, alive3=1, assert__arg=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=127, r1=2, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L389] COND FALSE !(assert__arg == 0) [L397] msg_t node1__m1; [L398] node1__m1 = nomsg VAL [__return_5979=1, __return_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=127, r1=2, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L399] COND TRUE !(mode1 == 0) VAL [__return_5979=1, __return_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=127, r1=2, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L401] COND FALSE !(r1 == 255) VAL [__return_5979=1, __return_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=127, r1=2, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L405] r1 = r1 + 1 [L406] node1__m1 = p3_old [L407] p3_old = nomsg VAL [__return_5979=1, __return_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=1, node1__m1=127, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L408] COND TRUE ((int)node1__m1) != ((int)nomsg) VAL [__return_5979=1, __return_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=1, node1__m1=127, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L410] COND FALSE !(!(alive1 == 0)) [L436] send1 = node1__m1 VAL [__return_5979=1, __return_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L417] mode1 = 0 VAL [__return_5979=1, __return_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L331] msg_t node2__m2; [L332] node2__m2 = nomsg VAL [__return_5979=1, __return_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L333] COND TRUE !(mode2 == 0) [L335] node2__m2 = p1_old [L336] p1_old = nomsg VAL [__return_5979=1, __return_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=1, mode3=1, node2__m2=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L337] COND FALSE !(((int)node2__m2) != ((int)nomsg)) VAL [__return_5979=1, __return_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L346] mode2 = 0 VAL [__return_5979=1, __return_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L349] msg_t node3__m3; [L350] node3__m3 = nomsg VAL [__return_5979=1, __return_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L351] COND TRUE !(mode3 == 0) [L353] node3__m3 = p2_old [L354] p2_old = nomsg VAL [__return_5979=1, __return_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L355] COND FALSE !(((int)node3__m3) != ((int)nomsg)) VAL [__return_5979=1, __return_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L364] mode3 = 0 VAL [__return_5979=1, __return_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L366] p1_old = p1_new [L367] p1_new = nomsg [L368] p2_old = p2_new [L369] p2_new = nomsg [L370] p3_old = p3_new [L371] p3_new = nomsg [L373] int check__tmp; VAL [__return_5979=1, __return_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L374] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) <= 1 VAL [__return_5979=1, __return_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L376] COND FALSE !(((int)r1) < 3) VAL [__return_5979=1, __return_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L489] COND FALSE !(((((int)st1) + ((int)st2)) + ((int)st3)) == 1) [L496] check__tmp = 0 VAL [__return_5979=1, __return_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, alive1=0, alive2=0, alive3=1, check__tmp=0, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L381] __return_6183 = check__tmp [L382] main__c1 = __return_6183 VAL [__return_5979=1, __return_6056=1, __return_6117=1, __return_6183=0, __return_6353=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, main__c1=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=3, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L385] _Bool __tmp_3; [L386] __tmp_3 = main__c1 [L387] _Bool assert__arg; [L388] assert__arg = __tmp_3 VAL [__return_5979=1, __return_6056=1, __return_6117=1, __return_6183=0, __return_6353=0, __return_main=0, alive1=0, alive2=0, alive3=1, assert__arg=0, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L389] COND TRUE assert__arg == 0 VAL [__return_5979=1, __return_6056=1, __return_6117=1, __return_6183=0, __return_6353=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L391] reach_error() VAL [__return_5979=1, __return_6056=1, __return_6117=1, __return_6183=0, __return_6353=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 147 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 170.3s, OverallIterations: 52, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 97.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 62679 SdHoareTripleChecker+Valid, 30.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 62679 mSDsluCounter, 103460 SdHoareTripleChecker+Invalid, 26.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 91176 mSDsCounter, 981 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 51152 IncrementalHoareTripleChecker+Invalid, 52133 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 981 mSolverCounterUnsat, 12284 mSDtfsCounter, 51152 mSolverCounterSat, 0.4s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 4103 GetRequests, 2447 SyntacticMatches, 7 SemanticMatches, 1649 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72853 ImplicationChecksByTransitivity, 61.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=159421occurred in iteration=32, InterpolantAutomatonStates: 1251, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 28.4s AutomataMinimizationTime, 51 MinimizatonAttempts, 1525600 StatesRemovedByMinimization, 50 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.5s SatisfiabilityAnalysisTime, 37.4s InterpolantComputationTime, 5770 NumberOfCodeBlocks, 5770 NumberOfCodeBlocksAsserted, 66 NumberOfCheckSat, 6716 ConstructedInterpolants, 4 QuantifiedInterpolants, 66746 SizeOfPredicates, 60 NumberOfNonLiveVariables, 6337 ConjunctsInSsa, 323 ConjunctsInUnsatCore, 76 InterpolantComputations, 40 PerfectInterpolantSequences, 399/514 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 06:53:19,776 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_431199fd-7060-430a-960c-721b6172464a/bin/uautomizer-verify-84ZbGMXZE1/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE